|
21
|
Zinder Y.
, Kononov A.
, Fung J.
A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements
Journal of Combinatorial Optimization. 2021.
V.42. N2. P.276-309. DOI: 10.1007/s10878-021-00706-4
WOS
Scopus
OpenAlex
|
|
22
|
Bampis E.
, Escoffier B.
, Kononov A.
LP-Based Algorithms for Multistage Minimization Problems
In compilation
Approximation and Online Algorithms. WAOA 2020. Lecture Notes in Computer Science.
– Springer.,
2021.
– Т.12806. – C.1-15. – ISBN 9783030808785. DOI: 10.1007/978-3-030-80879-2_1
OpenAlex
|
|
23
|
Chernykh I.
, Kononov A.
, Sevastyanov S.
A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes
Lecture Notes in Computer Science. 2020.
P.301-312. DOI: 10.1007/978-3-030-49988-4_21
Scopus
OpenAlex
|
|
24
|
Kononov A.
, Strekalovsky A.
, Posypkin M.
, Pyatkin A.
Preface
Journal of Global Optimization. 2020.
V.76. N3. P.453-454. DOI: 10.1007/s10898-020-00887-y
WOS
Scopus
OpenAlex
|
|
25
|
Ageev A.A.
, Kononov A.V.
A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem
Communications in Computer and Information Science. 2020.
V.1275. P.3-15. DOI: 10.1007/978-3-030-58657-7_1
Scopus
OpenAlex
|
|
26
|
Kononov A.V.
, Kovalenko Y.
Approximation algorithms for energy-efficient scheduling of parallel jobs
Journal of Scheduling. 2020.
N23. P.693 - 709. DOI: 10.1007/s10951-020-00653-8
WOS
Scopus
OpenAlex
|
|
27
|
Kononov A.
, Kononova P.
, Gordeev A.
Branch-and-bound approach for optima localization in scheduling multiprocessor jobs
International Transactions in Operational Research. 2020.
N27. P.381 - 393. DOI: 10.1111/itor.12503
WOS
Scopus
OpenAlex
|
|
28
|
Bampis E.
, Dogeas K.
, Kononov A.
, Lucarelli G.
, Pascual F.
Scheduling Malleable Jobs Under Topological Constraints
In compilation
Proceedings - 2020 IEEE 34th International Parallel and Distributed Processing Symposium, IPDPS 2020.
– Institute of Electrical and Electronics Engineers Inc..,
2020.
– C.316 - 325. – ISBN 9781728168760. DOI: 10.1109/ipdps47924.2020.00041
Scopus
OpenAlex
|
|
29
|
Kononov A.
, Kovalenko Y.
Makespan Minimization for Parallel Jobs with Energy Constraint
In compilation
Mathematical Optimization Theory and Operations Research. MOTOR 2020. Lecture Notes in Computer Science.
– Springer Nature Switzerland AG 2020.,
2020.
– Т.12095. – C.289-300. – ISBN 9783030499877. DOI: 10.1007/978-3-030-49988-4_20
Scopus
OpenAlex
|
|
30
|
Кононов А.В.
, Панин А.А.
, Плясунов А.В.
Двухуровневая модель конкурентного размещения и ценообразования с неравномерным распределением спроса
Дискретный анализ и исследование операций. 2019.
Т.26. №3. С.27-45. DOI: 10.33048/daio.2019.26.638
OpenAlex
|
|
31
|
Kononov A.V.
, Panin A.A.
, Plyasunov A.V.
A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand
Journal of Applied and Industrial Mathematics. 2019.
V.13. P.500-510. DOI: 10.1134/S1990478919030104
Scopus
OpenAlex
|
|
32
|
Kononov A.V.
, Kovalyov M.Y.
, Lin B.M.T.
Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||Cmax
Theoretical Computer Science. 2019.
N793. P.70 - 78. DOI: 10.1016/j.tcs.2019.05.02
|
|
33
|
Kononov A.
, Kovalenko Y.
Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2019.
N16. P.249 - 257.
|
|
34
|
Kononov A.
, Memar J.
, Zinder Y.
Flow Shop with Job–Dependent Buffer Requirements—a Polynomial–Time Algorithm and Efficient Heuristics
In compilation
Mathematical Optimization Theory and Operations Research. 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings.
– Springer.,
2019.
– Т.Lecture Notes in Computer Science. Vol. 11548.. – C.342-357. – ISBN 978-3-030-22628-2. DOI: 10.1007/978-3-030-22629-9_24
Scopus
OpenAlex
|
|
35
|
Eremeev A.
, Kononov A.
, Ziegler I.
On Complexity and Exact Solution of Production Groups Formation Problem
In compilation
Optimization and Applications. OPTIMA 2018. Communications in Computer and Information Science.
– Springer.,
2019.
– Т.974. – C.111-122. – ISBN 978-3-030-10933-2. DOI: 10.1007/978-3-030-10934-9_8
Scopus
OpenAlex
|
|
36
|
Berlińska J.
, Kononov A.
, Zinder Y.
Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations
Advances in Intelligent Systems and Computing. 2019.
V.991. N2. P.1139-1148. DOI: 10.1007/978-3-030-21803-4_112
Scopus
OpenAlex
|
|
37
|
Alhamdan Y.M.
, Kononov A.
Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem
Lecture Notes in Computer Science. 2019.
V.11532. P.1-12. DOI: 10.1007/978-3-030-19955-5_1
Scopus
OpenAlex
|
|
38
|
Gu H.
, Kononov A.V.
, Memar J.
, Zinder Y.
Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependent Buffer Requirements
Journal of Discrete Algorithms. 2018.
N52-53. P.143-155. DOI: 10.1016/j.jda.2018.11.011.
|
|
39
|
Kononov A.V.
, Panin A.A.
, Plyasunov A.V.
A New Model of Competitive Location and Pricing with the Uniform Split of the Demand
Communications in Computer and Information Science. 2018.
V.871. P.16-28. DOI: 10.1007/978-3-319-93800-4_2
Scopus
OpenAlex
|
|
40
|
Memar J.
, Zinder Y.
, Kononov A.V.
Worst-Case Analysis of a Modification of the Brucker-Garey-Johnson Algorithm
In compilation
Optimization Problems and Their Applications. OPTA 2018. Communications in Computer and Information Science.
– Springer International Publishing AG.,
2018.
– Т.871. – C.78-92. – ISBN 9783319937991. DOI: 10.1007/978-3-319-93800-4_7
Scopus
OpenAlex
|