Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems
| Area d'investigacio: | Articulos | Any: | 2010 | ||||
|---|---|---|---|---|---|---|---|
| Tipus de publicacio: | Articul | Paraules clau: | hybrid,flexible,flowline,realistic,scheduling | ||||
| Autors: | Urlings, Thijs; Ruiz, Rubén; Serifoglu, Funda Sivrikaya | ||||||
| Revista: | International Journal of Metaheuristics | Volum: | 1 | ||||
| Número: | 1 | Pagines: | 30-54 | ||||
| Abstract: | This paper introduces some advanced genetic algorithms for a complex
hybrid flexible flow line problem with makespan objective that
was recently formulated. 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. This combination of constraints captures many
real-world industrial problems; among those the ceramic tile production
that served us as inspiration. The introduced algorithms employ
solution representation schemes with different degrees of
directness. Several new machine assignment rules are introduced and
implemented in some proposed genetic algorithms. The different genetic
algorithms are compared among each other and to some heuristics. The
results indicate that simple solution representation schemes result
in the best performance, even for complex scheduling problems, and
that the genetic algorithms lead to a better solution quality than
all tested heuristics. |
||||||
| Versio digital | |||||||