An FPTAS for scheduling a two-machine flowshop with one unavailability interval
From MaRDI portal
Publication:3156725
DOI10.1002/nav.10107zbMath1054.90040MaRDI 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
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
Related Items
Optimality of Jackson's permutations with respect to limited machine availability, 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, 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, Two-machine flow shop and open shop scheduling problems with a single maintenance window, A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints, An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint, Approximation results for flow shop scheduling problems with machine availability constraints, Flow shops with machine maintenance: ordered and proportionate cases, Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics, Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint, Approximation results for the two-machine job shop under limited machine availability, 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, A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint, Two-machine flow shop scheduling integrated with preventive maintenance planning
Cites Work
