Rollout Algorithms for Stochastic Scheduling Problems
Stochastic scheduling problems are difficult stochastic control problems with combinatorial decision spaces. In this paper we focus on a class of stochastic scheduling problems, the quiz problem and its variations. We discuss the use of heuristics for their solution, and we propose rollout algorithms based on these heuristics which approximate the stochastic dynamic programming algorithm. We show how the rollout algorithms can be implemented efficiently, with considerable savings in computation over optimal algorithms. We delineate circumstances under which the rollout algorithms are guaranteed to perform better than the heuristics on which they are based. We also show computational results which suggest that the performance of the rollout policies is near-optimal, and is substantially better than the performance of their underlying heuristics.
- Barto, A. G., S. J. Bradtke, and S. P. Singh. (1995). “Learning to Act Using Real-Time Dynamic Programming,” Artificial Intelligence 72, 81–138.
- Bertsekas, D. P., J. N. Tsitsiklis, and C. Wu. (1997). “Rollout Algorithms for Combinatorial Optimization,” Heuristics 3, 245–262.
- Bertsekas, D. P., and J. N. Tsitsiklis. (1996). Neuro-Dynamic Programming. Belmont, MA: Athena Scientific.
- Ross, S. M. (1983). Introduction to Stochastic Dynamic Programming. N.Y.: Academic Press.
- Sutton, R., and A. G. Barto. (1998). Reinforcement Learning. Cambridge, MA: MIT Press.
- Tesauro, G., and G. R. Galperin. (1996). “On-Line Policy Improvement Using Monte Carlo Search,” presented at the 1996 Neural Information Processing Systems Conference, Denver, CO.
- Whittle, P. (1982). Optimization over Time, vol. I. N.Y.: Wiley.
- Rollout Algorithms for Stochastic Scheduling Problems
Journal of Heuristics
Volume 5, Issue 1 , pp 89-108
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- rollout algorithms
- neuro-dynamic programming