论文信息 - Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption - 字舞流文

Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption

In this paper, we consider the rescheduling problem for jobs on a single machine with release dates to minimize makespan under a limit on the maximum sequence disruption. We show that the considered problem can be solved in polynomial time.

Jinjiang Yuan | Yundong Mu | Yundong Mu | Jinjiang Yuan

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

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

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

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

[5] Angelika Steger,et al. Approximability of scheduling with fixed jobs , 1999, SODA '99.

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

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

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