Rescheduling for new orders


Hall, Nicholas G. and Potts, Chris N. (2004) Rescheduling for new orders. Operations Research, 52, (3), 440-453. (doi:10.1287/opre.1030.0101).

Download

Full text not available from this repository.

Original Publication URL: http://dx.doi.org/10.1287/opre.1030.0101

Description/Abstract

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.

Item Type: Article
ISSNs: 0030-364X (print)
Related URLs:
Keywords: production/scheduling: sequencing, deterministic, single machine
Subjects: Q Science > QA Mathematics
Divisions: University Structure - Pre August 2011 > School of Mathematics > Operational Research
ePrint ID: 29625
Date Deposited: 11 May 2006
Last Modified: 27 Mar 2014 18:18
URI: http://eprints.soton.ac.uk/id/eprint/29625

Actions (login required)

View Item View Item