Abstract
In this paper different local search procedures are applied to a genetic algorithm for a complex hybrid flexible flow line problem. General precedence constraints among jobs are taken into account, as are machine release dates, time lags and sequence dependent setup times; both anticipatory and non-anticipatory. Although closely connected to real-world problems, this combination of constraints is hardly treated in the literature. This paper presents a study of the behaviour of local search for such a complex problem. A combination of the local search variants is presented. Comprehensive statistical experiments indicate that substantial improvements in solution quality can be reached.
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.
References
Ruiz, R., Sivrikaya Şerifoğlu, F., Urlings, T.: Modeling realistic hybrid flexible flowshop scheduling problems. Computers and Operations Research (in press)
Taillard, E.: Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47, 65–74 (1990)
Urlings, T., Ruiz, R., Sivrikaya Şerifoğlu, F.: Genetic algorithms for complex hybrid flexible flow line problems. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad. Universidad Politécnica de Valencia, Technical Report DEIOAC-2007-02 (March 2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Urlings, T., Ruiz, R. (2007). Local Search in Complex Scheduling Problems. In: Stützle, T., Birattari, M., H. Hoos, H. (eds) Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics. SLS 2007. Lecture Notes in Computer Science, vol 4638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74446-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-74446-7_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74445-0
Online ISBN: 978-3-540-74446-7
eBook Packages: Computer ScienceComputer Science (R0)