Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time

The problem of scheduling n jobs on m parallel machines is considered when the machines are subject to random breakdowns and job processing times are random variables. An objective function of mean flow time is developed for a general parallel machine system, and an expression of its expected value is derived. The problem is transformed into a deterministic unrelated parallel machine scheduling model with modified processing times when the number of breakdowns is modeled as a generalized Poisson process. © 1994 John Wiley & Sons, Inc.

[1]  Michael Pinedo,et al.  Scheduling stochastic jobs with due dates on parallel machines , 1990 .

[2]  K. Glazebrook.  Scheduling tasks with exponential service times on parallel processors , 1979 .

[3]  Ellis Horowitz,et al.  Exact and Approximate Algorithms for Scheduling Nonidentical Processors , 1976, JACM.

[4]  Michael Pinedo,et al.  Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions , 1980, Journal of Applied Probability.

[5]  A.H.G. Rinnooy Kan,et al.  Single‐machine scheduling subject to stochastic breakdowns , 1990 .

[6]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[7]  Satish K. Tripathi,et al.  A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors , 1984, IEEE Transactions on Computers.

[8]  W. A. Horn.  Technical Note - Minimizing Average Flow Time with Parallel Machines , 1973, Oper. Res..

[9]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[10]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[11]  Jan Karel Lenstra,et al.  Recent developments in deterministic sequencing and scheduling: a survey : (preprint) , 1981 .

[12]  Thomas Kämpke,et al.  Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors , 1989, Oper. Res..

[13]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[14]  M. Raghavachari,et al.  Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties , 1993, Oper. Res..