|
61
|
Kononov A.V.
On the routing open shop problem with two machines on a two-vertex network
Journal of Applied and Industrial Mathematics. 2012.
V.6. N3. P.318-331. DOI: 10.1134/s1990478912030064
Scopus
OpenAlex
|
|
62
|
Кононов А.В.
О цеховой задаче открытого типа на двух машинах с маршрутизацией в двухвершинной сети
Дискретный анализ и исследование операций. 2012.
Т.19. №2. С.54-74.
|
|
63
|
Kononov A.
, Hong J-S.
, Kononova P.
, Lin F-C.
Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications
Journal of Scheduling. 2011.
V.15. N4. P.487-497. DOI: 10.1007/s10951-011-0235-z
WOS
Scopus
OpenAlex
|
|
64
|
Baptiste P.
, Carlier J.
, Kononov A.
, Queyranne M.
, Sevastyanov S.
, Sviridenko M.
Properties of optimal schedules in preemptive shop scheduling
Discrete Applied Mathematics. 2011.
V.159. N5. P.272-280. DOI: 10.1016/j.dam.2010.11.015
WOS
Scopus
OpenAlex
|
|
65
|
Gawiejnowicz S.
, Kononov A.
Complexity and approximability of scheduling resumable proportionally deteriorating jobs
European Journal of Operational Research. 2010.
V.200. N1. P.305-308. DOI: 10.1016/j.ejor.2008.12.014
WOS
Scopus
OpenAlex
|
|
66
|
Kononov A.V.
, Lin B.M.T.
Minimizing the total weighted completion time in the relocation problem
Journal of Scheduling. 2010.
V.13. N2. P.123-129. DOI: 10.1007/s10951-009-0151-7
WOS
Scopus
OpenAlex
|
|
67
|
Baptiste P.
, Carlier J.
, Kononov A.
, Queyranne M.
, Sevastyanov S.
, Sviridenko M.
Structural properties of optimal schedules with preemption
Journal of Applied and Industrial Mathematics. 2010.
V.4. N4. P.455-474. DOI: 10.1134/s1990478910040010
Scopus
OpenAlex
|
|
68
|
Баптист Ф.
, Карлье Ж.
, Кононов А.В.
, Керан М.
, Севастьянов С.В.
, Свириденко М.
Структурные свойства оптимальных расписаний с прерываниями операций
Дискретный анализ и исследование операций. 2009.
Т.16. №1. С.3–36.
|
|
69
|
Sevastyanov S.
, Kononov A.
Graph Structure Analysis and Computational Tractability of Scheduling Problems
In compilation
Analysis of Complex Networks: From Biology to Linguistics.
2009.
– C.295-322. DOI: 10.1002/9783527627981.ch12
Scopus
OpenAlex
|
|
70
|
Lin B.M.T.
, Kononov A.V.
Customer order scheduling to minimize the number of late jobs
European Journal of Operational Research. 2007.
V.183. N2. P.944-948. DOI: 10.1016/j.ejor.2006.10.021
WOS
Scopus
OpenAlex
|
|
71
|
Ageev A.A.
, Il’ev V.P.
, Kononov A.V.
, Talevnin A.S.
Computational complexity of the graph approximation problem
Journal of Applied and Industrial Mathematics. 2007.
V.1. N1. P.1-8. DOI: 10.1134/s1990478907010012
Scopus
OpenAlex
|
|
72
|
Ageev A.A.
, Kononov A.V.
Approximation Algorithms for Scheduling Problems with Exact Delays
In compilation
Approximation and Online Algorithms. WAOA 2006. Lecture Notes in Computer Science.
– Springer.,
2007.
– Т.4368. – C.1-14. DOI: 10.1007/11970125_1
OpenAlex
|
|
73
|
Ageev A.A.
, Fishkin A.V.
, Kononov A.V.
, Sevastyanov S.V.
Open block scheduling in optical communication networks
Theoretical Computer Science. 2006.
V.361. N2-3. P.257-274. DOI: 10.1016/j.tcs.2006.05.014
WOS
Scopus
OpenAlex
|
|
74
|
Kononov A.V.
, Lin B.M.T.
On relocation problems with multiple identical working crews
Discrete Optimization. 2006.
V.3. N4. P.366-381. DOI: 10.1016/j.disopt.2006.06.003
WOS
Scopus
OpenAlex
|
|
75
|
Агеев А.А.
, Ильев В.П.
, Кононов А.В.
, Талевнин А.С.
Вычислительная сложность задачи аппроксимации графов
Дискретный анализ и исследование операций. 2006.
Т.13. №1. С.3-15.
|
|
76
|
Bampis E.
, Kononov A.
Bicriteria approximation algorithms for scheduling problems with communications delays
Journal of Scheduling. 2005.
V.8. N4. P.281-294. DOI: 10.1007/s10951-005-1637-6
WOS
Scopus
OpenAlex
|
|
77
|
Bampis E.
, Giroudeau R.
, Kononov A.
Scheduling Tasks with Small Communication Delays for Clusters of Processors
Annals of Operations Research. 2004.
V.129. N1-4. P.47-63. DOI: 10.1023/b:anor.0000030681.44697.7f
WOS
Scopus
OpenAlex
|
|
78
|
Angel E.
, Bampis E.
, Kononov A.
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems
Theoretical Computer Science. 2003.
V.306. N1-3. P.319-338. DOI: 10.1016/s0304-3975(03)00288-3
WOS
Scopus
OpenAlex
|
|
79
|
Kononov A.
, Sviridenko M.
A linear time approximation scheme for makespan minimization in an open shop with release dates
Operations Research Letters. 2002.
V.30. N4. P.276-280. DOI: 10.1016/s0167-6377(02)00115-3
Scopus
OpenAlex
|
|
80
|
Каширских К.
, Кононов А.В.
, Севастьянов С.В.
, Черных И.Д.
Полиномиально разрешимый случай двухстадийной задачи Open Shop с тремя машинами
Дискретный анализ и исследование операций. 2001.
Т.8. №1. С.23-39.
|