Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 43, Issue 15, Pages 3231-3246Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207540500103953
Keywords
rescheduling; schedule nervousness; parallel machine scheduling
Ask authors/readers for more resources
Nervousness in machine assignments during rescheduling can cause problems for the implementation of a scheduling system. This paper examines rescheduling due to the arrival of new jobs to the system. Parallel machine scheduling problems with stepwise increasing tardiness cost objectives, non-zero machine ready times, constraints that limit machine reassignments, and machine reassignment costs are considered. Simulation experiments and individual scheduling problems indicate that nervousness can be controlled at a low cost in some parallel machine scheduling environments. The rescheduling problems in the simulation are solved with a branch-and-price algorithm. Significant gains in schedule stability can be achieved by selecting the alternative optimal solution with the fewest machine reassignments.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available