A single server queue in discrete time with customers served in random order
Keyword(s):
This paper aims at showing that for the discrete time analogue of the M/G/l queueing model with service in random order and with a traffic intensity ρ > 0, the condition ρ < ∞ is sufficient in order that every customer joining the queue be served eventually, with probability one (Theorem 2).
Keyword(s):
1975 ◽
Vol 12
(04)
◽
pp. 763-778
◽
Keyword(s):
1973 ◽
Vol 20
(2)
◽
pp. 297-304
◽
Keyword(s):
1973 ◽
Vol 20
(4)
◽
pp. 753-766
◽
1973 ◽
Vol 20
(3)
◽
pp. 557-567
◽
1978 ◽
Vol 15
(03)
◽
pp. 590-601
◽
Keyword(s):
2005 ◽
Vol 33
(5)
◽
pp. 511-518
◽