Local Search in Complex Scheduling Problems
- 595 Downloads
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.
KeywordsLocal Search Precedence Constraint Local Search Procedure Relative Percentage Deviation Sequence Dependent Setup Time
Unable to display preview. Download preview PDF.
- 1.Ruiz, R., Sivrikaya Şerifoğlu, F., Urlings, T.: Modeling realistic hybrid flexible flowshop scheduling problems. Computers and Operations Research (in press)Google Scholar
- 3.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)Google Scholar