Rescheduling for New Orders

• Published in: Operations research Vol. 52; no. 3; pp. 440 - 453
• Main Authors: Hall, Nicholas G, Potts, Chris N
• Format: Journal Article
• Language: English
• Published: Linthicum INFORMS 01.05.2004; Institute for Operations Research and the Management Sciences
• Subjects: Algorithms; Analysis; Cost efficiency; deterministic; Indexing; Integers; Machinery; Mathematical sequences; Minimization of cost; New order; Order processing; Preprocessing; Production planning; Production scheduling; Scheduling; Scheduling (Management); Scheduling algorithms; sequencing; single machine; Studies; United States
• ISSN: 0030-364X; 1526-5463
• DOI: 10.1287/opre.1030.0101

This paper considers scheduling problems where a set of original jobs has already been scheduled to minimize some cost objective, when a new set of jobs arrives and creates a disruption. The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it. Two classes of models are considered. First, we minimize the scheduling cost of all the jobs, subject to a limit on the disruption caused to the original schedule, where this disruption is measured in various ways. In the second class, a total cost objective, which includes both the original cost measure and the cost of disruption, is minimized. For both classes and various costs based on classical scheduling objectives, and for almost all problems, we provide either an efficient algorithm or a proof that such an algorithm is unlikely to exist. We also show how to extend both classes of models to deal with multiple disruptions in the form of repeated arrivals of new jobs. Our work refocuses the extensive literature on scheduling problems towards issues of rescheduling, which are important because of the frequency with which disruptions occur in manufacturing practice.