PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULING
- 1 April 2011
- journal article
- research article
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 25 (3), 269-288
- https://doi.org/10.1017/s0269964811000015
Abstract
We consider the optimal scheduling problem for a single-server queue without arrivals. We allow preemptions, and our purpose is to minimize the expected flow time. The optimal nonanticipating discipline is known to be the Gittins index policy, which, however, is defined in an implicit way. Until now, its general behavior in this specific problem has been characterized only in a few special cases. In this article, we give as complete a characterization as possible. It turns out that the optimal policy always belongs to the family of multilevel processor sharing disciplines.Keywords
This publication has 6 references indexed in Scilit:
- On the Gittins index in the M/G/1 queueQueueing Systems, 2009
- Beyond processor sharingACM SIGMETRICS Performance Evaluation Review, 2007
- On extremal service disciplines in single-stage queueing systemsJournal of Applied Probability, 1990
- Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful DeparturesProbability in the Engineering and Informational Sciences, 1989
- Processor-sharing queues: Some progress in analysisQueueing Systems, 1987
- Scheduling for Minimum Total Loss Using Service Time DistributionsJournal of the ACM, 1974