Improved Approximation Algorithms for Routing Shop Scheduling

DOI10.1007/978-3-642-25591-5_5MaRDI QIDQ3104596zbMATH OpenOpenAlexFDO

Authors Wei Yu, Guochuan 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) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Improved Approximation Algorithms for Shop Scheduling Problems
• Efficient approximation algorithms for the routing open shop problem
• The Routing Open Shop Problem: New Approximation Algorithms
• Improved approximation algorithms for two-stage flowshops scheduling problem
• scientific article; zbMATH DE number 1445389
• Approximation algorithms for shop scheduling problems with minsum objective
• Improved Bounds for Flow Shop Scheduling
• Improved approximation algorithms for two-stage flexible flow shop scheduling
• Better approximation guarantees for job-shop scheduling
• Improved approximation algorithms for min-max and minimum vehicle routing problems

Cited in

(8)

• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Irreducible bin packing and normality in routing open shop
• Efficient approximation algorithms for the routing open shop problem
• The Routing Open Shop Problem: New Approximation Algorithms
• Routing open shop and flow shop scheduling problems
• A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
• \(O(\log m)\)-approximation for the routing open shop problem
• An exact solution with an improved running time for the routing flow shop problem with two machines

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

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