Affiliation:
1. Shanghai Ocean University
2. North China Electric Power University
Abstract
In this study, we address a rescheduling problem in parallel machine environments under machines failures. To make a balance between efficiency and stability of the reschedules, we consider the total number of tardy jobs as efficiency measure and the number of jobs processed on different machines in the initial and revised schedules as a stability measure. Then a heuristic algorithm which synthesizes beam search (BS) and repair-based constraint satisfaction algorithm is developed. Numerical experiments are processed to evaluate the performance and efficiency of the proposed algorithm. The experimental results show that the proposed algorithm improves the results significantly.
Publisher
Trans Tech Publications, Ltd.
Reference15 articles.
1. J. C. Bean, J. R. Birge, J. Mittenthal, et al., Matchup scheduling with multiple resources, release dates and disruptions, Operations Research, vol. 39, 3, 1991, pp.470-483.
2. S. D. Wu, R. H. Storer, and P. C. Chang, One-machine rescheduling heuristics with efficiency and stability as criteria, Computers and Operations Research, vol. 20, 1, 1993, pp.1-14.
3. I. Sabuncuoglu and M. Bayiz, Analysis of reactive scheduling problems in a job shop environment, European Journal of Operational Research, vol. 126, 3, 2000, pp.567-586.
4. C. Shangguan, H. Zhou, R. Shi, et al., Flow shop rescheduling problem and its improved repair-based constraint satisfaction algorithm, Computer Integrated Manufacturing Systems, vol. 14, 009, 2008, pp.1742-1751.
5. M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Second edition ed. Upper Saddle, New Jersey: Prentice-Hall, (2002).
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献