Science activity

Articles (16) More info

1	Sevastyanov S. Approximate solution of the job shop problem by means of the compact vector summation within a bounded convex set in R^d Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2025.
2	Sevastyanov S. Efficient approximation algorithms for scheduling problems with uniform p-batch machines and arbitrary processing set restrictions Journal of Scheduling. 2025.
3	Chernykh I. , Kononov A. , Sevastyanov S. An exact solution with an improved running time for the routing flow shop problem with two machines Journal of Scheduling. 2024. V.27. N4. P.329–340. DOI: 10.1007/s10951-023-00784-8 WOS Scopus РИНЦ OpenAlex
4	Sevastyanov S. Three efficient methods of finding near-optimal solution for np-hard discrete optimization problems. (Illustrated by their application to scheduling problems) Communications in Computer and Information Science. 2022. V.1661. P.3–33. DOI: 10.1007/978-3-031-16224-4_1 Scopus OpenAlex
5	Chernykh I. , Kononov A. , Sevastyanov S. A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes Lecture Notes in Computer Science. 2020. P.301-312. DOI: 10.1007/978-3-030-49988-4_21 Scopus OpenAlex
6	Sevastyanov S.V. Some positive news on the proportionate open shop problem Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2019. V.16. P.406-426. DOI: 10.33048/semi.2019.16.023 WOS Scopus OpenAlex
7	Bevern R.A.v. , Pyatkin A.V. , Sevastyanov S.V. An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2019. V.16. P.42-84. DOI: 10.33048/semi.2019.16.003 WOS Scopus OpenAlex
8	Sevastyanov S.V. , Chemisova D.A. , Chernykh I.D. On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion Annals of Operations Research. 2012. V.213. N1. P.253-270. DOI: 10.1007/s10479-012-1290-3 WOS Scopus OpenAlex
9	Chernykh I. , Kononov A. , Sevastyanov S. Efficient approximation algorithms for the routing open shop problem Computers and Operations Research. 2012. V.40. N3. P.841-847. DOI: 10.1016/j.cor.2012.01.006 WOS Scopus OpenAlex
10	Baptiste P. , Carlier J. , Kononov A. , Queyranne M. , Sevastyanov S. , Sviridenko M. Integer preemptive scheduling on parallel machines Operations Research Letters. 2012. V.40. N6. P.440-444. DOI: 10.1016/j.orl.2012.06.011 WOS Scopus OpenAlex
11	Kononov A. , Sevastyanov S. , Sviridenko M. A Complete 4-parametric complexity classification of short shop scheduling problems Journal of Scheduling. 2012. V.15. N4. P.427-446. DOI: 10.1007/s10951-011-0243-z WOS Scopus OpenAlex
12	Baptiste P. , Carlier J. , Kononov A. , Queyranne M. , Sevastyanov S. , Sviridenko M. Properties of optimal schedules in preemptive shop scheduling Discrete Applied Mathematics. 2011. V.159. N5. P.272-280. DOI: 10.1016/j.dam.2010.11.015 WOS Scopus OpenAlex
13	Baptiste P. , Carlier J. , Kononov A. , Queyranne M. , Sevastyanov S. , Sviridenko M. Structural properties of optimal schedules with preemption Journal of Applied and Industrial Mathematics. 2010. V.4. N4. P.455-474. DOI: 10.1134/s1990478910040010 Scopus OpenAlex
14	Sevastyanov S. , Kononov A. Graph Structure Analysis and Computational Tractability of Scheduling Problems In compilation Analysis of Complex Networks: From Biology to Linguistics. 2009. – C.295-322. DOI: 10.1002/9783527627981.ch12 Scopus OpenAlex
15	Ageev A.A. , Fishkin A.V. , Kononov A.V. , Sevastyanov S.V. Open block scheduling in optical communication networks Theoretical Computer Science. 2006. V.361. N2-3. P.257-274. DOI: 10.1016/j.tcs.2006.05.014 WOS Scopus OpenAlex
16	Kononov A. , Sevastianov S. , Tchernykh I. When the difference in machine loads leads to efficient scheduling in open shops Annals of Operations Research. 1999. V.92. P.211-239.

Conference attendances (7) More info

1	Sevastyanov S. On the uselessness of Supercomputers for solving discrete optimization problems by means of some “theoretically efficient” algorithms XXIII International Conference Mathematical Optimization Theory and Operations Research 30 Jun - 6 Jul 2024
2	Sevastyanov S.V. THREE EFFICIENT METHODS OF FINDING NEAR-OPTIMAL SOLUTION FOR NP-HARD DISCRETE OPTIMIZATION PROBLEMS. (ILLUSTRATED BY THEIR APPLICATION TO SCHEDULING PROBLEMS) International Conference Mathematical Optimization Theory and Operations Research Petrozavodsk, Karelia, Russia, July 2-6, 2022 02-08 Jul 2022
3	Sevastyanov S.V. “Nearly all” instances of an NP-hard scheduling problem appear to be easily solvable. Is that a unique case in scheduling? Танаевские чтения 2021 30-30 Mar 2021
4	Chernykh I. , Sevastyanov S. Optima Localization for Scheduling Problems: Computer-aided Approach Танаевские чтения 2021 30-30 Mar 2021
5	Chernykh I. , Kononov A. , Sevastyanov S. A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes Mathematical Optimization Theory and Operations Research 06-10 Jul 2020
6	Chernykh I. , Kononov A. , Sevastyanov S. On the complexity of the two-machine routing flow shop 14th Workshop on Models and Algorithms for Planning and Scheduling Problems 02-07 Jun 2019
7	Chernykh I. , Kononov A. , Sevastyanov S. Exact polynomial-time algorithm for the two-machine routing flow shop with a restricted transportation network Проблемы оптимизации и их приложения Optimization Problems and Their Applications 08-14 Jul 2018

Identifiers

Degrees

2001 - Dr.Sc.

Academic titles

2006 - Professor