Improved Approximation Algorithms for Routing Shop Scheduling

DOI10.1007/978-3-642-25591-5_5zbMath1329.68296OpenAlexW1775891680MaRDI QIDQ3104596

Wei Yu, Guo-Chuan Zhang

Publication date: 16 December 2011

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25591-5_5

zbMATH Keywords

approximation algorithmflow shopopen shoprouting scheduling

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (3)

Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Irreducible bin packing and normality in routing open shop ⋮ O(log m)-approximation for the routing open shop problem

This page was built for publication: Improved Approximation Algorithms for Routing Shop Scheduling