Sergey V. Sevastianov

17 papers A 4B 1Journal 9Unranked 3
YearRankTypeTitle / Venue / Authors
2006 J jnl
Open block scheduling in optical communication networks.
Theor. Comput. Sci.
Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov
2005 J jnl
An introduction to multi-parameter complexity analysis of discrete problems.
Eur. J. Oper. Res.
Sergey V. Sevastianov
2005 A conf
Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays.
ESA
Aleksei V. Fishkin, Klaus Jansen, Sergey V. Sevastianov, René Sitters
2005 — conf
The Flow Shop Problem with Random Operation Processing Times.
OR
Roman A. Koryakin, Sergey V. Sevastianov
2003 B conf
Open Block Scheduling in Optical Communication Networks.
WAOA
Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov
2002 — conf
On Solvability of the Project Scheduling Problem with Accumulative Resources of an Arbitrary Sign.
OR
Edward Gimadi, Sergey V. Sevastianov
2001 J jnl
A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.
Discret. Appl. Math.
K. N. Kashyrskikh, Chris N. Potts, Sergey V. Sevastianov
2001 J jnl
Linear time approximation scheme for the multiprocessor open shop problem.
Discret. Appl. Math.
Sergey V. Sevastianov, Gerhard J. Woeginger
2001 — conf
On the project scheduling problem under stored resource constraints.
ETFA (2)
Edward Gimadi, Sergey V. Sevastianov, V. V. Zalyubovsky
1999 J jnl
When difference in machine loads leadsto efficient scheduling in open shops.
Ann. Oper. Res.
Alexander V. Kononov, Sergey V. Sevastianov, I. D. Tchernykh
1998 A conf
Computer-Aided Way to Prove Theorems in Scheduling.
ESA
Sergey V. Sevastianov, I. D. Tchernykh
1998 J jnl
Makespan Minimization in Preemptive Two Machine Job Shops.
Computing
Sergey V. Sevastianov, Gerhard J. Woeginger
1998 J jnl
Makespan minimization in open shops: A polynomial time approximation scheme.
Math. Program.
Sergey V. Sevastianov, Gerhard J. Woeginger
1998 J jnl
Nonstrict vector summationin multi-operation scheduling.
Ann. Oper. Res.
Sergey V. Sevastianov
1998 J jnl
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems.
Algorithmica
Noga Alon, Yossi Azar, János Csirik, Leah Epstein, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger
1997 A conf
Seven Problems: So Different yet Close.
ESA
Sergey V. Sevastianov
1996 A conf
On-line and Off-line Approximation Algorithms for Vector Covering Problems.
ESA
Noga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger