Article contents
From FIFO to LIFO: a functional ordering of service delay via arrival discipline
Published online by Cambridge University Press: 14 July 2016
Abstract
Vasicek (1977) proved that among all queueing disciplines that do not change the departure process of the queue, FIFO and LIFO yield, respectively, the smallest and the largest expectation of any given convex function of the service delay. In this note we further show that, if arriving customers join the queue stochastically ‘closer' to the server(s), then the expected value of any convex function of service delay is larger. As a more interesting result, we also show that if the function under consideration is concave, then the conclusion will be exactly the opposite. This result indicates that LIFO will be the best discipline if the delay cost is an increasing function but at a diminishing rate.
- Type
- Research Papers
- Information
- Copyright
- Copyright © Applied Probability Trust 1996
References
- 1
- Cited by