Local Search in Complex Scheduling Problems.

Autor: Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Pandu Rangan, C., Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Stützle, Thomas, Birattari, Mauro, H. Hoos, Holger, Urlings, Thijs, Ruiz, Rubén
Zdroj: Engineering Stochastic Local Search Algorithms. Designing, Implementing & Analyzing Effective Heuristics; 2007, p202-206, 5p
Abstrakt: 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. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index