Journal
ADVANCES IN APPLIED PROBABILITY
Volume 38, Issue 3, Pages 643-672Publisher
APPLIED PROBABILITY TRUST
DOI: 10.1239/aap/1158684996
Keywords
bandit problem; dynamic programming; Gittins index; machine maintenance; restless bandit; stochastic scheduling; switching cost
Categories
Funding
- Engineering and Physical Sciences Research Council [GR/S45188/02, GR/S45188/01] Funding Source: researchfish
Ask authors/readers for more resources
In 1988 Whittle introduced an important but intractable class of restless bandit problems which generalise the multiarmed bandit problems of Gittins by allowing state evolution for passive projects. Whittle's account deployed a Lagrangian relaxation of the optimisation problem to develop an index heuristic. Despite a developing body of evidence (both theoretical and empirical) which underscores the strong performance of Whittle's index policy, a continuing challenge to implementation is the need to establish that the competing projects all pass an indexability test. In this paper we employ Gittins' index theory to establish the indexability of (inter alia) general families of restless bandits which arise in problems of machine maintenance and stochastic scheduling problems with switching penalties. We also give formulae for the resulting Whittle indices. Numerical investigations testify to the outstandingly strong performance of the index heuristics concerned.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available