A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- 30 September 2004
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 31 (11), 1891-1909
- https://doi.org/10.1016/s0305-0548(03)00145-x
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- 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
- Modified simulated annealing algorithms for the flow shop sequencing problemEuropean Journal of Operational Research, 1995
- On the heuristic solution of the permutation flow shop problem by path algorithmsComputers & Operations Research, 1993
- Benchmarks for basic scheduling problemsEuropean Journal of Operational Research, 1993
- The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problemComputers & Operations Research, 1990
- Some efficient heuristic methods for the flow shop sequencing problemEuropean Journal of Operational Research, 1990
- Simulated annealing for permutation flow-shop schedulingOmega, 1989
- A new heuristic method for the flow shop sequencing problemEuropean Journal of Operational Research, 1989