An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns

Abstract Daily, there are multiple situations where machines or workers must execute certain jobs. During a working day it may be that some workers or machines are not available to perform their activities during some time periods. When scheduling models are used in these situations, workers or machines are simply called “machines”, and the temporal absences of availability are known as “breakdowns”. This paper considers some of these cases studying stochastic scheduling models with several machines to perform activities. Machines are specialized and models are flow-shops where breakdowns are allowed. The paper proposes a general procedure that tries to solve these problems. The proposed approach converts breakdowns scheduling problems into a finite sequence of without-breakdowns problems. Thus, we consider random variables, which measure the length of availability periods and repair times, to study availability intervals of machines. We propose partial feasible schedules in these intervals and combine them to offer a final global solution to optimize the expected makespan. Computational experiences are also reported.

[1]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[2]  Michael Pinedo,et al.  Stochastic Shop Scheduling: A Survey , 1982 .

[3]  Kevin Mahon,et al.  Deterministic and Stochastic Scheduling , 1983 .

[4]  Michael Pinedo,et al.  Inequalities for stochastic flow shops and job shops , 1986 .

[5]  Xiaoqiang Cai,et al.  Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs , 1999 .

[6]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[7]  Gideon Weiss,et al.  Multiserver Stochastic Scheduling , 1982 .

[8]  Sheldon M. Ross,et al.  Minimizing expected makespan in stochastic open shops , 1982, Advances in Applied Probability.

[9]  Michael Pinedo.  A note on the two machine job shop with exponential processing times , 1981 .

[10]  Z Liu,et al.  Scheduling Theory and its Applications , 1997 .

[11]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

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

[13]  Paul E. Torgersen,et al.  Industrial operations research , 1972 .

[14]  P C Bagga.  N-JOB, 2-MACHINE SEQUENCING PROBLEM WITH STOCHASTIC SERVICE TIMES , 1970 .

[15]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[16]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[17]  Michael Pinedo,et al.  A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair , 1988, Probability in the Engineering and Informational Sciences.

[18]  Eugene L. Grant,et al.  Statistical Quality Control , 1946 .

[19]  Wei Li,et al.  Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities , 1995, Oper. Res. Lett..

[20]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .