Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
DOI10.1002/NAV.20122zbMATH Open1112.90028OpenAlexW2041878423MaRDI QIDQ3423261FDOQ3423261
Authors: Mikhail A. Kubzin, Joachim Breit, Günter Schmidt, V. 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
Recommendations
- Non-preemptive two-machine open shop scheduling with non-availability constraints
- Two-machine open shop scheduling with an availability constraint
- A PTAS for non-resumable open shop scheduling with an availability constraint
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
- A fully polynomial time approximation scheme for makespan minimization problems on two machines with a fixed non-availability interval
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
Cited In (13)
- A PTAS for non-resumable open shop scheduling with an availability constraint
- A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
- Two-machine flow shop and open shop scheduling problems with a single maintenance window
- Two-machine open shop scheduling with an availability constraint
- Open shop scheduling problem with a non-resumable flexible maintenance period
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint
- A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
- A fully polynomial time approximation scheme for makespan minimization problems on two machines with a fixed non-availability interval
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
- Non-preemptive two-machine open shop scheduling with non-availability constraints
This page was built for publication: Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3423261)
