The Routing Open Shop Problem: New Approximation Algorithms

DOI10.1007/978-3-642-12450-1_7zbMath1284.68659OpenAlexW1535494809MaRDI QIDQ3558915

Ilya Chernykh, Alexander V. Kononov, Nikita Dryuck, Sergey Sevast'janov

Publication date: 11 May 2010

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12450-1_7

zbMATH Keywords

approximation algorithmworst-case analysisrouting open shop

Mathematics Subject Classification ID

Production models (90B30) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (1)

O(log m)-approximation for the routing open shop problem

This page was built for publication: The Routing Open Shop Problem: New Approximation Algorithms