Abstract
A number of identical machines operating in parallel are to be used to complete the processing of a collection of jobs so as to minimize either the jobs' makespan or flowtime. The total processing required to complete each job has the same probability distribution, but some jobs may have received differing amounts of processing prior to the start. When the distribution has a monotone hazard rate the expected value of the makespan (flowtime) is minimized by a strategy which always processes those jobs with the least (greatest) hazard rates. When the distribution has a density whose logarithm is concave or convex these strategies minimize the makespan and flowtime in distribution. These results are also true when the processing requirements are distributed as exponential random variables with different parameters.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference21 articles.
1. Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
2. Glazebrook K. D. (1976) Stochastic Scheduling. Ph.D. Thesis, University of Cambridge.
3. Nash P. (1973) Optimal Allocation of Resources to Research Projects. Ph.D. Thesis, University of Cambridge.
4. Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
5. An optimal strategy in multi-server stochastic scheduling;Weber;J. R. Statist. Soc.,1979
Cited by
100 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献