Comparison of Efficiency Measures of Non-Priority and Non-Pre-Emptive Priority Queues

OpenAlex İngilizce

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.