Abstract
When there are different customer classes in a queue system, the j-th class customers have their services before the j+1,j=1,2,… class customers. Such queues are named as queues with priority scheduling. In this study a Markov priority queue system with two customer classes is analyzed both under non-pre-emptive and nonpriority scheduling and the efficiency measures (the expected number of customer in system, the average waiting time in system) are obtained using Little’s Law. The efficiency criteria are compared according to the priority situation. In addition, parameter estimates were compared with simulation results. The simulation was performed using the R program.
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 callMore From: The Journal of International Scientific Researches
Disclaimer: 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.
