Baras, J. S., Dorsey, A. J. and Makowski, A. M. (1985) Two competing queues with linear costs and geometric service requirements: the µc-rule is often optimal. Adv. Appl. Prob.
Buyukkoc, C., Varaiya, P. and Walrand, J. (1985) The cµ rule revisited. Adv. Appl. Prob.
Chang, C. S. (1992) Ordering for stochastic majorization: theory and applications. Adv. Appl. Prob.
Chang, C. S. and Yao, D. D. (1990) Rearrangement, majorization and stochastic scheduling.
Frederickson, G. N., Bruno, J. and Downey, P. (1981) Sequencing tasks with exponential service times to minimize the expected flow time or makespan. J. Assoc. Comput. Mach. 28, 100–113.
Kämpke, T. (1987) On the optimality of static priority policies in stochastic scheduling on parallel machines. J. Appl. Prob.
Kämpke, T. (1989) Optimal scheduling of jobs with exponential service times on identical parallel processors. Operat. Res.
Keilson, T. (1979) Markov Chain Models - Rarity and Exponentiality.
Springer-Verlag, New York.
Marshall, A. W. and Olkin, I. (1979) Inequalities: Theory of Majorization and its Applications. Academic Press, New York.
Muirhead, R. F. (1903) Some methods applicable to identities and inequalities of symmetric algebraic functions with n letters. Proc. Edinburgh Math. Soc. 21, 144–157.
Pinedo, M. (1983) Stochastic scheduling with release dates and due dates. Operat. Res.
Pinedo, M. and Rammouz, E. (1988) A note on stochastic scheduling on a single machine subject to breakdown and repair. Prob. Eng. Inf. Sci. 2, 41–49.
Pinedo, M. and Weiss, G. (1979) Scheduling stochastic tasks on two parallel processors. Naval Res. Log. Quart. 26, 527–535.
Ross, S. M. (1983) Introduction to Stochastic Dynamic Programming. Academic Press, New York.
Shanthikumar, J. G. and Yao, D. D. W. (1991) Multiclass queueing systems: polymatroidal structure and optimal scheduling control. Operat. Res.
Van Der Heyden, L. (1981) Scheduling jobs with exponential processing and arrival times on identical processors so as to minimize expected makespan. Math. Operat. Res.
Walrand, J. (1988) An Introduction to Queueing Networks. Prentice Hall, Englewood Cliffs, NJ.
Weber, R. R. (1982) Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan or flowtime. J. Appl. Prob.
Weber, R. R. (1983) Scheduling stochastic jobs on parallel machines to minimize makespan or flowtime. In Applied Probability - Computer Science: The Interface
, ed. Disney, R. and Ott, T., pp. 327–338. Birkhauser, Boston, MA.
Weber, R. R. (1988) Stochastic scheduling on parallel processors and minimization of concave functions of completion times. In Stochastic Differential Systems, Stochastic Control Theory and Applications
, 10, ed. Fleming, W. and Lions, P. L., pp. 601–609. Springer-Verlag, New York.
Weiss, G. (1982) Multiserver stochastic scheduling. In Deterministic and Stochastic Scheduling, ed. Dempster, M. A. H., Lenstra, J. K., and Rinnooy Kan, A. H. G., pp. 157–179. Reidel, Dordrecht.
Weiss, G. and Pinedo, M. (1980) Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions. J. Appl. Prob.