Lower bounding schemes for flowshops with blocking in-process
From MaRDI portal
Publication:4658520
DOI10.1057/palgrave.jors.2601220zbMath1181.90125OpenAlexW2003685253MaRDI QIDQ4658520
Débora P. Ronconi, Vinicius Amaral Armentano
Publication date: 16 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.2601220
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items
Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking ⋮ Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems ⋮ Optimizing blocking flow shop scheduling problem with total completion time criterion ⋮ Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion ⋮ Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption ⋮ A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion ⋮ A three-phase algorithm for flowshop scheduling with blocking to minimize makespan ⋮ Scheduling manufacturing systems with blocking: a Petri net approach ⋮ A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems ⋮ An optimization-based heuristic for the robotic cell problem ⋮ A review of TSP based approaches for flowshop scheduling ⋮ A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
