Article contents
A single server queue in discrete time with customers served in random order
Published online by Cambridge University Press: 14 July 2016
Abstract
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).
- Type
- Short Communications
- Information
- Copyright
- Copyright © Applied Probability Trust 1972
References
- 2
- Cited by