Parallel Machine Scheduling under the Disruption of Machine Breakdown

This paper investigates the scheduling problem of dealing with disruption caused by machine breakdown under the environment of identical parallel machines. When a machine breakdown changes the scheduling environment, the original schedule cannot be executed according to the prescribed plan. The objective after disruption is to create a recovery schedule that minimizes the original objective function and the deviation from the original schedule. The original objective function is the total weighted completion time, and the deviation is the completion time of jobs from the planned one. The recovery scheduling problem is formulated as an integer programming model. A Lagrangian relaxation (LR) framework that relaxes the machine capacity constraints is proposed for solving the model. The subgradient method is used to update the values of Lagrangian multipliers. The extensive computational experiments are carried out, and the numerical results demonstrate that the proposed LR approach based on the developed mod...

[1]  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.

[2]  Gang Yu,et al.  A Grasp for Aircraft Routing in Response to Groundings and Delays , 1997, J. Comb. Optim..

[3]  Sylvie Gélinas,et al.  A dynamic programming algorithm for single machine scheduling with ready times , 1997, Ann. Oper. Res..

[4]  Peter B. Luh,et al.  A Lagrangian relaxation based approach to schedule asset overhaul and repair services , 2005, IEEE Transactions on Automation Science and Engineering.

[5]  Joseph Y.-T. Leung,et al.  Two Machine Scheduling under Disruptions with Transportation Considerations , 2006, J. Sched..

[6]  Jaime Cerdá,et al.  Dynamic scheduling in multiproduct batch plants , 2003, Comput. Chem. Eng..

[7]  Jaime Cerdá,et al.  An MILP framework for batch reactive scheduling with limited discrete resources , 2004, Comput. Chem. Eng..

[8]  Susanne Albers,et al.  Scheduling with unexpected machine breakdowns , 1999, Discret. Appl. Math..

[9]  Jonathan F. Bard,et al.  Disruption management for resource-constrained project scheduling , 2005, J. Oper. Res. Soc..

[10]  W. J. Chen,et al.  Scheduling under machine breakdown in a continuous process industry , 2004, Comput. Oper. Res..

[11]  Stanislaw Gawiejnowicz,et al.  Scheduling deteriorating jobs subject to job or machine availability constraints , 2007, Eur. J. Oper. Res..

[12]  Lu-Wen Liao,et al.  Parallel machine scheduling with machine availability and eligibility constraints , 2008, Eur. J. Oper. Res..

[13]  Iiro Harjunkoski,et al.  An MILP-Based reordering algorithm for complex industrial scheduling and rescheduling , 2001 .

[14]  Anand Paul,et al.  Minimizing makespan on a single machine subject to random breakdowns , 2006, Oper. Res. Lett..

[15]  Marianthi G. Ierapetritou,et al.  A New Approach for Efficient Rescheduling of Multiproduct Batch Plants , 2000 .

[16]  Jens Clausen,et al.  Disruption Management for an Airline - Rescheduling of Aircraft , 2002, EvoWorkshops.

[17]  M. Selim Akturk,et al.  Match-up scheduling under a machine breakdown , 1999, Eur. J. Oper. Res..

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

[19]  Robert F. Dell,et al.  Optimization and Persistence , 1997 .

[20]  Jaime Cerdá,et al.  State-of-the-art review of optimization methods for short-term scheduling of batch processes , 2006, Comput. Chem. Eng..

[21]  Gang Yu,et al.  Single machine scheduling under potential disruption , 2007, Oper. Res. Lett..

[22]  Jonathan F. Bard,et al.  Multiple fleet aircraft schedule recovery following hub closures , 2001 .

[23]  Hua Xuan,et al.  A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time , 2006, Comput. Oper. Res..