Discounted Multiarmed Bandit Problems on a Collection of Machines with Varying Speeds

References

• Bertsimas D., Niño-Mora J. Conservation laws, extended polymatroids and multi-armed bandit problems: A polyhedral approach to indexable systems. Math. Oper. Res. (1996) 21:257–306Link, Google Scholar
• Blackwell D. Discrete dynamic programming. Ann. Math. Statist. (1962) 33:719–726Crossref, Google Scholar
• Dacre M., Glazebrook K. D., Niño-Mora J. The achievable region approach to the optimal control of stochastic systems (with discussion). J. Roy. Statist. Soc. (1999) B61:747–791Crossref, Google Scholar
• Denardo E. V., Miller B. L. An optimality criterion for discrete dynamic programming with no discounting. Ann. Math. Statist. (1968) 39:1220–1227Crossref, Google Scholar
• Gittins J. C., Jones D. M., Gani J., Sarkadi K., Vince I. A dynamic allocation index for the sequential design of experiments. Progress in Statistics: European Meeting of Statisticians, Budapest, 1972 (1974) (North-Holland, Amsterdam, The Netherlands) 241–266Google Scholar
• Glazebrook K. D., Niño-Mora J. Parallel scheduling of multiclass M/M/m queues: Approximate and heavy-traffic optimization of achievable performance. Oper. Res. (2001) 49:609–623Link, Google Scholar
• Glazebrook K. D., Wilkinson D. J. Index-based policies for discounted multi-armed bandits on parallel machines. Ann. Appl. Probab. (2000) 10:877–896Crossref, Google Scholar
• Katehakis M. N., Veinott A. F. The multi-armed bandit problem: Decomposition and computation. Math. Oper. Res. (1987) 12:262–268Link, Google Scholar
• Puterman M.Markov Decision Processes: Discrete Stochastic Dynamic Programming (1994) (Wiley, New York) Crossref, Google Scholar
• Veinott A. F. On finding optimal policies in discrete dynamic programming with no discounting. Ann. Math. Statist. (1966) 37:1284–1294Crossref, Google Scholar
• Weber R. R. Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan or flowtime. J. Appl. Probab. (1982) 19:167–182Crossref, Google Scholar
• Weber R. R., Varaiya P., Walrand J. Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime. J. Appl. Probab. (1986) 23:841–847Crossref, Google Scholar
• Weiss G., Dempster M. A. H., Lenstra J. K., Rinnooy Kan A. H. G. Multiserver stochastic scheduling. Deterministic and Stochastic Scheduling (1982) (D. Reidel, Dordrecht, Germany) 157–179Crossref, Google Scholar
• Weiss G. Approximation results in parallel machines stochastic scheduling. Ann. Oper. Res. (Special Volume on Production Planning and Scheduling) (1990) 26:195–242Crossref, Google Scholar
• Weiss G. Turnpike optimality of Smith's rule in parallel machines stochastic scheduling. Math. Oper. Res. (1992) 17:255–270Link, Google Scholar
• Weiss G., Chrétienne P., Coffman E. G., Lenstra J. K., Liu Z. A tutorial in stochastic scheduling. Scheduling Theory and Its Applications (1995) (Wiley, New York) 33–64Google Scholar