An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities

Queueing Systems

Volumn 50, Issue 1, 2005, Pages 81-107

  Sleptchenko, Andrei ^a   Van Harten, Aart ^b   Van Der Heijden, Matthieu ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Multi class; Multi server; Preemptive priority; Queueing

Indexed keywords

NUMERICAL METHODS; QUEUEING NETWORKS; QUEUEING THEORY; SALES;

DISTRIBUTED SERVICE; MULTI-CLASS; MULTI-SERVER; PERFORMANCE CHARACTERISTICS; POISSON ARRIVAL PROCESS; PREEMPTIVE PRIORITY; QUEUEING; STEADY STATE PROBABILITIES;

MATRIX ALGEBRA;

EID: 21644472692     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1007/s11134-005-0359-y     Document Type: Article

References (21)

1. J.P. Buzen and A.H. Bondi, The response times of priority classes under preemptive resume in M/M/m queues, Operations Research 31(3) (1983) 456-465.
2. J.H.A. du Smit, A numerical solution for the multi-server queue with hyperexponential service time, Operations Research Letters 2(5) (1983) 217-224.
3. H.R. Gail, S.L. Hantler and H.A. Taylor, Analysis of a non-preemptive priority multiserver queue, Advances in Applied Probability 20(4) (1988) 852-879.
4. H.R. Gail, S.L. Hantler and H.A. Taylor, On preemptive Markovian queue with multiple servers and two priority classes, Mathematics of Operations Research 17(2) (1992) 365- 391.
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.
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.
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.
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.
9. C. Maglaras, Dynamic scheduling in multiclass queueing networks, Queueing Systems 31 (1999) 171-206.
10. D.R. Miller, Computation of steady-state probabilities for M/M/1 priority queues, Operations Research 29(5) (1981) 945-958.
11. I. Mitrani and P.J.B. King, Multiprocessor systems with preemptive priorities, Performance Evaluation 1 (1981) 118-125.
12. M.I. Reiman and K.M. Wein, Dynamic scheduling of a two-class queue with setups, Operations Research 46(4) (1998) 532-537.
13. C.C. Sherbrooke, Optimal Inventory Modelling of Systems: Multi-Echelon Techniques, (Wiley, New York 1992).
14. A. Sleptchenko, M.C. van der Heijden and A. van Harten, Effects of finite repair capacity in multiechelon, multi-indenture service part supply systems, International Journal of Production Economics, 79 (2002) 109-230.
15. H.C. Tijms, Stochastic Models: An Algorithmic Approach, (John Willey and Sons, Chichester, 1994).
16. A. van Harten and A. Sleptchenko, On multi-class, multi-server queuing and spare part management, Queueing Systems 43(4) (2003) 307-328.
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).
18. D. Wagner, Waiting time of a finite-capacity multi-server model with non-preemptive priorities, European Journal of Operational Research 102 ( 1997) 227-241.
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.
20. D. Wagner, A finite-capacity multi-server multi-queueing model with non-renewal input, Annals of Operations Research 79 (1998) 63-82.
21. K.M. Wein, Dynamic scheduling of a multiclass make-to-stock queue, Operations Research 40(4) (1992) 724-735.