One machine rescheduling heuristics with efficiency and stability as criteria

One machine rescheduling heuristics with efficiency and stability as criteria

0.00 Avg rating0 Votes
Article ID: iaor19931781
Country: United Kingdom
Volume: 20
Issue: 1
Start Page Number: 1
End Page Number: 14
Publication Date: Jan 1993
Journal: Computers and Operations Research
Authors: , ,
Keywords: heuristics
Abstract:

Heuristics for the problem of rescheduling a machine on occurrence of an unforeseen disruption are developed. The criteria include minimization of the makespan (schedule efficiency) and the impact of the schedule change (schedule stability). The impact of schedule change is a non-regular performance measure defined in two ways: (1) the starting time deviations between the new schedule and the original schedule, and (2) a measure of the sequence difference between the two schedules. Three local search procedures are developed for the bicriterion problem and a set of experiments are conducted to test the efficacy of the heuristics. The heuristic solutions are shown to be effective in that the schedule stability can be increased significantly with little or no sacrifice in makespan.

Reviews

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