Minimizing makespan on a two-machine re-entrant flowshop
From MaRDI portal
Publication:5428997
DOI10.1057/palgrave.jors.2602220zbMath1178.90146OpenAlexW2789433658MaRDI QIDQ5428997
No author found.
Publication date: 29 November 2007
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.2602220
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (10)
Three-machine flow shop scheduling with overlapping waiting time constraints ⋮ Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times ⋮ Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times ⋮ Algorithms for a two‐machine flowshop problem with jobs of two classes ⋮ Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem ⋮ Minimizing total completion time for re-entrant flow shop scheduling problems ⋮ Heuristic algorithms for two machine re-entrant flow shop ⋮ Minimizing makespan on an \(m\)-machine re-entrant flowshop ⋮ Flow shops with reentry: reversibility properties and makespan optimal schedules ⋮ Minimizing total tardiness on a two-machine re-entrant flowshop
This page was built for publication: Minimizing makespan on a two-machine re-entrant flowshop
