Waiting times of a finite-capacity multi-server model with non-preemptive priorities

European Journal of Operational Research

Volumn 102, Issue 1, 1997, Pages 227-241

  Wagner, Dietmar ^a,b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b IBM   (Germany)

Author keywords

First passage time; Markov process; Multi server queue; Priority; Queuing

Indexed keywords

LAPLACE TRANSFORMS; MARKOV PROCESSES; MATHEMATICAL MODELS; MATRIX ALGEBRA;

FINITE CAPACITY MULTISERVER MODEL; INDEPENDENT POISSON PROCESSES; LAPLACE STIELTJES TRANSFORM; MULTISERVER QUEUES; NON PREEMPTIVE PRIORITIES; STEADY STATE DISTRIBUTION;

QUEUEING THEORY;

EID: 0031248624     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00229-9     Document Type: Article

References (8)

1. Davis, R.H., "Waiting time distribution of a multi-server priority queueing model", Operations Research 14 (1966) 133-136.
2. Gail, H.R., Hantler, S.L., and Taylor, B.A., "Analysis of a non-preemptive priority multiserver queue", Advances in Applied Probability 20 (1988) 852-879.
3. Gnedenko, B.W., and Koenig, D., Handbuch der Bedienungstheorie I, Akademie, Berlin, 1984.
4. Kapadia, A.S., Kazmi, M.F., and Mitchell A.C., "Analysis of a finite capacity non preemptive priority queue", Computers and Operations Research 11/3 (1984) 337-343.
5. [5 ] Kao, E.P.C., and Narayanan, K.S., "Computing steady-state probabilities of a nonpreemptive priority multiserver queue", ORSA Journal on Computing 2/3 (1990) 211-218.
6. Kella, O., and Yechiali, U., "Waiting times in the non-preemptive priority M/M/c queue", Communications in Statististics - Stochastic Models 1 (1985) 257-262.
7. Kleinrock, L., Queueing Systems, Vol. 2, Computer Applications, John Wiley & Sons, New York, 1976.
8. Wagner, D., "Analysis of a multi-server model with non-preemptive priorities and non-renewal input", in: J. Labetoulle and J.W. Roberts (eds.), The Fundamental Role of Teletraffic in the Evolution of Telecommunications Networks, Elsevier, Amsterdam, 1994.