Match-up scheduling under a machine breakdown

When a machine breakdown forces a modified flow shop (MFS) out of the prescribed state, the proposed strategy reschedules part of the initial schedule to match up with the preschedule at some point. The objective is to create a new schedule that is consistent with the other production planning decisions like material flow, tooling and purchasing by utilizing the time critical decision making concept. We propose a new rescheduling strategy and a match-up point determination procedure through a feedback mechanism to increase both the schedule quality and stability. The proposed approach is compared with alternative reactive scheduling methods under different experimental settings.

[1]  Ram V. Rachamadugu,et al.  Accurate myopic heuristics for tardiness scheduling , 1984 .

[2]  Chung-Yee Lee,et al.  Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times , 1993, Discret. Appl. Math..

[3]  Albert Jones,et al.  A real-time production scheduler for a stochastic manufacturing environment , 1988 .

[4]  James C. Bean,et al.  Matchup Scheduling with Multiple Resources, Release Dates and Disruptions , 1991, Oper. Res..

[5]  Stephen C. Graves,et al.  A Review of Production Scheduling , 1981, Oper. Res..

[6]  Shimon Y. Nof,et al.  Adaptive/predictive scheduling: review and a general framework , 1991 .

[7]  Stephen F. Smith,et al.  An Integrated Framework for Generating and Revising Factory Schedules , 1990 .

[8]  Chung-Yee Lee,et al.  Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint , 1997, Oper. Res. Lett..

[9]  Christos Koulamas,et al.  The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..

[10]  C. Chu.  A branch-and-bound algorithm to minimize total tardiness with different release dates , 1992 .

[11]  Chung-Yee Lee,et al.  Machine scheduling with an availability constraint , 1996, J. Glob. Optim..

[12]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

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

[14]  Joseph Y.-T. Leung,et al.  Minimizing mean flow time with release time and deadline constraints , 1988, Proceedings. Real-Time Systems Symposium.

[15]  Upendra Dave,et al.  Heuristic Scheduling Systems , 1993 .

[16]  Thomas E. Morton,et al.  Heuristic scheduling systems : with applications to production systems and project management , 1993 .

[17]  Pei-Chann Chang,et al.  One-machine rescheduling heuristics with efficiency and stability as criteria , 1993, Comput. Oper. Res..

[18]  Robert H. Storer,et al.  Robustness Measures and Robust Scheduling for Job Shops , 1994 .

[19]  Jacek Blazewicz,et al.  Scheduling in Computer and Manufacturing Systems , 1990 .

[20]  Elizabeth Szelke,et al.  Knowledge-based reactive scheduling , 1994 .

[21]  M. S. Akturk,et al.  Part-machine grouping using a multi-objective cluster analysis , 1996 .