A ( 43)-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints

DOI10.1007/S11590-009-0137-6MaRDI QIDQ732786zbMATH OpenOpenAlexFDO

Authors 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

approximation algorithmserror boundflow shop schedulingavailability constraint

Mathematics Subject Classification ID

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

Recommendations

• A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints
• An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
• \(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints
• An improved algorithm for the two machine flow shop problem with several availability constraints
• A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
• An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
• Approximation results for flow shop scheduling problems with machine availability constraints
• Approximability of two-machine no-wait flowshop scheduling with availability constraints.
• Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
• Two-machine flow shop problems with availability constraints

Cites work

• An FPTAS for scheduling a two-machine flowshop with one unavailability interval
• An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
• An improved heuristic for two-machine flowshop scheduling with an availability constraint
• Approximation results for flow shop scheduling problems with machine 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
• Optimal two- and three-stage production schedules with set-up time included
• Two-machine flow shops with limited machine availability
• Two-machine flowshop scheduling with availability constraints
• Two-machine flowshop scheduling with consecutive availability constraints

Cited in

(11)

• A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints
• Scheduling jobs with truncated exponential learning functions
• Single-machine scheduling with nonlinear deterioration
• An improved algorithm for the two machine flow shop problem with several availability constraints
• Optimal due-date assignment problem with learning effect and resource-dependent processing times
• Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
• \(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints
• A PTAS for a particular case of the two-machine flow shop with limited machine availability
• The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis
• Approximation results for the two-machine job shop under limited machine availability
• An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732786)