Queueing Systems

, Volume 50, Issue 1, pp 81–107 | Cite as

An Exact Solution for the State Probabilities of the Multi-Class, Multi-Server Queue with Preemptive Priorities

  • Andrei Sleptchenko
  • Aart van Harten
  • Matthieu van der Heijden


We consider a multi-class, multi-server queueing system with preemptive priorities. We distinguish two 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. We derive an exact method to estimate the steady state probabilities. Because we need iterations to calculate the steady state probabilities, the only error arises from choosing a finite number of matrix iterations. Based on these probabilities, we can derive approximations for a wide range of relevant performance characteristics, such as the moments of the number of customers of a certain type in the system en the expected postponement time for each customer class. We illustrate our method with some numerical examples. Numerical results show that in most cases we need only a moderate number of matrix iterations (∼20) to obtain an error less than 1% when estimating key performance characteristics.

queueing multi-class multi-server preemptive priority 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J.P. Buzen and A.B. Bondi, The response times of priority classes under preemptive resume in M/M/m queues, Operations Research 31(3) (1983) 456–465.Google Scholar
  2. [2]
    J.H.A. de Smit, A numerical solution for the multi-server queue with hyperexponential service time, Operations Research Letters 2(5) (1983) 217–224.Google Scholar
  3. [3]
    H.R. Gail, S.L. Hantler and B.A. Taylor, Analysis of a non-preemptive priority multiserver queue, Advances in Applied Probability 20(4) (1988) 852–879.Google Scholar
  4. [4]
    H.R. Gail, S.L. Hantler and B.A. Taylor, On preemptive Markovian queue with multiple servers and two priority classes, Mathematics of Operations Research 17(2) (1992) 365–391.Google Scholar
  5. [5]
    G. Hooghiemstra, M. Keane and S. van de Ree, Power series for stationary distributions of coupled processor models, SIAM Journal on Applied Mathematics 48(5) (1988) 1159–1166.CrossRefGoogle Scholar
  6. [6]
    E.P.C. Kao and K.S. Narayanan, Computing steady state probabilities of a nonpreemptive priority queue, ORSA Journal on Computing 2 (1990) 211–218.Google Scholar
  7. [7]
    E.P.C. Kao and S.D. Wilson, Analysis of nonpreemptive priority queues with multiple servers and two priority classes, European Journal of Operational Research 118 (1999) 181–193.CrossRefGoogle Scholar
  8. [8]
    O. Kella and U. Yechiali, Waiting times in the non-preemptive priority M/M/c queue, Communications in Statistics—Stochastic Models 1 (1985) 257–262.Google Scholar
  9. [9]
    C. Maglaras, Dynamic scheduling in multiclass queueing networks, Queueing Systems 31 (1999) 171–206.CrossRefGoogle Scholar
  10. [10]
    D.R. Miller, Computation of steady-state probabilities for M/M/1 priority queues, Operations Research 29(5) (1981) 945–958.Google Scholar
  11. [11]
    I. Mitrani and P.J.B. King, Multiprocessor systems with preemptive priorities, Performance Evaluation 1 (1981) 118–125.CrossRefGoogle Scholar
  12. [12]
    M.I. Reiman and L.M. Wein, Dynamic scheduling of a two-class queue with setups, Operations Research 46(4) (1998) 532–537.Google Scholar
  13. [13]
    C.C. Sherbrooke, Optimal Inventory Modelling of Systems: Multi-Echelon Techniques, (Wiley, New York 1992).Google Scholar
  14. [14]
    A. Sleptchenko, M.C. van der Heijden and A. van Harten, Effects of finite repair capacity in multi-echelon, multi-indenture service part supply systems, International Journal of Production Economics, 79 (2002) 109–230.Google Scholar
  15. [15]
    H.C. Tijms, Stochastic Models: An Algorithmic Approach, (John Willey and Sons, Chichester, 1994).Google Scholar
  16. [16]
    A. van Harten and A. Sleptchenko, On multi-class, multi-server queuing and spare part management, Queueing Systems 43(4) (2003) 307–328.CrossRefGoogle Scholar
  17. [17]
    M.C. van der Heijden, A. Sleptchenko and A. van Harten, Approximations for Markovian multi-class queues with preemptive priorities, working paper, University of Twente, Faculty of Business, Public Administration and Technology (2002) (submitted for publication).Google Scholar
  18. [18]
    D. Wagner, of a finite-capacity multi-server model with non-preemptive priorities, European Journal of Operational Research 102 (1997) 227–241.CrossRefGoogle Scholar
  19. [19]
    D. Wagner, Analysis of mean values of a multi-server model with non-preemptive priorities and non-renewal input, Communications in Statistics—Stochastic Models 13(1) (1997) 67–84.Google Scholar
  20. [20]
    D. Wagner, A finite-capacity multi-server multi-queueing model with non-renewal input, Annals of Operations Research 79 (1998) 63–82.CrossRefGoogle Scholar
  21. [21]
    L.M. Wein, Dynamic scheduling of a multiclass make-to-stock queue, Operations Research 40(4) (1992) 724–735.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  • Andrei Sleptchenko
    • 1
  • Aart van Harten
    • 2
  • Matthieu van der Heijden
    • 2
  1. 1.EURANDOMEindhoven University of TechnologyEindhovenThe Netherlands
  2. 2.Department of Technology and ManagementUniversity of TwenteEnschedeThe Netherlands

Personalised recommendations