Matchup scheduling with multiple resources, release dates and disruptions

Matchup scheduling with multiple resources, release dates and disruptions

0.00 Avg rating0 Votes
Article ID: iaor1993982
Country: United States
Volume: 39
Issue: 3
Start Page Number: 470
End Page Number: 482
Publication Date: May 1991
Journal: Operations Research
Authors: , , ,
Keywords: programming: integer
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. The authors also explore the solution of the matchup scheduling problem and show the advantages of an integer programming approach for allocating resources to jobs.

Reviews

Required fields are marked *. Your email address will not be published.