Abstract
We consider a multi-class, multi-server queuing system with preemptive priorities. We distinguish three groups of priority classes that consist of multiple customer types, each having their own arrival and service rate. We assume Poisson arrival processes and exponentially distributed service times. The performance of the system is described in event language. The created software automatically constructs and solves system of equilibrium equations to find steady state probabilities. We suggest a numerical-analytic method to estimate the probabilities. Based on these probabilities, we can compute a wide range of relevant performance characteristics, such as average number of customers of a certain type in the system and expected postponement time for each customer class.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
