Show simple item record

dc.contributor.authorAalto, S.
dc.contributor.authorAyesta, U.
dc.contributor.authorRighter, R.
dc.date.accessioned2017-02-21T08:11:14Z
dc.date.available2017-02-21T08:11:14Z
dc.date.issued2011-12-31
dc.identifier.issn0269-9648
dc.identifier.urihttp://hdl.handle.net/20.500.11824/377
dc.description.abstractWe 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.
dc.formatapplication/pdf
dc.language.isoengen_US
dc.rightsReconocimiento-NoComercial-CompartirIgual 3.0 Españaen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/es/en_US
dc.titleProperties of the gittins index with application to optimal scheduling
dc.typeinfo:eu-repo/semantics/articleen_US
dc.identifier.doi10.1017/S0269964811000015
dc.relation.publisherversionhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-79960220509&doi=10.1017%2fS0269964811000015&partnerID=40&md5=1aeb69c6a33c9b5970115e2c7d6c469f
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessen_US
dc.type.hasVersioninfo:eu-repo/semantics/publishedVersionen_US
dc.journal.titleProbability in the Engineering and Informational Sciencesen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Reconocimiento-NoComercial-CompartirIgual 3.0 España
Except where otherwise noted, this item's license is described as Reconocimiento-NoComercial-CompartirIgual 3.0 España