A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints

DOI10.1007/s11590-011-0281-7zbMath1252.90023OpenAlexW2002962759MaRDI QIDQ691393

Hatem Hadda

Publication date: 30 November 2012

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

Full work available at URL: https://doi.org/10.1007/s11590-011-0281-7

zbMATH Keywords

schedulingflow shopapproximation schemeavailability constraint

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Related Items (5)

A PTAS for non-resumable open shop scheduling with an availability constraint ⋮ A study on integration of lot sizing and flow shop lot streaming problems ⋮ 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 the two-machine job shop under limited machine availability

Cites Work

• An improved algorithm for the two machine flow shop problem with several availability constraints
• A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
• Approximation results for flow shop scheduling problems with machine availability constraints
• An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
• Two-machine flowshop scheduling with availability constraints
• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
• An improved heuristic for two-machine flowshop scheduling with an availability constraint
• 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
• Encyclopedia of Optimization
• Two-machine flow shops with limited machine availability

This page was built for publication: A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints