Approximation results for flow shop scheduling problems with machine availability constraints
From MaRDI portal
Publication:954036
DOI10.1016/j.cor.2007.10.013zbMath1179.90140OpenAlexW2030182609MaRDI QIDQ954036
Mikhail A. Kubzin, Vitaly A. Strusevich, Chris N. Potts
Publication date: 7 November 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/149837/1/LimAvailE-Prints.pdf
Related Items (19)
A PTAS for non-resumable open shop scheduling with an availability constraint ⋮ Mixed integer programming formulations for two-machine flow 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 ⋮ Two-machine flow shop scheduling with an operator non-availability period to minimize makespan ⋮ Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem ⋮ An improved algorithm for the two machine flow shop problem with several availability constraints ⋮ Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown ⋮ The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis ⋮ A PTAS for a particular case of the two-machine flow shop with limited machine availability ⋮ A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints ⋮ Flow shops with machine maintenance: ordered and proportionate cases ⋮ Two-machine flow shop and open shop scheduling problems with a single maintenance window ⋮ Two-machine flow shop scheduling integrated with preventive maintenance planning ⋮ Approximation results for the two-machine job shop under limited machine availability ⋮ A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints ⋮ MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS ⋮ Exponential inapproximability and FPTAS for scheduling with availability constraints ⋮ On-line and semi-online scheduling for flow shop problems on two machines
Cites Work
- Unnamed Item
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- Makespan minimization in open shops: A polynomial time approximation scheme
- Two-machine flowshop scheduling with availability constraints
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Non-preemptive two-machine open shop scheduling with non-availability constraints
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- Two-machine flowshop scheduling with consecutive availability constraints
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
- Machine scheduling with an availability constraint
- Optimal two- and three-stage production schedules with setup times included
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- Two-machine flow shops with limited machine availability
This page was built for publication: Approximation results for flow shop scheduling problems with machine availability constraints
