Skip to main content

2004 | OriginalPaper | Buchkapitel

Parallel Genetic Algorithm for the Flow Shop Scheduling Problem

verfasst von : Wojciech Bożejko, Mieczysław Wodecki

Erschienen in: Parallel Processing and Applied Mathematics

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

The permutation flow shop sequencing problem with the objective of minimizing the sum of the job’s completion times, in literature known as the F||C sum , has been considered. The parallel genetic algorithm based on the island model of migration has been presented. By computer simulations on Taillard benchmarks [10] and the best known results from literature [9] we have obtained not only acceleration of the computation’s time but also better quality and stability of the results.

Metadaten
Titel
Parallel Genetic Algorithm for the Flow Shop Scheduling Problem
verfasst von
Wojciech Bożejko
Mieczysław Wodecki
Copyright-Jahr
2004
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-540-24669-5_74

Premium Partner