Skip to main content
Erschienen in: Queueing Systems 2-4/2013

01.11.2013

Workload and busy period for \(M/GI/1\) with a general impatience mechanism

verfasst von: Andreas Brandt, Manfred Brandt

Erschienen in: Queueing Systems | Ausgabe 2-4/2013

Einloggen

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

search-config
loading …

Abstract

The paper deals with the workload and busy period for the \(M/GI/1\) system with impatience under FCFS discipline. The customers may become impatient during their waiting for service with generally distributed maximal waiting times and also during their service with generally distributed maximal service times depending on the time waited for service. This general impatience mechanism was originally introduced by Kovalenko (1961) and considered by Daley (1965), too. It covers the special cases of impatience on waiting times as well as impatience on sojourn times, for which Boxma et al. (2010, 2011) gave new results and outlined special cases recently. Our unified approach bases on the vector process of workload and busy time. Explicit representations for the LSTs of workload and busy period are given in case of phase-type distributed impatience.

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!

Literatur
1.
Zurück zum Zitat Asmussen, S.: Applied Probability and Queues. Wiley, Chichester (1987) Asmussen, S.: Applied Probability and Queues. Wiley, Chichester (1987)
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 Bekker, R., Koole, G.M., Nielsen, B.F., Nielsen, T.B.: Queues with waiting time dependent service. Queueing Syst. 68, 61–78 (2011)CrossRef Bekker, R., Koole, G.M., Nielsen, B.F., Nielsen, T.B.: Queues with waiting time dependent service. Queueing Syst. 68, 61–78 (2011)CrossRef
4.
Zurück zum Zitat Boxma, O.J., Perry, D., Stadje, W., Zacks, S.: The busy period of an \(M/G/1\) queue with customer impatience. J. Appl. Probab. 47, 130–145 (2010)CrossRef Boxma, O.J., Perry, D., Stadje, W., Zacks, S.: The busy period of an \(M/G/1\) queue with customer impatience. J. Appl. Probab. 47, 130–145 (2010)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 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
7.
Zurück zum Zitat Kim, S., Bae, J., Lee, E.Y.: Busy periods of Poisson arrival queues with loss. Queueing Syst. 39, 201–212 (2001)CrossRef Kim, S., Bae, J., Lee, E.Y.: Busy periods of Poisson arrival queues with loss. Queueing Syst. 39, 201–212 (2001)CrossRef
8.
Zurück zum Zitat Kovalenko, I.N.: Some queuing problems with restrictions. Theory Probab. Appl. 6, 204–208 (1961)CrossRef Kovalenko, I.N.: Some queuing problems with restrictions. Theory Probab. Appl. 6, 204–208 (1961)CrossRef
9.
Zurück zum Zitat O’Cinneide, C.A.: Characterization of phase-type distributions. Commun. Stat. Stoch. Models 6, 1–57 (1990)CrossRef O’Cinneide, C.A.: Characterization of phase-type distributions. Commun. Stat. Stoch. Models 6, 1–57 (1990)CrossRef
10.
Zurück zum Zitat 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)CrossRef 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)CrossRef
11.
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
12.
Zurück zum Zitat Stanford, R.E.: On queues with impatience. Adv. Appl. Probab. 22, 768–769 (1990)CrossRef Stanford, R.E.: On queues with impatience. Adv. Appl. Probab. 22, 768–769 (1990)CrossRef
13.
Zurück zum Zitat Subba Rao, S.: Queuing with balking and reneging in \(M/G/1\) systems. Metrika 12, 173–188 (1968)CrossRef Subba Rao, S.: Queuing with balking and reneging in \(M/G/1\) systems. Metrika 12, 173–188 (1968)CrossRef
14.
Zurück zum Zitat Xiong, W., Jagerman, D., Altiok, T.: \(M/G/1\) queue with deterministic reneging times. Perform. Eval. 65, 308–316 (2008)CrossRef Xiong, W., Jagerman, D., Altiok, T.: \(M/G/1\) queue with deterministic reneging times. Perform. Eval. 65, 308–316 (2008)CrossRef
Metadaten
Titel
Workload and busy period for with a general impatience mechanism
verfasst von
Andreas Brandt
Manfred Brandt
Publikationsdatum
01.11.2013
Verlag
Springer US
Erschienen in
Queueing Systems / Ausgabe 2-4/2013
Print ISSN: 0257-0130
Elektronische ISSN: 1572-9443
DOI
https://doi.org/10.1007/s11134-013-9373-7

Weitere Artikel der Ausgabe 2-4/2013

Queueing Systems 2-4/2013 Zur Ausgabe