A PTAS for a particular case of the two-machine flow shop with limited machine availability
From MaRDI portal
Publication:483257
DOI10.1007/s10852-013-9245-5zbMath1302.90082OpenAlexW2062489152MaRDI QIDQ483257
Publication date: 16 December 2014
Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-013-9245-5
Related Items (2)
A PTAS for non-resumable open shop scheduling with an availability constraint ⋮ Approximation results for the two-machine job shop under limited machine availability
Cites Work
- Unnamed Item
- An improved algorithm for the two machine flow shop problem with several availability constraints
- A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints
- A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
- Approximation results for flow shop scheduling problems with machine availability constraints
- An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- Two-machine flowshop scheduling with availability constraints
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Scheduling two-stage hybrid flow shop with availability constraints
- Optimal two- and three-stage production schedules with setup times included
- Existence results for impulsive semilinear fractional differential inclusions with delay in Banach spaces
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- The Complexity of Flowshop and Jobshop Scheduling
- Short Shop Schedules
- Two-machine flow shops with limited machine availability
This page was built for publication: A PTAS for a particular case of the two-machine flow shop with limited machine availability
