32-approximation for two-machine no-wait flowshop scheduling with availability constraints

DOI10.1016/J.IPL.2003.08.002MaRDI QIDQ1029003zbMATH OpenOpenAlexFDO

Authors Zhaohui Liu, T. C. Edwin Cheng

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

zbMATH Keywords

approximation algorithmsscheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• Approximability of two-machine no-wait flowshop scheduling with availability constraints.
• Two-machine flow shop no-wait scheduling with a nonavailability interval
• Approximation results for flow shop scheduling problems with machine availability constraints
• An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
• A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints

Cites work

• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• 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

Cited in

(8)

• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
• Approximability of two-machine no-wait flowshop scheduling with availability constraints.
• A survey of scheduling problems with no-wait in process
• Minimizing the makespan in the no-wait flexible flowshop problem with availability constraint
• Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
• A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
• Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
• Approximation results for flow shop scheduling problems with machine availability constraints

This page was built for publication: \(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints

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