Ansell, P. S., Glazebrook, K. D., Niño-Mora, J. and O'Keeffe, M. (2003). Whittle's index policy for a multi-class queueing system with convex holding costs. Math. Meth. Operat. Res.
Gittins, J. C. (1979). Bandit processes and dynamic allocation indices. With discussion. J. R. Statist. Soc. Ser. B
Gittins, J. C. (1989). Multi-Armed Bandit Allocation Indices. John Wiley, Chichester.
Glazebrook, K. D., Lumley, R. R. and Ansell, P. S. (2003). Index heuristics for multi-class M/G/1 systems with non-preemptive service and convex holding costs. Queueing Systems
Glazebrook, K. D., Niño-Mora, J. and Ansell, P. S. (2002). Index policies for a class of discounted restless bandits. Adv. Appl. Prob.
Niño-Mora, J. (2001a). PCL-indexable restless bandits: diminishing marginal returns, optimal marginal reward rate index characterization, and a tiring–recovery model. Unpublished manuscript.
Niño-Mora, J. (2001b). Restless bandits, partial conservation laws and indexability. Adv. Appl. Prob.
Niño-Mora, J. (2002). Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach. Math. Program.
Papadimitriou, C. H. and Tsitsiklis, J. N. (1999). The complexity of optimal queueing network control. Math. Operat. Res.
Puterman, M. L. (1994). Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley, New York.
Tijms, H. C. (1994). Stochastic Models: An Algorithmic Approach. John Wiley, New York.
Weber, R. R. and Weiss, G. (1990). On an index policy for restless bandits. J. Appl. Prob.
Weber, R. R. and Weiss, G. (1991). Addendum to ‘On an index policy for restless bandits’. Adv. Appl. Prob.
Whittle, P. (1988). Restless bandits: activity allocation in a changing world. In A Celebration of Applied Probability (J. Appl. Prob. Spec. Vol. 25A), pplied Probability Trust, Sheffield, pp. 287–298.