A branch and bound algorithm for the flow-shop scheduling problem
From MaRDI portal
Publication:3108361
DOI10.1007/BFB0105939zbMath1229.90272OpenAlexW1636774009MaRDI QIDQ3108361
Publication date: 2 January 2012
Published in: Dynamical Systems, Plasmas and Gravitation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0105939
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
This page was built for publication: A branch and bound algorithm for the flow-shop scheduling problem