×

The stationary workload of the \(G/M/1\) queue with impatient customers. (English) Zbl 1189.60165

This papers deals with a \(G/M/1\) queue with impatient customers; customers arrival is governed by a renewal process, and the customers’ patience time is constant. In this condition, the stationary distribution of the server workload, or the virtual waiting time, is derived using the level crossing argument. A study case with a \(M/M/1\) queue is also considered.

MSC:

60K25 Queueing theory (aspects of probability theory)
90B22 Queues and service in operations research
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Adan, I., Boxma, O., Perry, D.: The G/M/1 queue revisited. Math. Methods Oper. Res. 62, 437–452 (2005) · Zbl 1085.60064 · doi:10.1007/s00186-005-0032-6
[2] Asmussen, S.: Applied Probability and Queues. Wiley, New York (1987) · Zbl 0624.60098
[3] Baccelli, F., Boyer, P., Hebuterne, G.: Single-server queues with impatient customers. Adv. Appl. Probab. 16, 887–905 (1984) · Zbl 0549.60091 · doi:10.2307/1427345
[4] Bae, J., Kim, S., Lee, E.Y.: The virtual waiting time of the M/G/1 queue with impatient customers. Queueing Syst. 38, 485–494 (2001) · Zbl 0982.60097 · doi:10.1023/A:1010956213680
[5] Bae, J., Kim, S., Lee, E.Y.: A \(P^{M}_{\lambda}\) policy for an M/G/1 queueing system. Appl. Math. Model. 26, 929–939 (2002) · Zbl 1175.90104 · doi:10.1016/S0307-904X(02)00045-8
[6] Barrer, D.Y.: Queuing with impatient customers and ordered service. Oper. Res. 5, 650–656 (1957) · doi:10.1287/opre.5.5.650
[7] Brandt, A., Brandt, M.: On the M(n)/M(n)/s queue with impatient calls. Perform. Eval. 35, 1–18 (1999) · doi:10.1016/S0166-5316(98)00042-X
[8] Brandt, A., Brandt, M.: On the two-class M/M/1 system under preemptive resume and impatience of the prioritized customers. Queueing Syst. 47, 147–168 (2004) · Zbl 1057.60083 · doi:10.1023/B:QUES.0000032805.73991.8e
[9] Brill, P.H.: Level Crossings Methods in Stochastic Models. Springer, Berlin (2008) · Zbl 1157.60003
[10] Brill, P.H., Posner, M.J.M.: Level crossings in point processes applied to queues: single-server case. Oper. Res. 25, 662–674 (1977) · Zbl 0373.60114 · doi:10.1287/opre.25.4.662
[11] Choi, B.D., Kim, B., Chung, J.: M/M/1 queue with impatient customers of higher priority. Queueing Syst. 38, 49–66 (2001) · Zbl 1017.90017 · doi:10.1023/A:1010820112080
[12] Choi, B.D., Kim, B., Zhu, D.: MAP/M/c queue with constant impatience time. Math. Oper. Res. 29, 309–325 (2004) · Zbl 1082.60081 · doi:10.1287/moor.1030.0081
[13] Cohen, J.W.: Extreme value distribution for the M/G/1 and the G/M/1 queueing systems. Ann. l’Inst. Henri Poincaré, Sect. B, Calc. Probab. Stat. 4, 83–98 (1968) · Zbl 0162.49302
[14] Cohen, J.W.: On up- and downcrossings. J. Appl. Probab. 14, 405–410 (1977) · Zbl 0365.60108 · doi:10.2307/3213014
[15] Cohen, J.W.: Properties of the process of level crossings during a busy cycle of the M/G/1 queueing system. Math. Oper. Res. 3, 133–144 (1978) · Zbl 0383.60089 · doi:10.1287/moor.3.2.133
[16] Cohen, J.W.: The Single Server Queue, 2nd edn. North-Holland, Amsterdam (1982) · Zbl 0481.60003
[17] Daley, D.J.: General customer impatience in the queue GI/G/1. J. Appl. Probab. 2, 186–205 (1965) · Zbl 0134.14402 · doi:10.2307/3211884
[18] De Kok, A.G., Tijms, H.C.: A queueing system with impatient customers. J. Appl. Probab. 22, 688–696 (1985) · Zbl 0573.60086 · doi:10.2307/3213871
[19] Finch, P.D.: Deterministic customer impatience in the queueing system GI/M/1. Biometrika 47, 45–52 (1960) · Zbl 0099.12606
[20] Kim, S., Bae, J., Lee, E.Y.: Busy periods of Poisson arrival queues with loss. Queueing Syst. 39, 201–212 (2001) · Zbl 0988.60089 · doi:10.1023/A:1012700718302
[21] Lillo, R.E., Martin, M.: Stability in queues with impatient customers. Stoch. Models 17, 375–389 (2001) · Zbl 0989.60093 · doi:10.1081/STM-100002279
[22] Martin, M., Artalejo, J.R.: Analysis of an M/G/1 queue with two types of impatient units. Adv. Appl. Probab. 27, 840–861 (1995) · Zbl 0829.60085 · doi:10.2307/1428136
[23] Movaghar, A.: On queueing with customer impatience until the beginning of service. Queueing Syst. 29, 337–350 (1998) · Zbl 0917.90133 · doi:10.1023/A:1019196416987
[24] Perry, D., Asmussen, S.: Rejection rules in the M/G/1 queue. Queueing Syst. 19, 105–130 (1995) · Zbl 0835.60080 · doi:10.1007/BF01148942
[25] Perry, D., Stadje, W., Zacks, S.: Busy period analysis for M/G/1 and G/M/1 type queues with restricted accessibility. Oper. Res. Lett. 27, 163–174 (2000) · Zbl 1096.90517 · doi:10.1016/S0167-6377(00)00043-2
[26] Swensen, A.R.: On a GI/M/c queue with bounded waiting times. Oper. Res. 34, 895–908 (1986) · Zbl 0654.60090 · doi:10.1287/opre.34.6.895
[27] Teghem, J., Jr.: Use of discrete transforms for the study of a GI/M/S queue with impatient customer phenomena. Math. Methods Oper. Res. 23, 95–106 (1979) · Zbl 0401.90040
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.