Abstract
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∥Csum, 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. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Bozejko, W., & Wodecki, M. (2004). Parallel genetic algorithm for the flow shop scheduling problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3019, 566–571. https://doi.org/10.1007/978-3-540-24669-5_74
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
