Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria

In this paper, we consider a rescheduling problem where a set of jobs has already been assigned to unrelated parallel machines. When a disruption occurs on one of the machines, the affected jobs are rescheduled, considering the efficiency and the schedule deviation measures. The efficiency measure is the total flow time, and the schedule deviation measure is the total disruption cost caused by the differences between the initial and current schedules. We provide polynomial-time solution methods to the following hierarchical optimization problems: minimizing total disruption cost among the minimum total flow time schedules and minimizing total flow time among the minimum total disruption cost schedules. We propose exponential-time algorithms to generate all efficient solutions and to minimize a specified function of the measures. Our extensive computational tests on large size problem instances have revealed that our optimization algorithm finds the best solution by generating only a small portion of all efficient solutions.

[1]  Arman R. Yaghubian,et al.  Dry kiln scheduling in furniture production , 1999 .

[2]  S. J. Mason,et al.  Rescheduling strategies for minimizing total weighted tardiness in complex job shops , 2004 .

[3]  Rasaratnam Logendran,et al.  Unrelated parallel machine scheduling with job splitting , 2004 .

[4]  Joseph Y.-T. Leung,et al.  A note on scheduling parallel machines subject to breakdown and repair , 2004 .

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

[6]  Oguzhan Alagöz,et al.  Rescheduling of identical parallel machines under machine eligibility constraints , 2003, Eur. J. Oper. Res..

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

[8]  Murat Köksalan,et al.  Note: Bicriteria scheduling for minimizing flow time and maximum tardiness , 1996 .

[9]  J. A. Svestka,et al.  Rescheduling job shops under random disruptions , 1997 .

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

[11]  Velusamy Subramaniam,et al.  Reactive Recovery of Job Shop Schedules – A Review , 2002 .

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

[13]  Gur Mosheiov,et al.  Minimizing the sum of job completion times on capacitated parallel machines , 1994 .

[14]  Panagiotis Kouvelis,et al.  Robust scheduling to hedge against processing time uncertainty in single-stage production , 1995 .

[15]  Reha Uzsoy,et al.  Predictable scheduling of a single machine with breakdowns and sensitive jobs , 1999 .

[16]  Zhi-Long Chen,et al.  Scheduling jobs and maintenance activities on parallel machines , 2000 .

[17]  J. Curry,et al.  Rescheduling parallel machines with stepwise increasing tardiness and machine assignment stability objectives , 2005 .

[18]  Vijay Aggarwal,et al.  A Lagrangean-relaxation method for the constrained assignment problem , 1985, Comput. Oper. Res..

[19]  Louis A. Martin-Vega,et al.  Flow-time performance of modified scheduling heuristics in a dynamic rescheduling environment , 1996 .

[20]  Reha Uzsoy,et al.  Analysis of periodic and event-driven rescheduling policies in dynamic shops , 1992 .

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

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

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

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

[25]  M. Azizoglu,et al.  Generating all efficient solutions of a rescheduling problem on unrelated parallel machines , 2009 .

[26]  M. O. Olumolade.  Reactive scheduling system for cellular manufacturing with failure-prone machines , 1996 .

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

[28]  Andrew Lim,et al.  Searching optimal resequencing and feature assignment on an automated assembly line , 2005, 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05).

[29]  Rasaratnam Logendran,et al.  Scheduling unrelated parallel machines with sequence-dependent setups , 2007, Comput. Oper. Res..

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

[31]  V. Suresh,et al.  Scheduling of unrelated parallel machines when machine availability is specified , 1996 .

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

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