On the Evaluation of Non-Preemptive Strategies in Stochastic Scheduling
A collection of stochastic jobs is to be processed by a single machine. The jobs must be processed in a manner which is consistent with a precedence relation but the machine is free to switch from one job to another at any time. Such switches are costly, however. A general model is proposed for this problem. Sufficient conditions are given which ensure that there is an optimal strategy given by a fixed permutation of the job set. These conditions are then used as a starting point for the important task of evaluating permutations as strategies in more general circumstances where no permutation is optimal.
Unable to display preview. Download preview PDF.
- 6.Glazebrook, K. D.: “On non-preemptive strategies in stochastic scheduling”, 1981, Nav. Res. Logist. Qu. (to appear).Google Scholar
- 7.Glazebrook, K. D.: “On non-preemptive strategies for stochastic scheduling problems in continuous time”, 1981, Int. J. Systems Sci: (to appear).Google Scholar
- 8.Glazebrook, K. D.: “Methods for the evaluation of permutations as strategies in stochastic scheduling problems”, (submitted).Google Scholar
- 9.Glazebrook, K.D.: “On the evaluation of fixed permutations as strategies in stochastic scheduling”, (submitted).Google Scholar
- 13.Nash, P.: “Optimal allocation of resources between research projects”, 1973, Ph.D. thesis, Cambridge University.Google Scholar
- 14.Sevcik, K.C.: “The use of service-time distributions in scheduling”, 1972, Tech. Rept. CSRG-14, University of Toronto.Google Scholar