论文信息 - Parallel-machine rescheduling with machine disruptions

Parallel-machine rescheduling with machine disruptions

In this study we consider a rescheduling problem on identical parallel machines. The rescheduling is undertaken because of a period of unavailability on one of the machines. We consider the total flow time as an efficiency measure and stability is gauged in terms of the number of jobs processed on different machines in the original and new schedules. We show that all efficient schedules with respect to efficiency and stability measures can be generated in polynomial time.

Meral Azizoglu | Oguzhan Alagöz | M. Azizoglu | Oğuzhan Alagöz

[1] S. D. Wu,et al. On Scheduling with Ready-Times, Due-Dates and Vacations , 1992 .

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

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

[4] William L. Maxwell,et al. Theory of scheduling , 1967 .

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

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

[7] Wade H. Shaw,et al. Simulation modeling of a dynamic job shop rescheduling with machine availability constraints , 1998 .

[8] Bo Guo,et al. Rescheduling and optimization of schedules considering machine failures , 1999 .

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

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

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

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