Sergey Sevastyanov

15 papers B 1C 1Misc 2Journal 10Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
An exact solution with an improved running time for the routing flow shop problem with two machines.
J. Sched.
Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov
2020 — conf
A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes.
MOTOR
Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov
2020 J jnl
A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes.
CoRR
Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov
2015 J jnl
A note on the Coffman-Sethi bound for LPT scheduling.
J. Sched.
James D. Blocher, Sergey Sevastyanov
2014 J jnl
On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion.
Ann. Oper. Res.
Sergey Sevastyanov, D. A. Chemisova, Ilya Chernykh
2013 J jnl
Efficient approximation algorithms for the routing open shop problem.
Comput. Oper. Res.
Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov
2012 J jnl
A Complete 4-parametric complexity classification of short shop scheduling problems.
J. Sched.
Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko
2012 J jnl
Integer preemptive scheduling on parallel machines.
Oper. Res. Lett.
Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko
2011 C conf
Efficient enumeration of optimal and approximate solutions of a scheduling problem.
CTW
Sergey Sevastyanov, Bertrand M. T. Lin
2011 J jnl
Properties of optimal schedules in preemptive shop scheduling.
Discret. Appl. Math.
Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko
2011 J jnl
Tight complexity analysis of the relocation problem with arbitrary release dates.
Theor. Comput. Sci.
Sergey Sevastyanov, Bertrand M. T. Lin, Hsiao-Lan Huang
2009 Misc conf
Complete Complexity Classification of Short Shop Scheduling.
CSR
Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko
2009 Misc conf
Integrality Property in Preemptive Parallel Machine Scheduling.
CSR
Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko
2009 B conf
The Routing Open Shop Problem: New Approximation Algorithms.
WAOA
Ilya Chernykh, Nikita Dryuck, Alexander V. Kononov, Sergey Sevastyanov
2009 J jnl
The flow shop problem with no-idle constraints: A review and approximation.
Eur. J. Oper. Res.
Yaroslav Goncharov, Sergey Sevastyanov