Erel, E.Sarin, S.C.2016-02-082016-02-0819890254-5330http://hdl.handle.net/11693/26231We 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.EnglishArticle10.1007/BF02096604