Flow shop with job-dependent buffer requirements -- a polynomial-time algorithm and efficient heuristics
From MaRDI portal
Publication:2181771
DOI10.1007/978-3-030-22629-9_24zbMath1439.90035OpenAlexW2952171133MaRDI QIDQ2181771
Alexander Kononov, Julia Memar, Yakov Zinder
Publication date: 19 May 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-22629-9_24
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements ⋮ A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements
This page was built for publication: Flow shop with job-dependent buffer requirements -- a polynomial-time algorithm and efficient heuristics
