Solving the flow shop problem by parallel programming

Journal of Parallel and Distributed Computing

Volumn 69, Issue 5, 2009, Pages 470-481

  Bozejko, Wojciech ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Flow shop problem; Parallel algorithm; PRAM

Indexed keywords

COMPUTATIONAL EXPERIMENTS; CONCENTRATED SOLUTIONS; CRITERION FUNCTIONS; FLOW SHOP PROBLEM; FLOW SHOPS; META-HEURISTIC; META-HEURISTIC APPROACHES; NP-HARD PROBLEMS; PARALLEL-COMPUTING ENVIRONMENTS; PARALLELIZING; PRAM;

COMBINATORIAL OPTIMIZATION; HEURISTIC METHODS; MACHINE SHOP PRACTICE; PARALLEL PROCESSING SYSTEMS; PARALLEL PROGRAMMING; SCHEDULING ALGORITHMS;

PARALLEL ALGORITHMS;

EID: 64049085160     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2009.01.009     Document Type: Article

References (16)

1. Alba E. Parallel Metaheuristics. A New Class of Algorithms (2005), Wiley
2. Alba E., Nebro A.J., and Troya J.M. Heterogeneous computing and parallel genetic algorithms. Journal of Parallel and Distributed Computing 62 (2002) 1362-1385
3. Bożejko W., and Wodecki M. Parallel genetic algorithm for minimizing total weighted completion time. Lecture Notes in Computer Science vol. 3070 (2004), Springer 400-405
4. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms (1990), MIT Press and McGraw-Hill
5. Crainic T.G., and Toulouse M. Parallel strategies for meta-heuristics. In: Glover F., and Cochenberger G. (Eds). Handbook of Metaheuristics (2003), Kluwer Academic Publishers, Norwell, MA 475-514
6. Grabowski J., and Pempera J. New block properties for the permutation flow shop problem with application in tabu search. Journal of Operational Research Society 52 (2000) 210-220
7. James T., Rego C., and Glover F. Sequential and parallel path-relinking algorithms for the quadratic assignment problem. IEEE Intelligent Systems 20 4 (2005) 58-65
8. Nowicki E., and Smutnicki C. A fast tabu search algorithm for the permutation flow shop problem. European Journal of Operational Research 91 (1996) 160-175
9. Nowicki E., and Smutnicki C. Some aspects of scatter search in the flow-shop problem. European Journal of Operational Research 169 (2006) 654-666
10. OR-Library: http://people.brunel.ac.uk/~mastjjb/jeb/info.html
11. Reeves C.R., and Yamada T. Genetic algorithms, path relinking and the flowshop sequencing problem. Evolutionary Computation 6 (1998) 45-60
12. Steinhöfel K., Albrecht A., and Wong C.K. Fast parallel heuristics for the job shop scheduling problem. Computers and Operations Research 29 (2002) 151-169
13. Taillard E. Robust taboo search for the quadratic assignment problem. Parallel Computing 17 (1991) 443-455
14. Taillard E. Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing 6 (1994) 108117
15. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
16. i scheduling problems. European Journal of Operational Research (1997) 636-644