Abstract
This paper discusses the single-machine large-scale rescheduling problem with efficiency and stability as criteria, where more disruptions arise during the execution of schedule. A rolling strategy is driven by disruption events and the reactive partial rescheduling (PR) is adopted at each disruption. Two types of PR sub-problem are designed respectively for the procedural and the terminal PR-horizons. A local search algorithm is used to solve the PR sub-problems. Computational results show that the rolling PR can greatly improve the schedule stability with little sacrifice in schedule efficiency and consistently outperforms the rolling RSR.
Partly supported Science Research Foundation of Shandong University at Weihai (XZ2005001).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Sabuncuoglu, I., Bayiz, M.: Analysis of Reactive Scheduling Problems in A Job Shop Environment. European Journal of Operational Research 126, 567–586 (2000)
Wu, D.S., Storer, R.H., Chang, P.C.: One-Machine Rescheduling Heuristics with Efficiency and Stability as Criteria. Computers in Operations Research 20, 1–14 (1993)
Wang, B., Xi, Y.G., Gu, H.Y.: Terminal Penalty Rolling Scheduling Based on An Initial Schedule for Single-Machine Scheduling Problem. Computers and Operations Research 32, 3059–3072 (2005)
Garey, M.R., Johnson, D.S.: Computers Intractability. Freeman, San Francisico (1979)
Chu, C.B.: Efficient Heuristics to Minimize Total Flow Time with Release Dates. Operations Research Letters 12, 321–330 (1992)
Carlier, J.: The One-Machine Sequencing Problem. European Journal of Operational Research 11, 42–47 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, B., Liu, T. (2006). Rolling Partial Rescheduling with Efficiency and Stability Based on Local Search Algorithm. In: Huang, DS., Li, K., Irwin, G.W. (eds) Intelligent Computing. ICIC 2006. Lecture Notes in Computer Science, vol 4113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816157_114
Download citation
DOI: https://doi.org/10.1007/11816157_114
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37271-4
Online ISBN: 978-3-540-37273-8
eBook Packages: Computer ScienceComputer Science (R0)