Evaluating the performance of tabu search procedures for flow shop sequencing

DOI10.1057/PALGRAVE.JORS.2600633zbMath1140.90407OpenAlexW2015144012MaRDI QIDQ3157811

João Vitor Moccellin, Marcelo Seido Nagano

Publication date: 19 January 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600633

zbMATH Keywords

heuristicstabu searchflow shop sequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Comparison of Tabu/2-opt heuristic and optimal tree search method for assignment problems ⋮ A new lower bounding rule for permutation flow shop scheduling

This page was built for publication: Evaluating the performance of tabu search procedures for flow shop sequencing