Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines
Annals of Operations Research
Baltzer Science Publishers, Baarn/Kluwer Academic Publishers
181 - 198
Item Usage Stats
MetadataShow full item record
We propose a heuristic procedure that constructs a schedule for N jobs with stochastic processing times and a common due date on M parallel, identical machines. The criterion is the minimization of the total expected incompletion cost. A worst-case analysis for the ratio of the heuristic and optimal solutions is presented and a bound on the ratio is derived. The experimental results presented indicate that the heuristic procedure generates almost optimal solutions. © 1989 J.C. Baltzer A.G. Scientific Publishing Company.