Article ID: | iaor20032470 |
Country: | Germany |
Volume: | 93 |
Issue: | 3 |
Start Page Number: | 361 |
End Page Number: | 413 |
Publication Date: | Jan 2002 |
Journal: | Mathematical Programming |
Authors: | Nio-Mora J. |
Keywords: | production, programming: dynamic, control processes |
This paper develops a polyhedral approach to the design, analysis, and computation of dynamic allocation indices for scheduling binary-action (engage/rest) Markovian stochastic projects which can change state when rested (restless bandits (RBs)), based on partial conservation laws (PCLs). This extends previous work by the author, where PCLs were shown to imply the optimality of index policies with a postulated structure in stochastic scheduling problems, under admissible linear objectives, and they were deployed to obtain simple sufficient conditions for the existence of Whittle's RB index (indexability), along with an adaptive-greedy index algorithm. The new contributions include: (i) we develop the polyhedral foundation of the PCL framework, based on the structural and algorithmic properties of a new polytope associated with an accessible set system (