Short to medium term schedules of a manufacturing system are often produced a priori in order to direct production operations and to support other planning activities such as tooling, raw material delivery and resource allocation. Unfortunately, as soon as the a priori schedule is released to the shop, myriad disturbances will arise which render the schedule obsolete. “Rescheduling” is a means of restoring the operations schedule when such a disruption has occurred. Complications arise when schedule changes induce major cost impact to other planning activities which use the a priori schedule as a basis. This problem of shop rescheduling is of great practical importance and has been addressed in various areas of Operations Research including stochastic scheduling and combinatorial optimization.
[1]
G. Gallego.
Linear Control Policies for Scheduling a Single Facility After an Initial Disruption
,
1988
.
[2]
Egon Balas,et al.
The Shifting Bottleneck Procedure for Job Shop Scheduling
,
1988
.
[3]
J. Carlier,et al.
An algorithm for solving the job-shop problem
,
1989
.
[4]
Shimon Y. Nof,et al.
Scheduling/rescheduling in the manufacturing operating system environment†
,
1985
.
[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.
Match-up real-time scheduling
,
1985
.