Kononov
A., Sevastyanov S., Sviridenko M. A complete 4-parametric complexity
classification of short shop scheduling problems, Journal of
Scheduling, 2011; DOI: 10.1007/s10951-011-0243-z.
Kononov A., Hong J-S., Kononova P., Lin F-C.
Quantity-based buffer-constrained two machinw flowshop problem: active and
passive prefetch models for multimedia applications,
Journal of Scheduling, 2011;
DOI: 10.1007/s10951-011-0235-z.
Baptiste Ph., Carlier J., Kononov A., Queyranne M., Sevastianov S.,
Sviridenko M., Properties of Optimal Schedules in Preemptive Shop
Scheduling, Discrete Applied Mathematics,
2011, v. 159. pp. 272-280
Gawiejnowicz S., Kononov A.,
Complexity and approximability of scheduling resumable proportionally
deteriorating jobs,
European Journal of Operational Research, 2010, v. 200/1, pp.
305-308.
Kononov A., Lin B.M.-T.
Minimizing the total weighted completion time in the relocation problem,
Journal of Scheduling, v.13, N 2, 2010, pp 123 -129.
Baptiste P., Carlier J., Kononov A.V., Queyranne M.,Sevastjanov S.V.,
Sviridenko M. I. Structural properties of optimal schedules with preemption
// Discr. analisys and oper. research. 2009. Vol. 16, N 1. P. 3–36.
A. V. Kononov,
S.
Sevastyanov. Graph
Structure Analysis and Computational Tractability of Scheduling Problems //
In: Analysis of Complex Networks: From Biology to Linguistics. Edited by M.
Dehmer and F. Emmert-Streib, 2009, Wiley-VCH Verlag Gmbh & Co. KGaA,
Weinheim ISBN 978-3-527-32345-6, c. 295-322.
A. V. Kononov, Yu. A. Kochetov, and A. V. Plyasunov Competitive Facility
Location Models // Computational Mathematics and Mathematical Physics,
2009, Vol. 49, No. 6, pp. 994–1009. (pdf.file
259 Kb)
Baptiste
Ph., Kononov A., Sviridenko M., New lower bound for the flow shop scheduling,
submitted in Journal of
Scheduling
Ageev
A., Kononov A., Approximation
Algorithms for Scheduling Problems with Exact Delays, submitted in Operations
Research Letters
Kononov A.,
Lin B.M.-T.
Customer Order Scheduling to Minimize the Number of Late Jobs,
European Journal of Operational Research. 2007. v. 183/2 pp 944-948
Ageev
A., Fishkin A., Kononov A., Sevastianov S., Open Block Scheduling in Optical
Communication Networks, Theoretical
Computer Science,
2006, v. 361, pp 257-274.
Kononov A.,
Lin B.M.-T.
Relocation
Problems with Multiple Working Crews,
Discrete
Optimization, 2006, v. 3, pp 366-381.
Агеев А.А.
, Ильев И.П., Кононов А.В., Талевнин А.С. Вычислительная сложность
задачи аппроксимации графов, Дискретный
анализ и исследование операций. Серия
1. 2006. том 13.
№ 1. с. 3-15.
Bampis
E., Kononov A., Bicriteria Approximation Algorithms for Scheduling Problems
with Communication Delays, Journal
of Scheduling,
v.8, N 4, 2005, pp 281 -294
Baptiste
Ph., Carlier J., Kononov A., Queyranne M., Sevastianov S., Sviridenko M.,
Structural Properties of Preemptive Schedules,, submitted in Journal
of
Scheduling
Bampis
E., Giroudeau R., Kononov A., Scheduling tasks with small communication
delays for clusters of processors, Annals of Operations
Research. 2004, V.129, Issue 1, pp.
47 - 63.
Angel.E,
Bampis E., Kononov A., On the approximate tradeoff for bicriteria batching
and parallel machine scheduling problems, Theoretical Computer
Science, 2003, V. 306 (1-3), p. 319-338.
Kononov
A., Sviridenko M., Linear time combinatorial approximation scheme for makespan
minimization in open shop with release dates, Operations Research
Letters, 2002, v.30, p.276-280.
Kashirskih
K., Kononov A., Sevastianov S., Tchernyh I., Polynomially solvable case
of two-stage open-shop problem with three machines, Discrete
Analysis and Operations Research, series 1. 2001, v.8, N 1,
p.24-40. (in russian)
Gawiejnowicz
S., Kononov A., NP-hard Cases in Scheduling Deteriorating Jobs on Dedicated
Machines, Journal of the Operational Research Society,
2001 V.52, p. 708-717.
Кононов А.В., Севастьянов
С.В.
О сложности
нахождения связной предписанной
раскраски вершин графа,
Дискретный
анализ и исследование операций. Серия
1. 2000. том 7.
№ 2. с. 21-46
Kononov A., Sevastianov S. and Tchernykh I. When the difference
in machine loads leads to efficient scheduling in open shops, Annals of Operations
Research, 92, 1999, p.211-239.
Gawiejnowicz S., Kononov A. NP-hard
Cases in Scheduling Deteriorating Jobs on Dedicated Machines, Adam Mickiewicz Univerity Report No. 101/1999, 26 p.
Kononov A. On schedules of a single machine jobs with processing
times nonlinear in time. Operations Research and Discrete Analysis, Kluwer Academic
Pubishers, Dordrecht. 1997, p.109-123.
Кононов А.В. О
расписаниях работ наодной машине с
длительностями, нелинейно зависящими от времени.
Дискретный анализ и исследование операций, 1995,
том 2, № 1, с.21-35.
Кононов А.В. Комбинаторная
сложность составления расписаний для работ с
простым линейным ростом длительностей.
Дискретный анализ и исследование операций, 1995,
том 3, № 2, с.15-32.
Kononov A. Scheduling
Problems with Linear Increasing Processing Times. In Operations Research Proceedings 1996,
Springer-Verlag, Berlin, 1997, p. 90-94.
