Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption

We consider the rescheduling on a single machine with release dates to minimize the makespan and total sequence disruption simultaneously. In the literature, a polynomial-time algorithm was presented for minimizing the makespan under a limit on the total sequence disruption. But the algorithm is not strongly polynomial. We present a strongly polynomial-time algorithm for finding all Pareto optimal points of the Pareto optimization problem. Consequently, the rescheduling to minimize the makespan under a limit on the total sequence disruption can be solved in a strongly polynomial time.

[1]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

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

[3]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

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

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

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

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

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

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

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

[11]  Pei-Chann Chang,et al.  A Rescheduling Procedure for Manufacturing Systems Under Random Disruptions , 1992 .

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

[13]  Sanjay Mehta,et al.  Predictable scheduling of a single machine subject to breakdowns , 1999, Int. J. Comput. Integr. Manuf..

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

[15]  Xiao Guo,et al.  On-Line Rescheduling to Minimize Makespan under a Limit on the Maximum Disruptions , 2009, 2009 International Conference on Management of e-Commerce and e-Government.

[16]  Jinjiang Yuan,et al.  Rescheduling with Release dates to minimize Total Sequence Disruption under a Limit on the makespan , 2007, Asia Pac. J. Oper. Res..

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

[18]  Albert T. Jones,et al.  New Directions for Operations Research in Manufacturing , 1992 .

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

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

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

[22]  Tian Xiao-zheng.  Pareto Optimizations of Objective and Disruptions for Rescheduling Problems , 2010 .

[23]  Xiao Guo,et al.  On-Line Rescheduling to Minimize Makespan under a Limit on the Maximum Sequence Disruption , 2009, 2009 IITA International Conference on Services Science, Management and Engineering.

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

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