An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint

DOI10.1016/J.COR.2005.11.019zbMath1185.90100OpenAlexW2093732902MaRDI QIDQ878557

Xiuli Wang, Cheng, T. C. Edwin

Publication date: 26 April 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10397/1081

zbMATH Keywords

flowshop schedulingapproximation schemeavailability constraint

Mathematics Subject Classification ID

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

Related Items (4)

The third comprehensive survey on scheduling problems with setup times/costs ⋮ Modeling and solving the flow-shop scheduling problem with sequence-dependent setup times by firefly algorithm (case study: automotive industry) ⋮ Batch-size-based rearrangement of the shop floor into mini-lines ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

Cites Work

• Machine scheduling with availability constraints
• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
• Current trends in deterministic scheduling
• Approximability of two-machine no-wait flowshop scheduling with availability constraints.
• An improved heuristic for two-machine flowshop scheduling with an availability constraint
• Scheduling with limited machine availability
• An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
• An FPTAS for scheduling a two-machine flowshop with one unavailability interval

This page was built for publication: An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint