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.90218OpenAlexW2058254191MaRDI 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 boundapproximation algorithmsflow shop schedulingavailability constraint

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

Scheduling jobs with truncated exponential learning functions ⋮ Optimal due-date assignment problem with learning effect and resource-dependent processing times ⋮ 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

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

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