Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
From MaRDI portal
Publication:3423261
DOI10.1002/NAV.20122zbMath1112.90028OpenAlexW2041878423MaRDI 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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
A PTAS for non-resumable open shop scheduling with an availability constraint ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Open shop scheduling problem with a non-resumable flexible maintenance period ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Two-machine flow shop and open shop scheduling problems with a single maintenance window
Cites Work
This page was built for publication: Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
