论文信息 - Parallel Genetic Algorithm for the Flow Shop Scheduling Problem

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 [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.

Wojciech Bozejko | Mieczyslaw Wodecki

[1] Jean-Marie Proth,et al. Heuristic approaches for n/m/F/ ∑Ci scheduling problems , 1997 .

[2] J. Grabowski,et al. New block properties for the permutation flow shop problem with application in tabu search , 2001, J. Oper. Res. Soc..

[3] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .

[4] E. Nowicki,et al. A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[5] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[6] Wojciech Bozejko,et al. Solving the Flow Shop Problem by Parallel Simulated Annealing , 2001, PPAM.

[7] M. Wodecki,et al. Parallet algorithm for some single machine scheduling problems , 2002 .

[8] T. Yamada,et al. Solving the C/sub sum/ permutation flowshop scheduling problem by genetic local search , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[9] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[10] Wojciech Bozejko,et al. Solving the flow shop problem by parallel tabu search , 2002, Proceedings. International Conference on Parallel Computing in Electrical Engineering.