\(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints
From MaRDI portal
Publication:1029003
DOI10.1016/j.ipl.2003.08.002zbMath1178.68098OpenAlexW1492534264MaRDI QIDQ1029003
Zhaohui Liu, Cheng, T. C. Edwin
Publication date: 9 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/473
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items
Heuristics for two-machine flowshop scheduling with setup times and an availability constraint ⋮ A survey of scheduling problems with no-wait in process ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
Cites Work
- Approximability of two-machine no-wait flowshop scheduling with availability constraints.
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
