Rescheduling for machine disruption to minimize makespan and maximum lateness

We consider a scheduling problem where a set of jobs has already been scheduled to minimize some cost objective on a single machine when the machine becomes unavailable for a period of time. The decision-maker needs to reschedule the jobs without excessively disrupting the original schedule. The disruption is measured as the maximum time deviation, for any given job, between the original and new schedules. We examine a general model where the maximum time disruption appears both as a constraint and as part of the cost objective. For a scheduling cost modeled as the makespan or maximum lateness, we provide a pseudopolynomial time optimal algorithm, a constant factor approximation algorithm, and a fully polynomial time approximation scheme. The approximation algorithm has an asymptotically achievable worst-case performance ratio of 2 and has average performance close to optimal. Managerial insights are given on how scheduling costs are affected by machine disruption and the approximation algorithm.

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

[2]  Chris N. Potts,et al.  Rescheduling for New Orders , 2004, Oper. Res..

[3]  Jan Van Damme,et al.  Project scheduling under uncertainty survey and research potentials , 2002 .

[4]  Jinjiang Yuan,et al.  Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption , 2007, Eur. J. Oper. Res..

[5]  Chung-Yee Lee,et al.  Single machine flow-time scheduling with scheduled maintenance , 1992, Acta Informatica.

[6]  Manuel A. Nunez,et al.  OR Practice - Efficient Short-Term Allocation and Reallocation of Patients to Floors of a Hospital During Demand Surges , 2009, Oper. Res..

[7]  Chris N. Potts,et al.  Rescheduling for Multiple New Orders , 2007, INFORMS J. Comput..

[8]  Monte Zweben,et al.  Scheduling and rescheduling with iterative repair , 1993, IEEE Trans. Syst. Man Cybern..

[9]  Jeffrey W. Herrmann,et al.  Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods , 2003, J. Sched..

[10]  Reha Uzsoy,et al.  Executing production schedules in the face of uncertainties: A review and some future directions , 2005, Eur. J. Oper. Res..

[11]  Gang Yu,et al.  Special Issue: 2002 Franz Edelman Award for Achievement in Operations Research and the Management Sciences: A New Era for Crew Recovery at Continental Airlines , 2003, Interfaces.

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

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

[14]  Xiangtong Qi,et al.  Disruption management in production planning , 2005 .

[15]  Xiangtong Qi,et al.  Disruption management for machine scheduling: The case of SPT schedules , 2006 .

[16]  Xiangtong Qi,et al.  Disruption Management: Framework, Models And Applications , 2004 .

[17]  Gerhard J. Woeginger,et al.  Approximation schemes-a tutorial , 2001 .

[18]  Meral Azizoglu,et al.  Parallel-machine rescheduling with machine disruptions , 2005 .

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

[20]  Marc E. Posner,et al.  Generating Experimental Data for Computational Testing with Machine Scheduling Applications , 2001, Oper. Res..

[21]  Bibo Yang,et al.  Single machine rescheduling with new jobs arrivals and processing time compression , 2007 .

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

[23]  Reha Uzsoy,et al.  Rescheduling on a single machine with part-type dependent setup times and deadlines , 1997, Ann. Oper. Res..

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

[25]  Chris N. Potts,et al.  Rescheduling for Job Unavailability , 2010, Oper. Res..