Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-19T03:33:40.183Z Has data issue: false hasContentIssue false

The Busy Period of an M/G/1 Queue with Customer Impatience

Published online by Cambridge University Press:  14 July 2016

Onno Boxma*
Affiliation:
EURANDOM and Eindhoven University of Technology
David Perry*
Affiliation:
University of Haifa
Wolfgang Stadje*
Affiliation:
University of Osnabrück
Shelley Zacks*
Affiliation:
Binghamton University
*
∗ Postal address: Department of Mathematics and Computer Science, Eindhoven University of Technology, HG 9.14, PO Box 513, 5600 MB Eindhoven, The Netherlands. Email address: boxma@win.tue.nl
∗∗ Postal address: Department of Statistics, University of Haifa, Haifa 31909, Israel. Email address: dperry@haifa.ac.il
∗∗∗ Postal address: Department of Mathematics and Computer Science, University of Osnabrück, 49069 Osnabrück, Germany. Email address: wolfgang@mathematik.uni-osnabrueck.de
∗∗∗∗ Postal address: Department of Mathematical Sciences, Binghamton University, Binghamton, NY 13902-6000, USA. Email address: shelly@math.binghamton.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider an M/G/1 queue in which an arriving customer does not enter the system whenever its virtual waiting time, i.e. the amount of work seen upon arrival, is larger than a certain random patience time. We determine the busy period distribution for various choices of the patience time distribution. The main cases under consideration are exponential patience and a discrete patience distribution.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2010