default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergey Sevastyanov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Ilya Chernykh, Alexander V. Kononov
, Sergey Sevastyanov:
An exact solution with an improved running time for the routing flow shop problem with two machines. J. Sched. 27(4): 329-340 (2024)- 2020
- [c13]Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov:
A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes. MOTOR 2020: 301-312 - [i1]Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov:
A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes. CoRR abs/2004.03942 (2020)
2010 – 2019
- 2015
- [j22]James D. Blocher, Sergey Sevastyanov:
A note on the Coffman-Sethi bound for LPT scheduling. J. Sched. 18(3): 325-327 (2015) - 2014
- [j21]Sergey Sevastyanov, D. A. Chemisova, Ilya Chernykh:
On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion. Ann. Oper. Res. 213(1): 253-270 (2014) - 2013
- [j20]Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov:
Efficient approximation algorithms for the routing open shop problem. Comput. Oper. Res. 40(3): 841-847 (2013) - 2012
- [j19]Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko:
Integer preemptive scheduling on parallel machines. Oper. Res. Lett. 40(6): 440-444 (2012) - [j18]Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko:
A Complete 4-parametric complexity classification of short shop scheduling problems. J. Sched. 15(4): 427-446 (2012) - 2011
- [j17]Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko:
Properties of optimal schedules in preemptive shop scheduling. Discret. Appl. Math. 159(5): 272-280 (2011) - [j16]Sergey Sevastyanov, Bertrand M. T. Lin, Hsiao-Lan Huang:
Tight complexity analysis of the relocation problem with arbitrary release dates. Theor. Comput. Sci. 412(35): 4536-4544 (2011) - [c12]Sergey Sevastyanov, Bertrand M. T. Lin:
Efficient enumeration of optimal and approximate solutions of a scheduling problem. CTW 2011: 248-251
2000 – 2009
- 2009
- [j15]Yaroslav Goncharov, Sergey Sevastyanov:
The flow shop problem with no-idle constraints: A review and approximation. Eur. J. Oper. Res. 196(2): 450-456 (2009) - [c11]Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko:
Integrality Property in Preemptive Parallel Machine Scheduling. CSR 2009: 38-46 - [c10]Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko:
Complete Complexity Classification of Short Shop Scheduling. CSR 2009: 227-236 - [c9]Ilya Chernykh, Nikita Dryuck, Alexander V. Kononov, Sergey Sevastyanov:
The Routing Open Shop Problem: New Approximation Algorithms. WAOA 2009: 75-85 - 2006
- [j14]Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov:
Open block scheduling in optical communication networks. Theor. Comput. Sci. 361(2-3): 257-274 (2006) - 2005
- [j13]Sergey V. Sevastianov:
An introduction to multi-parameter complexity analysis of discrete problems. Eur. J. Oper. Res. 165(2): 387-397 (2005) - [c8]Aleksei V. Fishkin, Klaus Jansen, Sergey V. Sevastianov, René Sitters:
Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays. ESA 2005: 580-591 - [c7]Roman A. Koryakin, Sergey V. Sevastianov:
The Flow Shop Problem with Random Operation Processing Times. OR 2005: 697-702 - 2003
- [c6]Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov:
Open Block Scheduling in Optical Communication Networks. WAOA 2003: 13-26 - 2002
- [c5]Edward Gimadi, Sergey V. Sevastianov:
On Solvability of the Project Scheduling Problem with Accumulative Resources of an Arbitrary Sign. OR 2002: 241-246 - 2001
- [j12]K. N. Kashyrskikh, Chris N. Potts, Sergey V. Sevastianov:
A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. Discret. Appl. Math. 114(1-3): 255-271 (2001) - [j11]Sergey V. Sevastianov, Gerhard J. Woeginger:
Linear time approximation scheme for the multiprocessor open shop problem. Discret. Appl. Math. 114(1-3): 273-288 (2001) - [c4]Edward Gimadi, Sergey V. Sevastianov, V. V. Zalyubovsky:
On the project scheduling problem under stored resource constraints. ETFA (2) 2001: 703-705
1990 – 1999
- 1999
- [j10]Alexander V. Kononov, Sergey V. Sevastianov, I. D. Tchernykh:
When difference in machine loads leadsto efficient scheduling in open shops. Ann. Oper. Res. 92: 211-239 (1999) - 1998
- [j9]Noga Alon, Yossi Azar, János Csirik, Leah Epstein, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger:
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. Algorithmica 21(1): 104-118 (1998) - [j8]Sergey V. Sevastianov:
Nonstrict vector summationin multi-operation scheduling. Ann. Oper. Res. 83: 179-212 (1998) - [j7]Sergey V. Sevastianov, Gerhard J. Woeginger:
Makespan Minimization in Preemptive Two Machine Job Shops. Computing 60(1): 73-80 (1998) - [j6]Sergey V. Sevastianov, Gerhard J. Woeginger:
Makespan minimization in open shops: A polynomial time approximation scheme. Math. Program. 82: 191-198 (1998) - [c3]Sergey V. Sevastianov, I. D. Tchernykh:
Computer-Aided Way to Prove Theorems in Scheduling. ESA 1998: 502-513 - 1997
- [j5]Sergey Vasil'evich Sevast'janov, Wojciech Banaszczyk:
To the Steinitz lemma in coordinate form. Discret. Math. 169(1-3): 145-152 (1997) - [j4]David P. Williamson, Leslie A. Hall, J. A. Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey Vasil'evich Sevast'janov, David B. Shmoys:
Short Shop Schedules. Oper. Res. 45(2): 288-294 (1997) - [c2]Sergey V. Sevastianov:
Seven Problems: So Different yet Close. ESA 1997: 443-458 - 1996
- [c1]Noga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger:
On-line and Off-line Approximation Algorithms for Vector Covering Problems. ESA 1996: 406-418 - 1995
- [j3]Sergey Vasil'evich Sevast'janov:
Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops. Math. Oper. Res. 20(1): 90-103 (1995) - 1994
- [j2]Sergey Vasil'evich Sevast'janov:
on Some Geometric Methods in Scheduling Theory: A Survey. Discret. Appl. Math. 55(1): 59-82 (1994) - 1992
- [j1]Sergey V. Avgustinovich, Sergey Vasil'evich Sevast'janov:
Vector Summation within Minimal Angle. Comput. Geom. 2: 235-239 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
