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
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.