|
|
|
|
Список литературы
|
|
| |
| 1. |
I. Averbakh, O. Berman, I. Chernykh, “A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network”, Eur. J. Oper. Res., 166:1 (2005), 3–24    |
| 2. |
I. Averbakh, O. Berman, I. Chernykh, “The routing open-shop problem on a network: complexity and approximation”, Eur. J. Oper. Res., 173:2 (2006), 531–539 |
| 3. |
I. Chernykh, Two-machine routing open shop: How long is the optimal makespan?, Mathematical optimization theory and operations research, 20th international conference, MOTOR 2021, Proceedings, Springer Lect. Notes Comput. Sci., 12755, eds. Pardalos Panos (ed.) et al., Springer, Cham, 2021, 253–266 |
| 4. |
I. Chernykh, A. Kononov, S. Sevastyanov, “Efficient approximation algorithms for the routing open shop problem”, Comput. Oper. Res., 40:3 (2013), 841–847 |
| 5. |
I. Chernykh, E. Lgotina, “The 2-machine routing open shop on a triangular transportation network”, Discrete optimization and operations research, 9th international conference, DOOR 2016, Proceedings (Vladivostok, Russia, September 19-23, 2016), Lecture Notes in Computer Science, 9869, eds. Kochetov Yury (ed.) et al., 2016, 284–297 |
| 6. |
I. Chernykh, A. Pyatkin, “Irreducible bin packing and normality in routing open shop”, Ann. Math. Artif. Intell., 89:8-9 (2021), 899–918 |
| 7. |
M. Garey, D. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman & Co., San Francisco, 1979 |
| 8. |
T. Gonzalez, S. Sahni, “Open shop scheduling to minimize finish time”, J. Assoc. Comput. Mach., 23 (1976), 665–679 |
| 9. |
A. Khramova, I. Chernykh, “A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing”, J. Sched., 24:4 (2021), 405–412 |
| 10. |
A. Kononov, “On the routing open shop problem with two machines on a two-vertex network”, J. Appl. Ind. Math., 6:3 (2012), 318–331 |
| 11. |
A Kononov, S. Sevastianov, I. Tchernykh, “When difference in machine loads leads to efficient scheduling in open shops”, Ann. Oper. Res., 92 (1999), 211–239 |
| 12. |
C. Koulamas, G. Kyparisis, “The three-machine proportionate open shop and mixed shop minimum makespan problems”, Eur. J. Oper. Res., 243:1 (2015), 70–74 |
| 13. |
E. Lawler, J. Lenstra, A. Rinnooy Kan, D. Shmoys, “Sequencing and scheduling: Algorithms and complexity”, Logistics Of Production And Inventory, Handbooks in Operations Research and Management Science, 4, Elsevier, 1993, 445–522 |
| 14. |
C. Liu, R. Bulfin, “Scheduling ordered open shops”, Comput. Oper. Res., 14 (1987), 257–264 |
| 15. |
M. Matta, S. Elmaghraby, “Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop”, Eur. J. Oper. Res., 201:3 (2010), 720–728 |
| 16. |
B. Naderi, M. Zandieh, M. Yazdani, “Polynomial time approximation algorithms for proportionate open-shop scheduling”, Int. Trans. Oper. Res., 21:6 (2014), 1031–1044 |
| 17. |
S. Sevastyanov, “Some positive news on the proportionate open shop problem”, Sib. Èlektron. Mat. Izv., 16 (2019), 406–426 |
| 18. |
S. Sevastyanov, I. Tchernykh, “Computer-aided way to prove theorems in scheduling”, Algorithms - ESA'98Algorithms – ESA '98, 6th annual European symposium, Proceedings (Venice, Italy, August 24-26, 1998), Lect. Notes Comput. Sci., 1461, eds. Bilardi Gianfranco (ed.) et al., Springer, Berlin, 1998, 502–513 |
| 19. |
D. Williamson, L. Hall, J. Hoogeveen, C. Hurkens, J. Lenstra, S. Sevast'janov, D. Shmoys, “Short shop schedules”, Oper. Res., 45:2 (1997), 288–294 |
