Abstract
We introduce a simple approach for the analysis of the M/M/c queues with a single class of customers and constant impatience time by finding simple Markov processes (see (2.1) and (2.15) below), and then by applying this approach we analyze the M/M/1 queues with two classes of customers in which class 1 customers have impatience of constant duration, and class 2 customers have no impatience and lower priority than class 1 customers.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Baccelli, P. Boyer and G. Hebuterne, Single server queues with impatient customers, Adv. Appl. Probab. 16 (1984) 887-905.
F. Baccelli and G. Hebuterne, On queues with impatient customers, in: Performance '81, ed. F.J. Kylstra (North-Holland, Amsterdam, 1981) pp. 159-179.
D.Y. Barrer, Queuing with impatient customers and ordered service, Oper. Res. 5 (1957) 650-656.
A. B randt and M. Brandt, On the M(n)/M(n)/s queues with impatient calls, Performance Evaluation 35 (1999) 1-18.
A. Brandt and M. Brandt, On a two-queue priority system with impatience and its application to a call center, Methods Comput. Appl. Probab. 1 (1999) 191-210.
J.W. Cohen, Single-server queues with restricted accessibility, J. Engrg. Math. 3 (1969) 265-284.
R.B. Cooper, Introduction to Queueing Theory, 2nd ed. (North-Holland, New York, 1981).
D.J. Daley, General customer impatience in the queue GI/G/1, J. Appl. Probab. 2 (1965) 186-205.
P.D. Finch, Deterministic customer impatience in the queueing system GI/M/1, Biometrika 47(1,2) (1960) 45-52.
B.V. Gnedenko and I.N. Kovalenko, Introduction to Queueing Theory (Israel Program for Scientific Translations, Jerusalem, 1968).
O.M. Jurkevic, On the investigation of many-server queueing systems with bounded waiting time, Izv. Akad. Nauk SSSR Techniceskaja Kibernetika 5 (1970) 50-58 (in Russian).
O.M. Jurkevic, On many-server systems with stochastic bounds for the waiting time, Izv. Akad. Nauk SSSR Techniceskaja Kibernetika 4 (1971) 39-46 (in Russian).
A.G. de Kok and H.C. Tijms, A queueing system with impatient customers, J. Appl. Probab. 22 (1985) 688-696.
A.G. de Kok and H.C. Tijms, A two-moment approximation for a buffer design problem requiring a small rejection probability, Performance Evaluation 5 (1985) 77-84.
A. Movaghar, On queueing with customer impatience until the beginning of service, Queueing Systems 29 (1998) 337-350.
R.E. Stanford, Reneging phenomena in single server queues, Math. Oper. Res. 4 (1979) 162-178.
R.E. Stanford, On queues with impatience, Adv. Appl. Probab. 22 (1990) 768-769.
L. Takács, A single-server queue with limited virtual waiting times, J. Appl. Probab. (1974) 612-617.
R.W. Wolff, Poisson arrivals see time averages, Oper. Res. 30(2) (1982) 223-231.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Choi, B.D., Kim, B. & Chung, J. M/M/1 Queue with Impatient Customers of Higher Priority. Queueing Systems 38, 49–66 (2001). https://doi.org/10.1023/A:1010820112080
Issue Date:
DOI: https://doi.org/10.1023/A:1010820112080