A high quality solution constructive heuristic for flow shop sequencing
From MaRDI portal
Publication:4656763
DOI10.1057/palgrave.jors.2601466zbMath1139.90344MaRDI QIDQ4656763
João Vitor Moccellin, Marcelo Seido Nagano
Publication date: 14 March 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.2601466
Related Items
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem, Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems, An improved NEH-based heuristic for the permutation flowshop problem, A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times, A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation, Parallel hybrid heuristics for the permutation flow shop problem, An improved NEH heuristic to minimize makespan in permutation flow shops