The queue with impatience: construction of the stationary workload under FIFO
2010 ◽
Vol 47
(2)
◽
pp. 498-512
◽
Keyword(s):
In this paper we study the stability of queueing systems with impatient customers and a single server operating under a FIFO (first-in-first-out) discipline. We first give a sufficient condition for the existence of a stationary workload in the case of impatience until the beginning of service. We then provide a weaker condition of existence on an enriched probability space using the theory of Anantharam et al. (1997), (1999). The case of impatience until the end of service is also investigated.
2010 ◽
Vol 47
(02)
◽
pp. 498-512
◽
2005 ◽
Vol 42
(04)
◽
pp. 1145-1167
◽
1997 ◽
Vol 11
(4)
◽
pp. 441-450
◽
2005 ◽
Vol 42
(4)
◽
pp. 1145-1167
◽
2017 ◽
Vol 2017
◽
pp. 1-10
◽
Keyword(s):
2014 ◽
Vol 31
(02)
◽
pp. 1440002
◽
1992 ◽
Vol 17
(7)
◽
pp. 1051-1110
◽
Keyword(s):