An improved algorithm for the two machine flow shop problem with several availability constraints

DOI10.1007/s10288-010-0119-7zbMath1201.90075OpenAlexW2069307052MaRDI QIDQ607877

Hatem Hadda

Publication date: 6 December 2010

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-010-0119-7

zbMATH Keywords

heuristicsworst case analysisflow shop schedulingavailability constraintpolynomially solvable case

Mathematics Subject Classification ID

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

Related Items

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 ⋮ 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
• 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
• Two-machine flow shops with limited machine availability

This page was built for publication: An improved algorithm for the two machine flow shop problem with several availability constraints