Heuristics for two-machine flowshop scheduling with setup times and an availability constraint

DOI10.1016/j.cor.2005.05.003zbMath1109.90046OpenAlexW2147010739MaRDI QIDQ850314

Xiuli Wang, Cheng, T. C. Edwin

Publication date: 15 November 2006

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

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

zbMATH Keywords

heuristicserror boundflowshop scheduling

Mathematics Subject Classification ID

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

Related Items

The third comprehensive survey on scheduling problems with setup times/costs ⋮ Two-machine flow shop scheduling with an operator non-availability period to minimize makespan ⋮ Makespan minimization for two parallel machines scheduling with a periodic availability constraint ⋮ A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

Cites Work

• \(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints
• Machine scheduling with availability constraints
• Two-machine flowshop 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.
• Minimizing the makespan for the flow shop scheduling problem with availability constraints.
• An improved heuristic for two-machine flowshop scheduling with an availability constraint
• Two-machine flowshop scheduling with consecutive availability constraints
• Scheduling with limited machine availability
• An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
• Sequency on two and three machines with setup, processing and removal times separated