Matchup Scheduling with Multiple Resources, Release Dates and Disruptions

James C. Bean, John Birge, John Mittenthal and Charles E. Noon
Additional contact information
James C. Bean: The University of Michigan, Ann Arbor, Michigan
John Mittenthal: Rensselaer Polytechnic Institute, Troy, New York
Charles E. Noon: University of Tennessee, Knoxville, Tennessee

Operations Research, 1991, vol. 39, issue 3, 470-483

Abstract: This paper considers the rescheduling of operations with release dates and multiple resources when disruptions prevent the use of a preplanned schedule. The overall strategy is to follow the preschedule until a disruption occurs. After a disruption, part of the schedule is reconstructed to match up with the preschedule at some future time. Conditions are given for the optimality of this approach. A practical implementation is compared with the alternatives of preplanned static scheduling and myopic dynamic scheduling. A set of practical test problems demonstrates the advantages of the matchup approach. We also explore the solution of the matchup scheduling problem and show the advantages of an integer programming approach for allocating resources to jobs.

Keywords: production/scheduling: approximations; heuristic; applications: programming; infinite dimensional (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (31)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.39.3.470 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:39:y:1991:i:3:p:470-483

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().