Properties of the gittins index with application to optimal scheduling

  • Authors:

  • Samuli Aalto;Urtzi Ayesta;Rhonda Righter

  • Affiliations:

  • Aalto university, espoo, finland e-mail: samuli.aalto@tkk.fi;Basque center for applied mathematics, derio, spain, and basque foundation for science, derio, spain e-mail: ayesta@bcamath.org;University of california at berkeley, berkeley, ca e-mail: rrighter@ieor.berkeley.edu

  • Venue:
  • Probability in the Engineering and Informational Sciences
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.