Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme

DOI10.1137/S0895480100370803zbMath1045.90034MaRDI QIDQ4443088

No author found.

Publication date: 8 January 2004

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmsshop scheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items

Some local search algorithms for no-wait flow-shop problem with makespan criterion ⋮ The minimum backlog problem ⋮ The Directed Minimum Latency Problem ⋮ A survey of scheduling problems with no-wait in process ⋮ Inapproximability results for no-wait job shop scheduling. ⋮ No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem ⋮ Permutation, no-wait, no-idle flow shop problems ⋮ SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS