Abstract
We consider a multi-server non-preemptive queue with high and low priority customers, and a decision maker who decides when waiting customers may enter service. The goal is to minimize the mean waiting time for high-priority customers while keeping the queue stable. We use a linear programming approach to find and evaluate the performance of an asymptotically optimal policy in the setting of exponential service and inter-arrival times.
Similar content being viewed by others
References
A. Federgruen and H. Groenevelt, M/G/c queueing systems with multiple customer classes: characterization and control of achievable performance under nonpreemptive priority rules, Managm. Sci. 34(9) (1988) 1121-1138.
H.R. Gail, S.L. Hantler and B.A. Taylor, Analysis of a nonpreemptive priority multiserver queue, Adv. in Appl. Probab. 20(4) (1988) 852-879.
E. Gelenbe and G. Pujolle, Introduction to Queueing Networks, 2nd ed. (Wiley, New York, 1999).
K.D. Glazebrook and J. Niñ o-Mora, Parallel scheduling of multiclass M/M/m queues: Approximate and heavy-traffic optimization of achievable performance, Oper. Res. 49(4) (2001) 609-623.
L.C.M. Kallenberg, Survey of linear programming for standard and nonstandard Markovian control problems. I. Theory, Z. Oper. Res. 40(1) (1994) 1-42.
L.C.M. Kallenberg, Survey of linear programming for standard and nonstandard Markovian control problems. II. Applications, Z. Oper. Res. 40(2) (1994) 127-143.
O. Kella and U. Yechiali, Waiting times in the nonpreemptive priority M/M/c queue, Comm. Statist. Stochastic Models 1(2) (1985) 257-262.
S.M. Ross, Stochastic Processes, 2nd ed. (Wiley, New York, 1996).
C. Schaack and R.C. Larson, An N-server cutoff priority queue, Oper. Res. 34(2) (1986) 257-266.
T. Takine, The nonpreemptive priority MAP/G/1 queue, Oper. Res. 47(6) (1999) 917-927.
I.D.S. Taylor and J.G.C. Templeton, Waiting time in a multiserver cutoff-priority queue, and its application to an urban ambulance service, Oper. Res. 28(5) (1980) 1168-1188.
T.M. Williams, Nonpreemptive multiserver priority queues, J. Oper. Res. Soc. 31(12) (1980) 1105-1107.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Peköz, E.A. Optimal Policies for Multi-server Non-preemptive Priority Queues. Queueing Systems 42, 91–101 (2002). https://doi.org/10.1023/A:1019946812169
Issue Date:
DOI: https://doi.org/10.1023/A:1019946812169