Single-Server Queues with Impatient Customers

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 a GI/GI/1 queue with i.i.d. patience times, we establish the extensions of the classical GI/GI/1 formulae concerning the stability c...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Advances in Applied Probability. - Applied Probability Trust. - 16(1984), 4, Seite 887-905
1. Verfasser:	Baccelli, F. (VerfasserIn)
Weitere Verfasser:	Boyer, P., Hebuterne, G.
Format:	Online-Aufsatz
Sprache:	English
Veröffentlicht:	1984
Zugriff auf das übergeordnete Werk:	Advances in Applied Probability
Schlagworte:	Queueing theory Limited waiting times Ergodic Markov chain Actual waiting times Virtual waiting times Regenerative processes Invariant measure Functional equation Mathematics Applied sciences mehr... Philosophy Business