Solving the flow shop problem by parallel programming
- 1 May 2009
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 69 (5) , 470-481
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Some aspects of scatter search in the flow-shop problemEuropean Journal of Operational Research, 2006
- Sequential and Parallel Path-Relinking Algorithms for the Quadratic Assignment ProblemIEEE Intelligent Systems, 2005
- Heterogeneous Computing and Parallel Genetic AlgorithmsJournal of Parallel and Distributed Computing, 2002
- Fast parallel heuristics for the job shop scheduling problemComputers & Operations Research, 2002
- New block properties for the permutation flow shop problem with application in tabu searchJournal of the Operational Research Society, 2001
- Genetic Algorithms, Path Relinking, and the Flowshop Sequencing ProblemEvolutionary Computation, 1998
- A fast tabu search algorithm for the permutation flow-shop problemEuropean Journal of Operational Research, 1996
- Parallel Taboo Search Techniques for the Job Shop Scheduling ProblemINFORMS Journal on Computing, 1994
- Benchmarks for basic scheduling problemsEuropean Journal of Operational Research, 1993
- Robust taboo search for the quadratic assignment problemParallel Computing, 1991