An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs

DOI10.1007/s10288-009-0102-3zbMath1186.90050OpenAlexW2046510690MaRDI QIDQ972619

Hatem Hadda, Najoua Dridi, Sonia Hajri-Gabouj

Publication date: 21 May 2010

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

Full work available at URL: https://doi.org/10.1007/s10288-009-0102-3

zbMATH Keywords

flow shopworst case analysis

Mathematics Subject Classification ID

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

Related Items

A PTAS for non-resumable open shop scheduling with an availability constraint ⋮ Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint ⋮ Two-machine flow shop scheduling with an operator non-availability period to minimize makespan ⋮ Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem ⋮ An improved algorithm for the two machine flow shop problem with several availability constraints ⋮ 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

• The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis
• 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
• Scheduling two-stage hybrid flow shop with availability constraints
• Optimal two- and three-stage production schedules with setup times included

This page was built for publication: An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs