K.J. Becker, D.P. Gaver, K.D. Glazebrook, P.A. Jacobs and S. Lawphongpanich, Allocation of tasks to specialised processors: A planning approach, European J. Oper. Res. 126 (1999) 80-88.
D. Bertsimas and J. Niño Mora, Conservation laws, extended polymatroids and multiarmed bandit problems: A polyhedral approach to indexable systems, Math. Oper. Res. 21 (1996) 257-306.
D. Bertsimas, I.C. Paschalidis and J.N. Tsitsiklis, Branching bandits and Klimov's problem: Achievable region and side constraints, IEEE Trans. Automat. Control 40(12) (1995) 2063-2075.
C.S. Chang and D.D. Yao, Rearrangement, majorization and stochastic scheduling, Math. Oper. Res. 18 (1993) 658-684.
M.J. Dacre, Stochastic scheduling in networks, Ph.D. thesis, Newcastle University (1998).
M.J. Dacre, K.D. Glazebrook and J.N. Niño Mora, The achievable region approach to the optimal control of stochastic systems (with discussion), J. Roy. Statist. Soc. B 61 (1999) 747-791.
A. Federgruen and H. Groenevelt, The impact of the composition of the customer base on general queueing models, J. Appl. Probab. 24 (1987) 709-724.
R. Garbe and K.D. Glazebrook, Submodular returns and greedy heuristics for queueing scheduling problems, Oper. Res. 46 (1998) 336-346.
E. Gelenbe and I. Mitrani, Analysis and Synthesis of Computer Systems (Academic Press, London, 1980).
R.J. Gibbens, Contribution to discussion of the paper by Dacre, Glazegbrook and Niño Mora, J. Roy. Statist. Soc. 61 (1999) 776-777.
J.C. Gittins, Bandit processes and dynamic allocation indices (with discussion), J. Roy. Statist. Soc. B 41 (1979) 148-177.
G.P. Klimov, Time sharing systems I, Theory Probab. Appl. 19 (1974) 532-551.
K.W. Ross and D.D. Yao, Optimal load balancing and scheduling in a distributed computer system, J. Assoc. Comput. Mach. 38 (1991) 676-690.
J.G. Shanthikumar and D.D. Yao, Multi-class queueing systems: Polymatroidal structure and optimal scheduling control, Oper. Res. 40 (1992) 293-299.
G. Weiss, Branching bandit processes, Probab. Engrg. Inform. Sci. 2 (1988) 269-278.