Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
From MaRDI portal
Publication:3423261
DOI10.1002/nav.20122zbMath1112.90028MaRDI QIDQ3423261
Günter Schmidt, Mikhail A. Kubzin, Joachim Breit, Vitaly A. Strusevich
Publication date: 20 February 2007
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20122
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Cites Work