A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints

DOI10.1007/s11590-009-0137-6zbMath1176.90218MaRDI QIDQ732786

Hatem Hadda

Publication date: 15 October 2009

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-009-0137-6

zbMATH Keywords

error bound; approximation algorithms; flow shop scheduling; availability constraint

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Scheduling jobs with truncated exponential learning functions, 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, Single-machine scheduling with nonlinear deterioration, Minimizing makespan in a two-machine flow shop with effects of deterioration and learning, Approximation results for the two-machine job shop under limited machine availability, Optimal due-date assignment problem with learning effect and resource-dependent processing times

Cites Work

• Approximation results for flow shop scheduling problems with machine availability constraints
• 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
• 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