Parallel scatter search algorithm for the flow shop sequencing problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4967 LNCS, Issue , 2008, Pages 180-188

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

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF WROC AW   (Poland)

Author keywords

Flow shop problem; Metaheuristics; Scatter search

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; EVOLUTIONARY ALGORITHMS; LEARNING ALGORITHMS; MACHINE SHOP PRACTICE; NUCLEAR PROPULSION; PAPER; SCHEDULING ALGORITHMS; STATISTICS; TREES (MATHEMATICS);

(N-1) CRITERION; APPLIED MATHEMATICS; FLOW SHOP PROBLEMS; FLOW SHOPS; HEIDELBERG (CO); INTERNATIONAL CONFERENCES; PARALLEL CALCULATIONS; PARALLEL PROCESSING; PARALLEL SCATTER SEARCH; SCATTER SEARCH METHOD; SEQUENCING PROBLEMS; SPRINGER (CO); STRONGLY NP HARD; SUPERLINEAR SPEEDUP;

PARALLEL ALGORITHMS;

EID: 45749083383     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68111-3_20     Document Type: Conference Paper

References (12)

1. Bożejko, W., Wodecki, M.: Solving the flow shop problem by parallel tabu search. In: Proceedings of PARELEC 2004, pp. 189-194. IEEE Computer Society, Los Alamitos (2004)
2. Bożejko, W., Wodecki, M.: Parallel genetic algorithm for the flow shop scheduling problem. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2004. LNCS, vol. 3019, pp. 566-571. Springer, Heidelberg (2004)
3. Bożejko, W., Wodecki, M.: A fast parallel dynasearch algorithm for some scheduling problems. In: Proceedings of PARELEC 2006, pp. 275-280. IEEE Computer Society, Los Alamitos (2006)
4. Grabowski, J., Pempera, J.: New block properties for the permutation flow-shop problem with application in TS. Journal of Operational Research Society 52, 210-220 (2001)
5. 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)
6. James, T., Rego, C., Glover, F.: Sequential and Parallel Path-Relinking Algorithms for the Quadratic Assignment Problem. IEEE Intelligent Systems 20(4), 58-65 (2005)
7. Liu, J.: A new heuristic algorithm for csum flowshop scheduling problems, Personal Communication (1997)
8. OR-Library: http://people.brunel.ac.uk/∼mastjjb/jeb/info.html
9. Reeves, C.R., Yamada, T.: Solving the Csum Permutation Flowshop Scheduling Problem by Genetic Local Search. In: IEEE International Conference on Evolutionary Computation, pp. 230-234 (1998)
10. Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278-285 (1993)
11. i scheduling problems. European Journal of Operational Research, 636-644 (1997)
12. Wodecki, M., Bożejko, W.: Solving the flow shop problem by parallel simulated annealing. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2001. LNCS, vol. 2328, pp. 236-247. Springer, Heidelberg (2002)