Teoriya raspisanii : mnogostadiin. sistemy / V. S. Tanaev, Yu. N. Sotskov, V. A. Strusevich. - Moskva : Nauka, 1989. - 327, [1] s. : il.; 22 sm. - (Ekon.-mat. b-ka).; ISBN 5-02-013984-X
Sequencing and scheduling with inaccurate data / Yuri N. Sotskov a. Frank Werner, eds. - New York : Nova, cop. 2014. - x, 432 s. : il. ; 26 sm. - (Applied statistical science).; ISBN 9781629486772
Yu. N. Sotskov, N. M. Matsveichuk, “Optimal selection and scheduling of jobs with uncertain durations for two employees”, Journal of the Belarusian State University. Mathematics and Informatics, 2 (2024), 65–80
2023
2.
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), 167–186
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
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
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
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
7.
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
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
Yu. N. Sotskov, “О сложности задач построения расписаний и адаптивных алгоритмах их решения”, Upravliaemie systemy, 1993, no. 31, 72–83
10.
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
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
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
Contact us: