Single-server queues with impatient customers
- 1 December 1984
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 16 (4) , 887-905
- https://doi.org/10.2307/1427345
Abstract
We consider a single-server queueing system in which a customer gives up whenever his waiting time is larger than a random threshold, his patience time. In the case of aGI/GI/1 queue with i.i.d. patience times, we establish the extensions of the classicalGI/GI/1 formulae concerning the stability condition and the relation between actual and virtual waiting-time distribution functions. We also prove that these last two distribution functions coincide in the case of a Poisson input process and determine their common law.Keywords
This publication has 16 references indexed in Scilit:
- Relations de conservation pour une file d’attente avec des clients impatientsAnnals of Telecommunications, 1983
- Note—A Single Server Queue with Constant Service Time and Restricted AccessibilityManagement Science, 1979
- Techniques for establishing ergodic and recurrence properties of continuous‐valued markov chainsNaval Research Logistics Quarterly, 1978
- The Markovian Queue with Bounded Waiting timeManagement Science, 1977
- Criteria for classifying general Markov chainsAdvances in Applied Probability, 1976
- Stochastic Processes in Queueing TheoryPublished by Springer Nature ,1976
- On Regenerative Processes in Queueing TheoryPublished by Springer Nature ,1976
- A single-server queue with limited virtual waiting timeJournal of Applied Probability, 1974
- Single-server queueing systems with uniformly limited queueing timeJournal of the Australian Mathematical Society, 1964
- SINGULAR INTEGRAL EQUATIONSPublished by Elsevier ,1957