Advertisement

On the Evaluation of Non-Preemptive Strategies in Stochastic Scheduling

  • K. D. Glazebrook
Part of the NATO Advanced Study Institutes Series book series (ASIC, volume 84)

Abstract

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.

Keywords

Switching Cost Single Machine Precedence Relation Discount Cost Linear Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bruno, J., and Hofri, M.: “On scheduling chains of jobs on one processor with limited preemption” 1975, SIAM J. Comput. 4, pp. 478–490.MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Gittins, J.C.: “Bandit processes and dynamic allocation indices”, 1979, J. Roy. Statist. Soc. B41, pp. 148–177.MathSciNetGoogle Scholar
  3. 3.
    Gittins, J. C. and Glazebrook, K. D.: “On Bayesian models in stochastic scheduling”, 1977, J. Appl. Prob. 14, pp. 556–565.MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Glazebrook, K.D.: “Stochastic scheduling with order constraints”, 1976, Int.J. Systems Sci. 7, PP. 657–666.MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Glazebrook, K.D.: “On stochastic scheduling with precedence relations and switching costs”, 1980, J. Appl. Prob. 17, pp. 1016–1024.MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Glazebrook, K. D.: “On non-preemptive strategies in stochastic scheduling”, 1981, Nav. Res. Logist. Qu. (to appear).Google Scholar
  7. 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. 8.
    Glazebrook, K. D.: “Methods for the evaluation of permutations as strategies in stochastic scheduling problems”, (submitted).Google Scholar
  9. 9.
    Glazebrook, K.D.: “On the evaluation of fixed permutations as strategies in stochastic scheduling”, (submitted).Google Scholar
  10. 10.
    Glazebrook, K.D. and Gittins, J. C.: “On single-machine scheduling with precedence relations and linear or discounted costs”, 1981, Oper. Res. 29, pp. 161–173.MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Kadane, J.B. and Simon, H.A.: “Optimal strategies for a class of constrained sequential problems”, 1977, Ann. Statist. 5, pp. 237–255.MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Meilijson, I. and Weiss, G.: “Multiple feedback at a single server station”, 1977, Stoch Proc. Appl. 5, pp. 195–205.MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Nash, P.: “Optimal allocation of resources between research projects”, 1973, Ph.D. thesis, Cambridge University.Google Scholar
  14. 14.
    Sevcik, K.C.: “The use of service-time distributions in scheduling”, 1972, Tech. Rept. CSRG-14, University of Toronto.Google Scholar
  15. 15.
    Sidney, J.B.: “Decomposition algorithms for single machine sequencing with precedence relations and deferral costs”, 1975, Oper. Res. 23, pp. 283–298.MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© D. Reidel Publishing Company 1982

Authors and Affiliations

  • K. D. Glazebrook
    • 1
  1. 1.University of Newcastle upon TyneUK

Personalised recommendations