A branch-and-bound-based local search method for the flow shop problem

DOI10.1057/palgrave.jors.2601612zbMath1095.90547OpenAlexW2073922730MaRDI QIDQ4661161

Talel Ladhari, Mohamed Haouari

Publication date: 4 April 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.2601612

zbMATH Keywords

branch and boundLocal searchflow shop sequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (12)

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 effective matheuristic for the capacitated total quantity discount problem ⋮ A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems ⋮ A proposal for a hybrid meta-strategy for combinatorial optimization problems ⋮ An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates ⋮ Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling ⋮ A computational study of the permutation flow shop problem based on a tight lower bound ⋮ Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods ⋮ Algorithms for a realistic variant of flowshop scheduling ⋮ Hybridizing exact methods and metaheuristics: a taxonomy ⋮ The nonpermutation flowshop scheduling problem: adjustment and bounding procedures

This page was built for publication: A branch-and-bound-based local search method for the flow shop problem