Index Policies and a Novel Performance Space Structure for a Class of Generalised Branching Bandit Problems

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 306 Link, Google Scholar
• Fay N. A. , Glazebrook K. D. On the scheduling of alternative stochastic jobs on a single machine. Adv. Appl. Probab. (1987) 19 955 973 Crossref, Google Scholar
• Fay N. A. , Glazebrook K. D. A general model for the scheduling of alternative tasks on a single machine. Probab. Engrg. Inform. Sci. (1989) 3 199 221 Crossref, Google Scholar
• Fay N. A. , Walrand J. C. On approximately optimal index strategies for generalised arm problems. J. Appl. Probab. (1991) 28 602 612 Crossref, Google Scholar
• Federgruen A. , Groenevelt H. Characterisation and optimisation of achievable performance in queueing systems. Oper. Res. (1988a) 36 733 741 Link, Google Scholar
• Federgruen A. , Groenevelt H. M/G/c queueing systems with multiple customer classes: Characterization and control of achievable performance under nonpreemptive priority rules. Management Sci. (1988b) 34 1121 1138 Link, Google Scholar
• Garbe R. , Glazebrook K. D. Stochastic scheduling with priority classes. Math. Oper. Res. (1998a) 23 119 144 Link, Google Scholar
• Garbe R. , Glazebrook K. D. Submodular returns and greedy heuristics for queueing scheduling problems. Oper. Res. (1998b) 46 336 346 Link, Google Scholar
• Gelenbe E. , Mitrani I. Analysis and Synthesis of Computer Systems (1980) (Academic Press, London, UK) Google Scholar
• Gittins J. C. Bandit processes and dynamic allocation indices. J. Roy. Statist. Soc. Ser. B (1979) 41 148 177 Google Scholar
• Gittins J. C. Multi-armed Bandit Allocation Indices (1989) (Wiley, New York) Google Scholar
• Gittins J. C. , Jones D. M. , Gani , Sarkadi , Vincze . A dynamic allocation index for the sequential design of experiments. Progress in Statistics (1974) (North-Holland, Amsterdam) 241 266 Google Scholar
• Glazebrook K. D. Stochastic scheduling with order constraints. Internat. J. Systems Sci. (1976) 7 657 666 Crossref, Google Scholar
• Glazebrook K. D. , Garbe R. Reflections on a new approach to Gittins indexation. J. Oper. Res. Soc. (1996) 47 1301 1309 Crossref, Google Scholar
• Glazebrook K. D. , Greatrix S. On scheduling influential stochastic tasks on a single machine. Eur. J. Oper. Res. (1993) 70 405 424 Crossref, Google Scholar
• Glazebrook K. D. , Greatrix S. On transformations of the Nash index. J. Appl. Probab. (1995) 32 168 182 Crossref, Google Scholar
• Glazebrook K. D. , Owen R. W. New results for generalised bandit processes. Internat. J. Systems. Sci. (1991) 22 479 494 Crossref, Google Scholar
• Klimov G. P. Time sharing systems I. Theory Probab. Appl. (1974) 19 532 551 Crossref, Google Scholar
• Nash P. A generalized bandit problem. J. Roy. Statist. Soc. Ser. B (1980) 42 165 169 Google Scholar
• Shanthikumar J. G. , Yao D. D. Multi-class queueing systems: Polymatroidal structure and optimal scheduling control. Oper. Res. (1992) 40 S293 299 Link, Google Scholar
• Tcha D. W. , Pliska S. R. Optimal control of single-server queueing networks and multi-class M/G/1 queues with feedback. Oper. Res. (1977) 25 248 258 Link, Google Scholar
• Tsitsiklis J. N. A short proof of the Gittins index theorem. Ann. Appl. Probab. (1993) 2 1024 1033 Google Scholar
• Weiss G. Branching bandit processes. Probab. Engrg. Inform. Sci. (1988) 2 269 278 Crossref, Google Scholar
• Whittle P. Multi-armed bandits and the Gittins index. J. Roy. Statist. Soc. Ser. B (1980) 42 143 149 Google Scholar
• Whittle P. Arm acquiring bandits. Ann. Probab. (1981) 9 284 292 Crossref, Google Scholar