Index-based policies for discounted multi-armed bandits on parallel machines

Annals of Applied Probability

Volumn 10, Issue 3, 2000, Pages 877-896

  Glazebrook, K D ^a   Wilkinson, D J ^a  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

Average overtaking optimal; Average reward optimal; Gittins index; Multi armed bandit problem; Parallel machines; Suboptimality bound

Indexed keywords

EID: 0034346711     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1019487512     Document Type: Article

References (14)

1. BERTSIMAS, D. and NIÑO-MORA J. (1996). Conservation laws, extended polymatroids and multiarmed bandit problems; a polyhedral approach to indexable systems. Math. Oper. Res. 21 257-306.
2. BLACKWELL D. (1962). Discrete dynamic programming. Ann. Math. Stat. 33 719-726.
3. COFFMAN, E. and MITRANI, I. (1980). A characterization of waiting time performance realizable by single server queues. Oper. Res. 28 810-821.
4. DENARDO, E. V. and MILLER, B. L. (1968). An optimality criterion for discrete dynamic programming with no discounting, Ann. Math. Stat. 39 1220-1227.
5. GITTINS, J. C. and JONES, D. M. (1974). A dynamic allocation index for the sequential design of experiments. In Progress in Statistics: European Meeting of Statisticians, Budapest, 1972 (J. Gani, K. Sarkadi and I. Vince, eds.) 241-266. North-Holland, Amsterdam.
6. GLAZEBROOK, K. D. (1976) Stochastic scheduling. Ph.D. thesis, Cambridge Univ.
7. GLAZEBROOK, K. D. and GARBE, R. (1999). Almost optimal policies for stochastic systems which almost satisfy conservation laws. Ann. Oper. Res. 92 19-43.
8. SHANTHIKUMAR, J. G. and YAO, D. D. (1992). Multi-class queueing systems: polymatroidal structure and optimal scheduling control. Oper. Res. 40 293-299.
9. VEINOTT, JR, A. F. (1966). On finding optimal policies in discrete dynamic programming with no discounting. Ann. Math. Stat. 37 1284-1294.
10. WEBER, R. R. (1982) Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan or flowtime. J. Appl. Probab. 19 167-182.
11. WEBER, R. R., VARAIYA, P. and WALRAND, J. (1986) Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime. J. Appl. Probab. 23 841-847.
12. WEISS, G. (1990) Approximation results in parallel machines stochastic scheduling. Ann. Oper. Res. Special Volume on Production Planning and Scheduling (M. Queyranne, ed.) 26 195-242.
13. WEISS, G. (1992) Turnpike optimality of Smith's rule in parallel machines stochastic scheduling. Math. Oper. Res. 17 255-270.
14. WEISS, G. (1995) On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines. Adv. Appl. Probab. 27 821-839.