Sotskov Yuri Nazarovich

Publications in Math-Net.Ru

1. 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
2. Optimality region for job permutation in single-machine scheduling with uncertain processing times
   
   Avtomat. i Telemekh., 2020, no. 5,  60–90
3. Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines
   
   Avtomat. i Telemekh., 2019, no. 2,  125–151
4. Stability polyhedra of optimal permutation of jobs servicing
   
   Avtomat. i Telemekh., 2014, no. 7,  136–154
5. Scientific school of Academician V. S. Tanaev: Results on the scheduling theory
   
   Avtomat. i Telemekh., 2014, no. 7,  99–121
6. A neural network algorithm for servicing jobs with sequential and parallel machines
   
   Avtomat. i Telemekh., 2014, no. 7,  52–74
7. Minimizing total weighted completion time with uncertain data: A stability approach
   
   Avtomat. i Telemekh., 2010, no. 10,  26–49
8. О сложности задач построения расписаний и адаптивных алгоритмах их решения
   
   Upravliaemie systemy, 1993, no. 31,  72–83
9. The stability of the approximate Boolean minimization of a linear form
   
   Zh. Vychisl. Mat. Mat. Fiz., 33:5 (1993),  785–795
10. The stability of high-speed optimal schedules
    
    Zh. Vychisl. Mat. Mat. Fiz., 29:5 (1989),  723–731


11. 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
12. Creative heritage of Vyacheslav Sergeevich Tanaev: Seventieth anniversary
    
    Avtomat. i Telemekh., 2010, no. 10,  6–14