|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
1. |
Yu. N. Sotskov, “A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring”, Avtomat. i Telemekh., 2023, no. 1, 139–168 ; Autom. Remote Control, 84:2 (2023), 190–210 |
|
2020 |
2. |
Yu. N. Sotskov, “Optimality region for job permutation in single-machine scheduling with uncertain processing times”, Avtomat. i Telemekh., 2020, no. 5, 60–90 ; Autom. Remote Control, 81:5 (2020), 819–842 |
1
|
|
2019 |
3. |
O. A. Gholami, Y. N. Sotskov, F. Werner, O. S. Zatsiupo, “Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines”, Avtomat. i Telemekh., 2019, no. 2, 125–151 |
1
|
|
2014 |
4. |
Yu. N. Sotskov, N. G. Egorova, “Stability polyhedra of optimal permutation of jobs servicing”, Avtomat. i Telemekh., 2014, no. 7, 136–154 ; Autom. Remote Control, 75:7 (2014), 1267–1282 |
1
|
5. |
M. Y. Kovalyov, Yu. N. Sotskov, Y. M. Shafransky, “Scientific school of Academician V. S. Tanaev: Results on the scheduling theory”, Avtomat. i Telemekh., 2014, no. 7, 99–121 ; Autom. Remote Control, 75:7 (2014), 1241–1256 |
6. |
O. Gholami, Yu. N. Sotskov, “A neural network algorithm for servicing jobs with sequential and parallel machines”, Avtomat. i Telemekh., 2014, no. 7, 52–74 ; Autom. Remote Control, 75:7 (2014), 1203–1220 |
4
|
|
2010 |
7. |
Yu. N. Sotskov, N. G. Egorova, F. Werner, “Minimizing total weighted completion time with uncertain data: A stability approach”, Avtomat. i Telemekh., 2010, no. 10, 26–49 ; Autom. Remote Control, 71:10 (2010), 2038–2057 |
9
|
|
1993 |
8. |
Yu. N. Sotskov, “О сложности задач построения расписаний и адаптивных алгоритмах их решения”, Upravliaemie systemy, 1993, no. 31, 72–83 |
9. |
Yu. N. Sotskov, “The stability of the approximate Boolean minimization of a linear
form”, Zh. Vychisl. Mat. Mat. Fiz., 33:5 (1993), 785–795 ; Comput. Math. Math. Phys., 33:5 (1993), 699–707 |
1
|
|
1989 |
10. |
Yu. N. Sotskov, “The stability of high-speed optimal schedules”, Zh. Vychisl. Mat. Mat. Fiz., 29:5 (1989), 723–731 ; U.S.S.R. Comput. Math. Math. Phys., 29:3 (1989), 57–63 |
6
|
|
|
|
2021 |
11. |
Yu. N. Sotskov, “Mixed graph colouring as scheduling multi-processor tasks with equal processing times”, Journal of the Belarusian State University. Mathematics and Informatics, 2 (2021), 67–81 |
3
|
|
2010 |
12. |
V. S. Gordon, M. Ya. Kovalyov, G. M. Levin, Yu. N. Sotskov, V. A. Strusevich, A. V. Tuzikov, Ya. M. Shafransky, “Creative heritage of Vyacheslav Sergeevich Tanaev: Seventieth anniversary”, Avtomat. i Telemekh., 2010, no. 10, 6–14 ; Autom. Remote Control, 71:10 (2010), 2021–2028 |
|
Organisations |
|
|
|
|