Agrawal, R., Hegde, M., and Teneketzis, D. (1988) Asymptotically efficient adaptive allocation rules for the multi-armed bandit problem with switching cost. IEEE Trans. Autom. Control
Agrawal, R., Hegde, M., and Teneketzis, D. (1990) Multi-armed bandit problems with multiple plays and switching cost. Stoch. Stoch. Rep.
Browne, S. and Yechiali, U. (1989) Dynamic priority rules for cyclic-type queues. Adv. Appl. Prob.
Bruno, J. and Downey, P. (1978) Complexity of task sequencing with deadlines, set-up times and changeover costs. SIAM J. Comput.
Dempster, M. A. H., Lenstra, J. K., and Rinnooy Kan, A. M. G. (1982) Deterministic and Stochastic Scheduling.
Foss, S. G. (1984) Queues with customers of several types. In Advances in Probability Theory: Limit Theorems, and Related Problems, ed. Borovkov, A. A., pp. 348–377. Springer-Verlag, New York.
Gittins, J. C. (1979) Bandit processes and dynamic allocation indices. J. R. Statist. Soc. B
Gittins, J. C. (1989) Multi-armed Bandit Allocation Indices.
Wiley, New York.
Gittins, J. C. and Jones, D. M. (1974) A dynamic allocation index for the sequential design of experiments. Read at the 1972 European Meeting of Statisticians, Budapest. In Progress in Statistics ed. Gani, J. et al., pp. 241–266. North-Holland, Amsterdam.
Glazebrook, K. D. (1980) On stochastic scheduling with precedence relations and switching cost. J. Appl. Prob.
Glazebrook, K. D. and Gittins, J. C. (1981) On single-machine scheduling with precedence relations and linear or discounted costs. Operat. Res.
Gupta, D., Gerchak, Y., and Buzacott, J. A. (1987) On optimal priority rules for queues with switchover costs, Preprint, Dept. of Management Sciences, University of Waterloo.
Harrison, J. M. (1975) Dynamic scheduling of a multi-class queue: discount optimality. Operat. Res.
Hofri, M. and Ross, K. W. (1987) On the optimal control of two queues with server setup times and its analysis. SIAM J. Comput.
Jo, K. Y. (1987) Decomposition approximation of queueing-network control models with tree structures. Ann. Operat. Res.
Klimov, G. P. (1974) Time sharing service systems I. Theory Prob. Appl.
Klimov, G. P. (1978) Time sharing service systems II. Theory Prob. Appl.
Lai, T. L. and Ying, Z. (1988) Open bandit processes and optimal scheduling of queueing networks. Adv. Appl. Prob.
Liu, Z., Nain, P., and Towsley, D. (1992) On optimal polling policies. QUESTA
Magnanti, T. L. and Vachani, R. (1990) A strong cutting plane algorithm for production scheduling with changeover costs. Operat. Res.
Monma, C. L. and Potts, C. N. (1989) On the complexity of scheduling with batch set up times. Operat. Res.
Nain, P. (1989) Interchange arguments for classical scheduling problems in queues. Systems Control Lett.
Nain, P., Tsoucas, P., and Walrand, J. (1989) Interchange arguments in stochastic scheduling. J. Appl. Prob.
Perkins, J. R. and Kumar, P. R. (1989) Stable distributed real-time scheduling of flexible manufacturing/assembly/disassembly systems. IEEE Trans. Autom. Control
Rajan, R. and Agrawal, R. (1991) Stochastic dominance in homogeneous queueing systems with switchover costs. .
Ross, S. (1983) Introduction to Stochastic Dynamic Programming.
Academic Press, New York.
Santos, C. and Magazine, M. (1985) Batching in single operation manufacturing systems. Operat. Res. Lett.
Van Oyen, M. P. (1992) Optimal Stochastic Scheduling of Queueing Networks: Switching Costs and Partial Information. , University of Michigan.
Van Oyen, M. P., Pandelis, D., and Teneketzis, D. (1992) Optimality of index policies for stochastic scheduling with switching penalties. J. Appl. Prob.
Varaiya, P., Walrand, J., and Buyukkoc, C. (1985) Extensions of the multi-armed bandit problem. IEEE Trans. Autom. Control
Walrand, J. (1988) An Introduction to Queueing Networks.
Prentice-Hall, Englewood Cliffs, NJ.
Weber, R. R. and Weiss, G. (1990) On an index policy for restless bandits. J. Appl. Prob.
Whittle, P. (1988) Restless bandits: activity allocation in a changing world. In A Celebration of Applied Probability, ed. Gani, J.,