Skip to main content
Erschienen in: Queueing Systems 3-4/2018

14.12.2017

Analysis of \(\hbox {M}^{\mathrm {x}}/\hbox {G}/1\) queues with impatient customers

verfasst von: Yoshiaki Inoue, Onno Boxma, David Perry, Shelley Zacks

Erschienen in: Queueing Systems | Ausgabe 3-4/2018

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This paper considers a batch arrival \(\hbox {M}^{\mathrm {x}}/\hbox {G}/1\) queue with impatient customers. We consider two different model variants. In the first variant, customers in the same batch are assumed to have the same patience time, and patience times associated with batches are i.i.d. according to a general distribution. In the second variant, patience times of customers in the same batch are independent, and they follow a general distribution. Both variants are related to an M/G/1 queue in which the service time of a customer depends on its waiting time. Our main focus is on the virtual and actual waiting times, and on the loss probability of customers.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
1.
Zurück zum Zitat Baccelli, F., Hebuterne, G.: On queues with impatient customers. In: Kylstra, F.J. (ed.) Proceedings of Performance ’81, pp. 159–179. North-Holland Publishing Company (1981) Baccelli, F., Hebuterne, G.: On queues with impatient customers. In: Kylstra, F.J. (ed.) Proceedings of Performance ’81, pp. 159–179. North-Holland Publishing Company (1981)
2.
Zurück zum Zitat Baccelli, F., Boyer, P., Hebuterne, G.: Single-server queues with impatient customers. Adv. Appl. Probab. 16, 887–905 (1984)CrossRef Baccelli, F., Boyer, P., Hebuterne, G.: Single-server queues with impatient customers. Adv. Appl. Probab. 16, 887–905 (1984)CrossRef
3.
Zurück zum Zitat 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)CrossRef 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)CrossRef
4.
Zurück zum Zitat Barrer, D.Y.: Queuing with impatient customers and ordered service. Oper. Res. 5, 650–656 (1957)CrossRef Barrer, D.Y.: Queuing with impatient customers and ordered service. Oper. Res. 5, 650–656 (1957)CrossRef
5.
Zurück zum Zitat Boxma, O.J., Perry, D., Stadje, W.: The M/G/1+G queue revisited. Queueing Syst. 67, 207–220 (2011)CrossRef Boxma, O.J., Perry, D., Stadje, W.: The M/G/1+G queue revisited. Queueing Syst. 67, 207–220 (2011)CrossRef
6.
Zurück zum Zitat Boxma, O.J., de Waal, P.R.: Multiserver queues with impatient customers. In: Labetoulle, J., Roberts, J.W. (eds.) Proceedings ITC 14, pp. 743–756. North-Holland Publishing Company (1994) Boxma, O.J., de Waal, P.R.: Multiserver queues with impatient customers. In: Labetoulle, J., Roberts, J.W. (eds.) Proceedings ITC 14, pp. 743–756. North-Holland Publishing Company (1994)
7.
Zurück zum Zitat Brandt, A., Brandt, M.: On the \(M(n)/M(n)/s\) queue with impatient calls. Perform. Eval. 35, 1–18 (1999)CrossRef Brandt, A., Brandt, M.: On the \(M(n)/M(n)/s\) queue with impatient calls. Perform. Eval. 35, 1–18 (1999)CrossRef
8.
Zurück zum Zitat Brandt, A., Brandt, M.: Workload and busy period for M/G/1 with a general impatience mechanism. Queueing Syst. 75, 189–209 (2013)CrossRef Brandt, A., Brandt, M.: Workload and busy period for M/G/1 with a general impatience mechanism. Queueing Syst. 75, 189–209 (2013)CrossRef
9.
Zurück zum Zitat Brill, P.H., Posner, M.J.M.: Level crossings in point processes applied to queues: single-server case. Oper. Res. 25, 662–674 (1977)CrossRef Brill, P.H., Posner, M.J.M.: Level crossings in point processes applied to queues: single-server case. Oper. Res. 25, 662–674 (1977)CrossRef
10.
Zurück zum Zitat Boots, N.K., Tijms, H.: A multiserver queueing system with impatient customers. Manag. Sci. 45, 444–448 (1999)CrossRef Boots, N.K., Tijms, H.: A multiserver queueing system with impatient customers. Manag. Sci. 45, 444–448 (1999)CrossRef
11.
Zurück zum Zitat Callahan, J.R.: The nothing hot delay problem in the production of steel. Ph.D. Thesis, Department of Industrial Engineering, University of Toronto (1971) Callahan, J.R.: The nothing hot delay problem in the production of steel. Ph.D. Thesis, Department of Industrial Engineering, University of Toronto (1971)
12.
Zurück zum Zitat Cohen, J.W.: Single server queues with restricted accessibility. J. Eng. Math. 3, 265–284 (1969)CrossRef Cohen, J.W.: Single server queues with restricted accessibility. J. Eng. Math. 3, 265–284 (1969)CrossRef
13.
Zurück zum Zitat Cohen, J.W.: On up- and downcrossings. J. Appl. Probab. 14, 405–410 (1977)CrossRef Cohen, J.W.: On up- and downcrossings. J. Appl. Probab. 14, 405–410 (1977)CrossRef
14.
Zurück zum Zitat Daley, D.J.: General customer impatience in the queue GI/G/1. J. Appl. Probab. 2, 186–205 (1965)CrossRef Daley, D.J.: General customer impatience in the queue GI/G/1. J. Appl. Probab. 2, 186–205 (1965)CrossRef
15.
Zurück zum Zitat Hasenbein, J., Perry, D. (eds.): Special issue on Queueing systems with abandonment. Queueing Syst. 75, 111–384 (2013) Hasenbein, J., Perry, D. (eds.): Special issue on Queueing systems with abandonment. Queueing Syst. 75, 111–384 (2013)
16.
Zurück zum Zitat Inoue, Y., Boxma, O., Perry, D., Zacks, S.: Analysis of \(\text{M}^{{\rm x}}\)/G/1 queues with impatient customers. Eurandom Report 2017-008 (2017) Inoue, Y., Boxma, O., Perry, D., Zacks, S.: Analysis of \(\text{M}^{{\rm x}}\)/G/1 queues with impatient customers. Eurandom Report 2017-008 (2017)
17.
Zurück zum Zitat Inoue, Y., Takine, T.: Analysis of the loss probability in the M/G/1+G queue. Queueing Syst. 80, 363–386 (2015)CrossRef Inoue, Y., Takine, T.: Analysis of the loss probability in the M/G/1+G queue. Queueing Syst. 80, 363–386 (2015)CrossRef
18.
Zurück zum Zitat Inoue, Y., Takine, T.: A computational algorithm for the loss probability in the M/G/1+PH queue. Stoch. Models 33, 116–148 (2017)CrossRef Inoue, Y., Takine, T.: A computational algorithm for the loss probability in the M/G/1+PH queue. Stoch. Models 33, 116–148 (2017)CrossRef
19.
Zurück zum Zitat Inoue, Y., Takine, T.: The M/D/1+D queue has the minimum loss probability among M/G/1+G queues. Oper. Res. Lett. 43, 629–632 (2015)CrossRef Inoue, Y., Takine, T.: The M/D/1+D queue has the minimum loss probability among M/G/1+G queues. Oper. Res. Lett. 43, 629–632 (2015)CrossRef
20.
Zurück zum Zitat Iravani, F., Balcioglu, B.: Approximations for the M/GI/\(N\)+G type call center. Queueing Syst. 58, 137–153 (2008)CrossRef Iravani, F., Balcioglu, B.: Approximations for the M/GI/\(N\)+G type call center. Queueing Syst. 58, 137–153 (2008)CrossRef
21.
Zurück zum Zitat Kim, B., Kim, J.: A batch arrival \(\text{ M }^{\rm X}\)/M/\(c\) queue with impatient customers. Oper. Res. Lett. 42, 180–185 (2014)CrossRef Kim, B., Kim, J.: A batch arrival \(\text{ M }^{\rm X}\)/M/\(c\) queue with impatient customers. Oper. Res. Lett. 42, 180–185 (2014)CrossRef
22.
Zurück zum Zitat Meyn, S.P., Tweedie, R.L.: Stability of Markovian processes III: Foster–Lyapunov criteria for continuous-time processes. Adv. Appl. Probab. 25, 518–548 (1993)CrossRef Meyn, S.P., Tweedie, R.L.: Stability of Markovian processes III: Foster–Lyapunov criteria for continuous-time processes. Adv. Appl. Probab. 25, 518–548 (1993)CrossRef
23.
Zurück zum Zitat Posner, M.: Single-server queues with service time dependent on waiting time. Oper. Res. 21, 610–616 (1973)CrossRef Posner, M.: Single-server queues with service time dependent on waiting time. Oper. Res. 21, 610–616 (1973)CrossRef
24.
Zurück zum Zitat Rao, S.S.: Queueing with balking and reneging in M/G/1 systems. Metrika 12, 173–188 (1967)CrossRef Rao, S.S.: Queueing with balking and reneging in M/G/1 systems. Metrika 12, 173–188 (1967)CrossRef
25.
Zurück zum Zitat Ross, S.M.: Introduction to Probability Models, 7th edn. Academic Press, San Diego (2000) Ross, S.M.: Introduction to Probability Models, 7th edn. Academic Press, San Diego (2000)
26.
Zurück zum Zitat Shaked, M., Shanthikumar, J.G.: Stochastic Orders. Springer, New York (2007)CrossRef Shaked, M., Shanthikumar, J.G.: Stochastic Orders. Springer, New York (2007)CrossRef
27.
Zurück zum Zitat Stadje, W., Zacks, S.: Upper first-exit times of compound Poisson processes revisited. Probab. Eng. Inf. Sci. 17, 459–465 (2003)CrossRef Stadje, W., Zacks, S.: Upper first-exit times of compound Poisson processes revisited. Probab. Eng. Inf. Sci. 17, 459–465 (2003)CrossRef
28.
Zurück zum Zitat Stanford, R.E.: Reneging phenomena in single channel queues. Math. Oper. Res. 4, 162–178 (1979)CrossRef Stanford, R.E.: Reneging phenomena in single channel queues. Math. Oper. Res. 4, 162–178 (1979)CrossRef
29.
Zurück zum Zitat van Velthoven, J., van Houdt, B., Blondia, C.: On the probability of abandonment in queues with limited sojourn and waiting times. Oper. Res. Lett. 34, 333–338 (2006)CrossRef van Velthoven, J., van Houdt, B., Blondia, C.: On the probability of abandonment in queues with limited sojourn and waiting times. Oper. Res. Lett. 34, 333–338 (2006)CrossRef
30.
Zurück zum Zitat Weerasinghe, A., Mandelbaum, A.: Abandonment versus blocking in many-server queues: asymptotic optimality in the QED regime. Queueing Syst. 75, 279–337 (2013)CrossRef Weerasinghe, A., Mandelbaum, A.: Abandonment versus blocking in many-server queues: asymptotic optimality in the QED regime. Queueing Syst. 75, 279–337 (2013)CrossRef
31.
Zurück zum Zitat Zeltyn, S., Mandelbaum, A.: Call centers with impatient customers: many-server asymptotics of the M/M/\(n\)+G queue. Queueing Syst. 51, 361–402 (2005)CrossRef Zeltyn, S., Mandelbaum, A.: Call centers with impatient customers: many-server asymptotics of the M/M/\(n\)+G queue. Queueing Syst. 51, 361–402 (2005)CrossRef
Metadaten
Titel
Analysis of queues with impatient customers
verfasst von
Yoshiaki Inoue
Onno Boxma
David Perry
Shelley Zacks
Publikationsdatum
14.12.2017
Verlag
Springer US
Erschienen in
Queueing Systems / Ausgabe 3-4/2018
Print ISSN: 0257-0130
Elektronische ISSN: 1572-9443
DOI
https://doi.org/10.1007/s11134-017-9565-7

Weitere Artikel der Ausgabe 3-4/2018

Queueing Systems 3-4/2018 Zur Ausgabe