《1997 Rescheduling job shops under random disruptions》.pdf

int j prod res vol no . . . ., 1997, . 35, . 7, 2065± 2082 Rescheduling job shops under random disruptions * R. J. ABUMAIZA R² and J. A. SVESTKA In this work, an algorithm for rescheduling the a ected operations in a job shop is presented and its performance, with respect to measures of e ciency and stability, is compared with that of Total Rescheduling and Right-Shift Rescheduling. Algorithms f or all three methods are implemented in a rescheduling program which, based on keyed-in disruption inf ormation, produces three new schedules and outputs their related performance measures. A designed f actorial experiment is performed on benchmark scheduling problems to study the e ect of di erent rescheduling methods as well as various problem characteristics and disruption scenarios on the perf ormance of the new schedules. The results demonstrate that the A ected Operations Algorithm overcomes the disadvantages associated with other rescheduling methods. Key terms used in this paper DownMachine: This term refers to the disrupted machine, i.e. the machine on which the disruption occurs. DownTime: This time refers to the duration of the disruption. Initial Schedule: This is the disrupted schedule which requires rescheduling .1 Rescheduling: This refers to the process of ® nding a new schedule upon the occurrence of a disruption in the operations of an on-going initial schedule such that the technological constraints remain viable and the performance criteria are still optimized. New Schedul