Disruption management for machine scheduling: The case of SPT schedules

This paper addresses the problem of updating a machine schedule when either a random or an anticipated disruption occurs after a subset of the jobs has been processed. In such cases, continuing with the original schedule is likely to be suboptimal and may not even be feasible. The approach taken her...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of production economics Vol. 103; no. 1; pp. 166 - 184
Main Authors Qi, Xiangtong, Bard, Jonathan F., Yu, Gang
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.09.2006
Elsevier
SeriesInternational Journal of Production Economics
Subjects
Disruption management
Dynamic programming
Machine scheduling
SPT rule
Machine scheduling
Disruption management
Dynamic programming
SPT rule
Online AccessGet full text

Cover

More Information
Summary:This paper addresses the problem of updating a machine schedule when either a random or an anticipated disruption occurs after a subset of the jobs has been processed. In such cases, continuing with the original schedule is likely to be suboptimal and may not even be feasible. The approach taken here differs from most rescheduling analysis in that the cost associated with the deviation between the original and the new schedule is included in the model. We concentrate on cases in which the shortest processing time (SPT) rule is optimal for the original problem. Both single and parallel two-machine environments are considered.
ISSN:0925-5273
1873-7579
DOI:10.1016/j.ijpe.2005.05.021