Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Sergey V. Sevastianov"'
Publikováno v:
Известия Восточного института. :25-34
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6cb32a2d0466613cb476c2c10b44df9c
https://doi.org/10.24866/2542-1611/2017-4/25-34
https://doi.org/10.24866/2542-1611/2017-4/25-34
Publikováno v:
Discrete Applied Mathematics. 114(1-3):255-271
The two-machine flow-shop sequencing problem with arbitrary release dates of jobs and the minimum makespan criterion is considered. The problem is known to be NP-hard, and the best-known approximation algorithms are those of Potts (Math. Oper. Res. 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1159187feff44105c0d926a866aaac17
Publikováno v:
Discrete applied mathematics, 114, 273-288. Elsevier
Discrete Applied Mathematics, 114(1-3), 273-288. Elsevier
Discrete Applied Mathematics, 114(1-3), 273-288. Elsevier
For the r-stage open shop problem with identical parallel machines at each stage and the minimum makespan criterion, an approximation scheme is constructed with running time O(nrm+C(m,e)), where n is the number of jobs, m is the total number of machi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fc056014ae72d8d536edda1e9374948f
https://research.tue.nl/en/publications/cf972d5c-8a30-43a2-8799-d3b7f9139bb6
https://research.tue.nl/en/publications/cf972d5c-8a30-43a2-8799-d3b7f9139bb6
Autor:
Sergey V. Sevastianov
Publikováno v:
Annals of Operations Research. 83:179-212
We consider several multi-operation scheduling problems with m machines and n jobs, including flow shop, open shop, assembly line, and a few special cases of job shop with the minimum makespan criterion. It is demonstrated that the problems in questi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9da0df5639d4925ada7c40db700b713c
https://doi.org/10.1023/a:1018908013582
https://doi.org/10.1023/a:1018908013582
Publikováno v:
Mathematical Programming, 82(1-2), 191-198. Springer
In this paper, we demonstrate the existence of a polynomial time approximation scheme for makespan minimization in the open shop scheduling problem with an arbitrary fixed numberm of machines. For the variant of the problem where the number of machin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c101cfa1a571dead8885651ebbe268ef
https://doi.org/10.1007/BF01585871
https://doi.org/10.1007/BF01585871
Autor:
Noga Alon, Arjen P. A. Vestjens, Leah Epstein, Yossi Azar, Gerhard J. Woeginger, Sergey V. Sevastianov, János Csirik
Publikováno v:
Scopus-Elsevier
Algorithmica, 21(1), 104-118. Springer
Algorithms — ESA '96 ISBN: 9783540616801
ESA
Algorithms-ESA'96 (Proceedings Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996), 406-418
STARTPAGE=406;ENDPAGE=418;TITLE=Algorithms-ESA'96 (Proceedings Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996)
Algorithmica, 21(1), 104-118. Springer
Algorithms — ESA '96 ISBN: 9783540616801
ESA
Algorithms-ESA'96 (Proceedings Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996), 406-418
STARTPAGE=406;ENDPAGE=418;TITLE=Algorithms-ESA'96 (Proceedings Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996)
This paper deals with vector covering problems in d -dimensional space. The input to a vector covering problem consists of a set X of d -dimensional vectors in [0,1] d . The goal is to partition X into a maximum number of parts, subject to the constr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::325328b60c61fd239fc17ce3758e3c1f
https://doi.org/10.1007/3-540-61680-2_71
https://doi.org/10.1007/3-540-61680-2_71
Publikováno v:
Approximation and Online Algorithms ISBN: 9783540210795
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49de107fab195e43c2065f069af82438
https://doi.org/10.1007/978-3-540-24592-6_2
https://doi.org/10.1007/978-3-540-24592-6_2
Publikováno v:
Operations Research Proceedings 2002 ISBN: 9783540003878
OR
OR
A project scheduling problem (PSP) with precedence constraints, deadlines and resource constraints is considered. It was known before that PSP is polynomially solvable if all resource constraints are of so called accumulative type (please, don’t mi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0191b2c3850c5cf15f76e47244e4c162
https://doi.org/10.1007/978-3-642-55537-4_39
https://doi.org/10.1007/978-3-642-55537-4_39
Autor:
I. D. Tchernykh, Sergey V. Sevastianov
Publikováno v:
Algorithms — ESA’ 98 ISBN: 9783540648482
ESA
ESA
For two scheduling problems (O3||Cmax and AL3||Cmax) tight bounds of the optima localization intervals are found in terms of lower bounds (C and C, respectively) computable in linear time. The main part of the proof was made with an aid of computer.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83a89de5e707174255da4cba4fee4c62
https://doi.org/10.1007/3-540-68530-8_42
https://doi.org/10.1007/3-540-68530-8_42
Autor:
Sergey V. Sevastianov
Publikováno v:
Algorithms — ESA '97 ISBN: 9783540633976
ESA
ESA
We show that seven discrete optimization problems from different fields of discrete mathematics (such as linear algebra, combinatorics, ] geometry, and functional analysis) that at first sight seem to be quite different prove to be in fact rather clo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa399b6f9a8248e2cf34dfcaf4928e14
https://doi.org/10.1007/3-540-63397-9_34
https://doi.org/10.1007/3-540-63397-9_34