Vector Summation within Minimal Angle. - Sergey V. Avgustinovich; Sergey Vasil'evich Sevast'janov (Comput. Geom., 1992)

on Some Geometric Methods in Scheduling Theory: A Survey. - Sergey Vasil'evich Sevast'janov (Discret. Appl. Math., 1994)

Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops. - Sergey Vasil'evich Sevast'janov (Math. Oper. Res., 1995)

On-line and Off-line Approximation Algorithms for Vector Covering Problems. - Noga Alon; János Csirik; Sergey V. Sevastianov; Arjen P. A. Vestjens; Gerhard J. Woeginger (ESA, 1996)

Seven Problems: So Different yet Close. - Sergey V. Sevastianov (ESA, 1997)

To the Steinitz lemma in coordinate form. - Sergey Vasil'evich Sevast'janov; Wojciech Banaszczyk (Discret. Math., 1997)

Short Shop Schedules. - David P. Williamson; Leslie A. Hall; J. A. Hoogeveen; Cor A. J. Hurkens; Jan Karel Lenstra; Sergey Vasil'evich Sevast'janov; David B. Shmoys (Oper. Res., 1997)

Computer-Aided Way to Prove Theorems in Scheduling. - Sergey V. Sevastianov; I. D. Tchernykh (ESA, 1998)

On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. - Noga Alon; Yossi Azar; János Csirik; Leah Epstein; Sergey V. Sevastianov; Arjen P. A. Vestjens; Gerhard J. Woeginger (Algorithmica, 1998)

Nonstrict vector summationin multi-operation scheduling. - Sergey V. Sevastianov (Ann. Oper. Res., 1998)

Makespan Minimization in Preemptive Two Machine Job Shops. - Sergey V. Sevastianov; Gerhard J. Woeginger (Computing, 1998)

Makespan minimization in open shops: A polynomial time approximation scheme. - Sergey V. Sevastianov; Gerhard J. Woeginger (Math. Program., 1998)

When difference in machine loads leadsto efficient scheduling in open shops. - Alexander V. Kononov; Sergey V. Sevastianov; I. D. Tchernykh (Ann. Oper. Res., 1999)

On the project scheduling problem under stored resource constraints. - Edward Gimadi; Sergey V. Sevastianov; V. V. Zalyubovsky (ETFA (2), 2001)

A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. - K. N. Kashyrskikh; Chris N. Potts; Sergey V. Sevastianov (Discret. Appl. Math., 2001)

Linear time approximation scheme for the multiprocessor open shop problem. - Sergey V. Sevastianov; Gerhard J. Woeginger (Discret. Appl. Math., 2001)

On Solvability of the Project Scheduling Problem with Accumulative Resources of an Arbitrary Sign. - Edward Gimadi; Sergey V. Sevastianov (OR, 2002)

Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays. - Aleksei V. Fishkin; Klaus Jansen; Sergey V. Sevastianov; René Sitters (ESA, 2005)

The Flow Shop Problem with Random Operation Processing Times. - Roman A. Koryakin; Sergey V. Sevastianov (OR, 2005)

An introduction to multi-parameter complexity analysis of discrete problems. - Sergey V. Sevastianov (Eur. J. Oper. Res., 2005)

Open block scheduling in optical communication networks. - Alexander A. Ageev; Aleksei V. Fishkin; Alexander V. Kononov; Sergey V. Sevastianov (Theor. Comput. Sci., 2006)

Integrality Property in Preemptive Parallel Machine Scheduling. - Philippe Baptiste; Jacques Carlier; Alexander V. Kononov; Maurice Queyranne; Sergey Sevastyanov; Maxim Sviridenko (CSR, 2009)

Complete Complexity Classification of Short Shop Scheduling. - Alexander V. Kononov; Sergey Sevastyanov; Maxim Sviridenko (CSR, 2009)

The Routing Open Shop Problem: New Approximation Algorithms. - Ilya Chernykh; Nikita Dryuck; Alexander V. Kononov; Sergey Sevastyanov (WAOA, 2009)

The flow shop problem with no-idle constraints: A review and approximation. - Yaroslav Goncharov; Sergey Sevastyanov (Eur. J. Oper. Res., 2009)

Efficient enumeration of optimal and approximate solutions of a scheduling problem. - Sergey Sevastyanov; Bertrand M. T. Lin (CTW, 2011)

Properties of optimal schedules in preemptive shop scheduling. - Philippe Baptiste; Jacques Carlier; Alexander V. Kononov; Maurice Queyranne; Sergey Sevastyanov; Maxim Sviridenko (Discret. Appl. Math., 2011)

Tight complexity analysis of the relocation problem with arbitrary release dates. - Sergey Sevastyanov; Bertrand M. T. Lin; Hsiao-Lan Huang (Theor. Comput. Sci., 2011)

Integer preemptive scheduling on parallel machines. - Philippe Baptiste; Jacques Carlier; Alexander V. Kononov; Maurice Queyranne; Sergey Sevastyanov; Maxim Sviridenko (Oper. Res. Lett., 2012)

A Complete 4-parametric complexity classification of short shop scheduling problems. - Alexander V. Kononov; Sergey Sevastyanov; Maxim Sviridenko (J. Sched., 2012)

Efficient approximation algorithms for the routing open shop problem. - Ilya Chernykh; Alexander V. Kononov; Sergey Sevastyanov (Comput. Oper. Res., 2013)

On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion. - Sergey Sevastyanov; D. A. Chemisova; Ilya Chernykh (Ann. Oper. Res., 2014)

A note on the Coffman-Sethi bound for LPT scheduling. - James D. Blocher; Sergey Sevastyanov (J. Sched., 2015)

A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes. - Ilya Chernykh; Alexander V. Kononov; Sergey Sevastyanov (MOTOR, 2020)

An exact solution with an improved running time for the routing flow shop problem with two machines. - Ilya Chernykh; Alexander V. Kononov; Sergey Sevastyanov (J. Sched., 2024)