Please use this identifier to cite or link to this item:
|Title:||From FIFO to LIFO: A functional ordering of service delay via arrival discipline|
|Citation:||Li, J. (1996). From FIFO to LIFO: A functional ordering of service delay via arrival discipline. Journal of Applied Probability 33 (2) : 507-512. ScholarBank@NUS Repository.|
|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.|
|Source Title:||Journal of Applied Probability|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 12, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.