An FPTAS for scheduling a two-machine flowshop with one unavailability interval
From MaRDI portal
Publication:3156725
DOI10.1002/nav.10107zbMath1054.90040OpenAlexW2026470718MaRDI QIDQ3156725
No author found.
Publication date: 11 January 2005
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.10107
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (17)
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 ⋮ An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint ⋮ An improved algorithm for the two machine flow shop problem with several availability constraints ⋮ 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 ⋮ Approximation results for flow shop scheduling problems with machine availability constraints ⋮ A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints ⋮ A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint ⋮ 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 ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics ⋮ Optimality of Jackson's permutations with respect to limited machine availability
Cites Work
This page was built for publication: An FPTAS for scheduling a two-machine flowshop with one unavailability interval
