|
|
|
Publications in Math-Net.Ru |
Citations |
|
2019 |
| 1. |
Sergey Sevastyanov, “Some positive news on the proportionate open shop problem”, Sib. Èlektron. Mat. Izv., 16 (2019), 406–426   |
8
|
| 2. |
R. A. van Bevern, A. V. Pyatkin, S. V. Sevastyanov, “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 |
8
|
|
2010 |
| 3. |
S. V. Sevast'yanov, R. A. Sitters, A. V. Fishkin, “Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays”, Avtomat. i Telemekh., 2010, no. 10, 90–99   ; Autom. Remote Control, 71:10 (2010), 2093–2101  |
3
|
|
2009 |
| 4. |
Ph. Baptiste, J. Carlier, A. V. Kononov, M. Queyranne, S. V. Sevast'yanov, M. Sviridenko, “Structural properties of optimal schedules with preemption”, Diskretn. Anal. Issled. Oper., 16:1 (2009), 3–36 ; J. Appl. Industr. Math., 4:4 (2010), 455–474 |
10
|
|
2007 |
| 5. |
S. V. Sevast'yanov, “Улучшенная аппроксимационная схема для задачи Джонсона с параллельными машинами”, Diskretn. Anal. Issled. Oper., Ser. 1, 14:2 (2007), 25–46 ; J. Appl. Industr. Math., 2:3 (2008), 406–420 |
1
|
|
2006 |
| 6. |
S. V. Sevast'yanov, D. A. Chemisova, I. D. Chernykh, “Some properties of optimal schedules for the Johnson problem with preemption”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:3 (2006), 83–102 ; J. Appl. Industr. Math., 1:3 (2007), 386–397 |
3
|
| 7. |
A. A. Lazarev, R. R. Sadykov, S. V. Sevast'yanov, “A scheme of approximation solution of problem $1|R_j|L_{\max}$”, Diskretn. Anal. Issled. Oper., Ser. 2, 13:1 (2006), 57–76 ; J. Appl. Industr. Math., 1:4 (2007), 468–480 |
6
|
|
2005 |
| 8. |
R. A. Koryakin, S. V. Sevast'yanov, “On the stochastic problem of compact vector summation”, Diskretn. Anal. Issled. Oper., Ser. 1, 12:1 (2005), 71–100 |
|
2001 |
| 9. |
K. N. Kashirskich, A. V. Kononov, S. V. Sevast'yanov, I. D. Chernykh, “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 |
1
|
|
2000 |
| 10. |
K. N. Kashirskich, S. V. Sevast'yanov, I. D. Chernykh, “A four-parameter analysis of the complexity of the open shop problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000), 59–77 |
3
|
| 11. |
A. V. Kononov, S. V. Sevast'yanov, “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 |
3
|
| 12. |
E. Kh. Gimadi, V. V. Zalyubovskii, S. V. Sevast'yanov, “Polynomial solvability of scheduling problems with storable resources and directive deadlines”, Diskretn. Anal. Issled. Oper., Ser. 2, 7:1 (2000), 9–34 |
16
|
|
1999 |
| 13. |
G. J. Woeginger, S. V. Sevast'yanov, “A linear approximation scheme for the multiprocessor open shop problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 6:2 (1999), 3–22 |
|
1997 |
| 14. |
K. N. Kashirskich, K. N. Potts, S. V. Sevast'yanov, “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 |
|
1996 |
| 15. |
S. V. Sevast'yanov, I. D. Chernykh, “A sufficient condition for the effective solvability of the open shop problem”, Diskretn. Anal. Issled. Oper., 3:1 (1996), 57–74 |
2
|
|
1995 |
| 16. |
S. V. Sevast'yanov, “Nonstrict summation of vectors in the plane, and its application in problems of scheduling theory”, Diskretn. Anal. Issled. Oper., 2:2 (1995), 69–100 |
1
|
|
1994 |
| 17. |
S. V. Sevast'yanov, “Nonstrict summation of vectors in problems of scheduling theory”, Sibirsk. Zh. Issled. Oper., 1:2 (1994), 67–99 |
| 18. |
S. V. Sevast'yanov, “Efficient construction of schedules in open-type systems”, Sibirsk. Zh. Issled. Oper., 1:1 (1994), 20–42 |
|
1993 |
| 19. |
S. V. Sevast'yanov, “Построение приближенного расписания для системы поточного типа”, Upravliaemie systemy, 1993, no. 31, 66–71 |
| 20. |
Yu. D. Neumytov, S. V. Sevast'yanov, “Приближенный алгоритм с точной оценкой для трехмашинной задачи встречных маршрутов”, Upravliaemie systemy, 1993, no. 31, 53–65 |
|
1991 |
| 21. |
S. V. Sevast'yanov, “On the compact summation of vectors”, Diskr. Mat., 3:3 (1991), 66–72 |
3
|
|
1988 |
| 22. |
S. V. Sevast'yanov, “Geometry in scheduling theory”, Trudy Inst. Mat. Sib. Otd. AN SSSR, 10 (1988), 226–261 |
|
1984 |
| 23. |
S. V. Sevast'yanov, “Efficient construction of near-optimal schedules for cases of
arbitrary and alternative routing of jobs”, Dokl. Akad. Nauk SSSR, 276:1 (1984), 46–48 |
|
1982 |
| 24. |
S. V. Sevast'yanov, “Algorithms with estimates for the Johnson and Akers–Fridman problems in the case of three benches”, Upravliaemie systemy, 1982, no. 22, 51–57 |
|
1981 |
| 25. |
S. V. Sevast'yanov, “Some generalizations of the Johnson problem”, Upravliaemie systemy, 1981, no. 21, 45–61 |
|
1980 |
| 26. |
S. V. Sevast'yanov, “Approximate algorithms in Johnson problems and the summation of vectors”, Upravliaemie systemy, 1980, no. 20, 64–73 |
| 27. |
S. V. Sevast'yanov, “An approximate solution of a scheduling problem”, Upravliaemie systemy, 1980, no. 20, 49–63 |
| 28. |
V. S. Grinberg, S. V. Sevast'yanov, “Value of the Steinitz constant”, Funktsional. Anal. i Prilozhen., 14:2 (1980), 56–57 ; Funct. Anal. Appl., 14:2 (1980), 125–126 |
26
|
|
1978 |
| 29. |
S. V. Sevast'yanov, “Optimization of the servicing of the construction of linear objects”, Upravliaemie systemy, 1978, no. 17, 67–75 |
|
1976 |
| 30. |
V. A. Perepelitsa, S. V. Sevast'yanov, “A scheduling problem on a network”, Upravliaemie systemy, 1976, no. 15, 48–67 |
|
1975 |
| 31. |
S. V. Sevast'yanov, “The asymptotic approach to certain problems of scheduling theory”, Upravliaemie systemy, 1975, no. 14, 40–51 |
|
| Organisations |
|
| |
|
|
Contact us: