O(log m)-approximation for the routing open shop problem
RAIRO-Oper. Res., 49 2 (2015) 383-391
Published online: 2015-01-19
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Complexity and approximation of open shop scheduling to minimize the makespan: A review of models and approaches
Vitaly A. StrusevichComputers & Operations Research 144 105732 (2022)
https://doi.org/10.1016/j.cor.2022.105732
Four decades of research on the open-shop scheduling problem to minimize the makespan
Mohammad Mahdi Ahmadian, Mostafa Khatami, Amir Salehipour and T.C.E. ChengEuropean Journal of Operational Research 295 (2) 399 (2021)
https://doi.org/10.1016/j.ejor.2021.03.026
A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
Antonina P. Khramova and Ilya ChernykhJournal of Scheduling 24 (4) 405 (2021)
https://doi.org/10.1007/s10951-021-00694-7
Irreducible bin packing and normality in routing open shop
Ilya Chernykh and Artem PyatkinAnnals of Mathematics and Artificial Intelligence 89 (8-9) 899 (2021)
https://doi.org/10.1007/s10472-021-09759-x
Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass
I. D. Chernykh and E. V. LgotinaOptimization Methods and Software 36 (4) 821 (2021)
https://doi.org/10.1080/10556788.2020.1734802
Optimization and Applications
Ilya Chernykh and Olga KrivonogovaCommunications in Computer and Information Science, Optimization and Applications 1145 1 (2020)
https://doi.org/10.1007/978-3-030-38603-0_1
Computer Science – Theory and Applications
René van Bevern and Artem V. PyatkinLecture Notes in Computer Science, Computer Science – Theory and Applications 9691 73 (2016)
https://doi.org/10.1007/978-3-319-34171-2_6