Parallel Genetic Algorithm for the Flow Shop Scheduling Problem

摘要

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 and the best known results from literature we have obtained not only acceleration of the computation's time but also better quality and stability of the results.