Analysis of nonpreemptive priority queues with multiple servers and two priority classes

Analysis of nonpreemptive priority queues with multiple servers and two priority classes

0.00 Avg rating0 Votes
Article ID: iaor20003097
Country: Netherlands
Volume: 118
Issue: 1
Start Page Number: 181
End Page Number: 193
Publication Date: Oct 1999
Journal: European Journal of Operational Research
Authors: ,
Abstract:

In this paper, we model a priority multiserver queueing system with two priority classes. A high priority customer has nonpreemptive priority over low priority customers. The approaches for solving the problem are the state-reduction based variant of Kao, the modified boundary algorithm of Latouche, the logarithmic reduction algorithm of Latouche and Ramaswami, and the power-series method of Blanc. The objectives of this paper are to present a power-series implementation for the priority queue and to evaluate the relative efficiencies of alternative procedures to compute various performance characteristics. In the paper, we find that at times the logarithmic reduction algorithm may not perform as well as expected and the power-series approach can occasionally pose numerical difficulties.

Reviews

Required fields are marked *. Your email address will not be published.