Sevast'yanov Sergey Vasil'evich

Publications in Math-Net.Ru

1. Some positive news on the proportionate open shop problem
   
   Sib. Èlektron. Mat. Izv., 16 (2019),  406–426
2. An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times
   
   Sib. Èlektron. Mat. Izv., 16 (2019),  42–84
3. Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
   
   Avtomat. i Telemekh., 2010, no. 10,  90–99
4. Structural properties of optimal schedules with preemption
   
   Diskretn. Anal. Issled. Oper., 16:1 (2009),  3–36
5. Улучшенная аппроксимационная схема для задачи Джонсона с параллельными машинами
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 14:2 (2007),  25–46
6. Some properties of optimal schedules for the Johnson problem with preemption
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 13:3 (2006),  83–102
7. A scheme of approximation solution of problem $1|R_j|L_{\max}$
   
   Diskretn. Anal. Issled. Oper., Ser. 2, 13:1 (2006),  57–76
8. On the stochastic problem of compact vector summation
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 12:1 (2005),  71–100
9. A polynomially solvable case of a two-stage open shop problem with three machines
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 8:1 (2001),  23–39
10. A four-parameter analysis of the complexity of the open shop problem
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000),  59–77
11. On the complexity of determining a connected prescribed coloring of the vertices of a graph
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:2 (2000),  21–46
12. Polynomial solvability of scheduling problems with storable resources and directive deadlines
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 7:1 (2000),  9–34
13. A linear approximation scheme for the multiprocessor open shop problem
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 6:2 (1999),  3–22
14. An improved algorithm for solving the two-machine flow shop problem with nonsimultaneous arrival of jobs
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 4:1 (1997),  13–32
15. A sufficient condition for the effective solvability of the open shop problem
    
    Diskretn. Anal. Issled. Oper., 3:1 (1996),  57–74
16. Nonstrict summation of vectors in the plane, and its application in problems of scheduling theory
    
    Diskretn. Anal. Issled. Oper., 2:2 (1995),  69–100
17. Nonstrict summation of vectors in problems of scheduling theory
    
    Sibirsk. Zh. Issled. Oper., 1:2 (1994),  67–99
18. Efficient construction of schedules in open-type systems
    
    Sibirsk. Zh. Issled. Oper., 1:1 (1994),  20–42
19. Построение приближенного расписания для системы поточного типа
    
    Upravliaemie systemy, 1993, no. 31,  66–71
20. Приближенный алгоритм с точной оценкой для трехмашинной задачи встречных маршрутов
    
    Upravliaemie systemy, 1993, no. 31,  53–65
21. On the compact summation of vectors
    
    Diskr. Mat., 3:3 (1991),  66–72
22. Geometry in scheduling theory
    
    Trudy Inst. Mat. Sib. Otd. AN SSSR, 10 (1988),  226–261
23. Efficient construction of near-optimal schedules for cases of arbitrary and alternative routing of jobs
    
    Dokl. Akad. Nauk SSSR, 276:1 (1984),  46–48
24. Algorithms with estimates for the Johnson and Akers–Fridman problems in the case of three benches
    
    Upravliaemie systemy, 1982, no. 22,  51–57
25. Some generalizations of the Johnson problem
    
    Upravliaemie systemy, 1981, no. 21,  45–61
26. Approximate algorithms in Johnson problems and the summation of vectors
    
    Upravliaemie systemy, 1980, no. 20,  64–73
27. An approximate solution of a scheduling problem
    
    Upravliaemie systemy, 1980, no. 20,  49–63
28. Value of the Steinitz constant
    
    Funktsional. Anal. i Prilozhen., 14:2 (1980),  56–57
29. Optimization of the servicing of the construction of linear objects
    
    Upravliaemie systemy, 1978, no. 17,  67–75
30. A scheduling problem on a network
    
    Upravliaemie systemy, 1976, no. 15,  48–67
31. The asymptotic approach to certain problems of scheduling theory
    
    Upravliaemie systemy, 1975, no. 14,  40–51