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)

Volumn 3019, Issue , 2004, Pages 566-571

  Bozejko, Wojciech ^a   Wodecki, Mieczysław ^b  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; GENETIC ALGORITHMS;

COMPLETION TIME; FLOW SHOP SCHEDULING PROBLEM; ISLAND MODEL; PARALLEL GENETIC ALGORITHMS; PERMUTATION FLOW SHOPS; SEQUENCING PROBLEMS;

MACHINE SHOP PRACTICE;

EID: 33746224749     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24669-5_74     Document Type: Article

References (12)

1. Bożejko W., Wodecki M., Solving the flow shop problem by parallel tabu search, IEEE Computer Society, PR01730 ISBN 0-7695-1730-7, (2002), 189-194.
2. Bożejko W., Wodecki M., Parallel algorithm for some single machine scheduling problems, Automatics vol. 134, (2002), 81-90.
3. Bubak M., Sowa M., Object-oriented implementation of parallel genetic algorithms, in High Performance Cluster Computing: Programming and Applications (R. Buyya, ed.), vol. 2, Prentice Hall, (1999), 331-349.
4. Goldberg D., Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Publishing Company, Inc., Massachusetts, 1989.
5. Grabowski J., Pempera J., New block properties for the permutation flow-shop problem with application in TS, Jour. of Oper. Res. Soc. 52, (2001), 210-220.
6. Holland J.H., Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence, University of Michigan Press, 1975.
7. Nowicki E., Smutnicki C., A fast tabu search algorithm for the permutation flow shop problem, EJOR 91 (1996), 160-175.
8. OR-Library: http://mscmga.ms.ic.ac.uk/info.html
9. Reeves C. R., Yamada T., Solving the Csum Permutation Flowshop Scheduling Problem by Genetic Local Search, IEEE International Conference on Evolutionary Computation, (1998), 230-234.
10. Taillard E., Benchmarks for basic scheduling problems, EJOR 64, (1993), 278-285.
11. i scheduling problems, EJOR (1997), 636-644.
12. Wodecki M., Bożejko W., Solving the flow shop problem by parallel simulated annealing, LNCS No. 2328, Springer Verlag, (2002), 236-247.