Bertsimas, D. and Niño-Mora, J. (1994) Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to indexable systems.
Gittins, J. C. (1989) Multi-Armed Bandit Allocation Indices.
Wiley, New York.
Glazebrook, K. D. (1976) Stochastic scheduling with order constraints. Int. J. Systems Sci.
Glazebrook, K. D. (1982) On the evaluation of suboptimal strategies for families of alternative bandit processes. J. Appl. Prob.
Glazebrook, K. D. (1983) Stochastic scheduling with due dates. Int. J. Systems Sci.
Glazebrook, K. D. (1987) Sensitivity analysis for stochastic scheduling problems. Math. Operat. Res.
Glazebrook, K. D. (1991) Strategy evaluation for stochastic scheduling problems with order constraints. Adv. Appl. Prob.
Glazebrook, K. D. and Gittins, J. C. (1981) On single-machine scheduling with precedence relations and linear or discounted costs. Operat. Res.
Katehakis, M. N. and Veinott, A. F. (1987) The multi-armed bandit problem: decomposition and computation. Math. Operat. Res.
Klimov, G. P. (1974) Time sharing service systems I. Theory Prob. Appl.
Lai, T. L. and Ying, Z. (1988) Open bandit processes and optimal scheduling of queueing networks. Adv. Appl Prob.
Nain, P., Tsoucas, P. and Walrand, J. C. (1989) Interchange arguments in stochastic scheduling. J. Appl. Prob.
Ross, S. M. (1970) Applied Probability Models with Optimization Applications.
Holden-Day, San Francisco.
Ross, S. M. (1983) Introduction to Stochastic Dynamic Programming.
Academic Press, New York.
Sidney, J. B. (1975) Decomposition algorithms for single-machine scheduling with precedence relations and deferral costs. Operat. Res.
Tijms, H. C. (1986) Stochastic Modelling and Analysis: .
Tsitsiklis, J. N. (1994) A short proof of the Gittins index theorem. Ann. Appl. Prob.
Varaiya, P., Walrand, J. C. and Buyukkoc, C. (1985) Extensions of the multiarmed bandit problem: the discounted case. IEEE Trans. Aut. Control.
Walrand, J. C. (1988) An Introduction to Queueing Networks.
Prentice Hall, Englewood Cliffs, N.J.