Efficient approximation algorithms for the routing open shop problem
From MaRDI portal
Publication:340238
DOI10.1016/J.COR.2012.01.006zbMath1349.90330OpenAlexW1979032346MaRDI QIDQ340238
Ilya Chernykh, Alexander V. Kononov, Sergey Sevast'janov
Publication date: 14 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.01.006
Related Items (8)
Exponential tightness for integral-type functionals of centered independent differently distributed random variables ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Irreducible bin packing and normality in routing open shop ⋮ Completing Partial Schedules for Open Shop with Unit Processing Times and Routing ⋮ A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing ⋮ O(log m)-approximation for the routing open shop problem ⋮ Two-machine routing open shop: How long is the optimal makespan?
This page was built for publication: Efficient approximation algorithms for the routing open shop problem
