An extremal property of FIFO discipline in G/IFR/1 queues
- 1 June 1989
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 21 (2) , 481-484
- https://doi.org/10.2307/1427174
Abstract
In a recent paper by Shanthikumar and Sumita (1987), it is conjectured that the ergodic sojourn time of a customer in G/IFR/1 queues is minimized by FIFO (first in, first out) discipline in the sense of increasing and convex ordering. This paper shows that their conjecture is true. In fact, FIFO discipline minimizes for any non-decreasing and convex function f, where N is the (constant) number of arrivals, θ (k) is the customer identity of the kth departing customer, and an and τ n denote the arriving and departing times of the nth customer, respectively.Keywords
This publication has 3 references indexed in Scilit:
- Further results for dynamic scheduling of multiclassG/G/1 queuesJournal of Applied Probability, 1989
- Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplinesJournal of Applied Probability, 1987
- Queues with Dynamic Priority DisciplineManagement Science, 1961