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.
Bampis E., Kononov A., Bicriteria Approximation Algorithms for Scheduling Problems with Communication Delays, Journal of Scheduling, v. 8, N 4, 2005, pp. 281–294.
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.
Kononov A., Sevastianov S., Tchernykh I., When the difference in machine loads leads to efficient scheduling in open shops, Annals of Operations Research, 92, 1999, p. 211–239.
A. Kononov, Yu. Zakharova, “Minimizing makespan for parallelizable jobs with energy constraint”, Sib. Èlektron. Mat. Izv., 19:2 (2022), 586–600
2019
2.
A. V. Kononov, A. A. Panin, A. V. Plyasunov, “A bilevel competitive location and pricing model with nonuniform split of demand”, Diskretn. Anal. Issled. Oper., 26:3 (2019), 27–45; J. Appl. Industr. Math., 13:3 (2019), 500–510
A. Kononov, Yu. Kovalenko, “Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems”, Sib. Èlektron. Mat. Izv., 16 (2019), 249–257
2016
4.
A. V. Kononov, P. A. Kononova, “On minimizing dataset transfer time in an acyclic network with four servers”, Diskretn. Anal. Issled. Oper., 23:4 (2016), 5–25; J. Appl. Industr. Math., 10:4 (2016), 494–504
A. V. Kononov, “On a two-machine routing open shop problem on a two-node network”, Diskretn. Anal. Issled. Oper., 19:2 (2012), 54–74; J. Appl. Industr. Math., 6:3 (2012), 318–331
Ph. Baptiste, J. Carlier, A. V. Kononov, M. Queyranne, S. V. Sevast'yanov, M. Sviridenko, “Structural properties of optimal schedules with preemption”, Diskretn. Anal. Issled. Oper., 16:1 (2009), 3–36; J. Appl. Industr. Math., 4:4 (2010), 455–474
A. A. Ageev, V. P. Il'ev, A. V. Kononov, A. S. Televnin, “Computational complexity of the graph approximation problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:1 (2006), 3–15; J. Appl. Industr. Math., 1:1 (2007), 1–8
K. N. Kashirskich, A. V. Kononov, S. V. Sevast'yanov, I. D. Chernykh, “A polynomially solvable case of a two-stage open shop problem with three machines”, Diskretn. Anal. Issled. Oper., Ser. 1, 8:1 (2001), 23–39
A. V. Kononov, S. V. Sevast'yanov, “On the complexity of determining a connected prescribed coloring of the vertices of a graph”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:2 (2000), 21–46
A. V. Kononov, “Problems in scheduling theory on a single machine with job durations proportional to an arbitrary function”, Diskretn. Anal. Issled. Oper., Ser. 1, 5:3 (1998), 17–37
A. V. Kononov, “Combinatorial complexity of scheduling jobs with simple linear growth of processing times”, Diskretn. Anal. Issled. Oper., 3:2 (1996), 15–32
A. V. Kononov, “On the scheduling of jobs on one machine with nonlinearly dependent processing times”, Diskretn. Anal. Issled. Oper., 2:1 (1995), 21–35
1993
14.
A. V. Kononov, “Алгоритм с оценкой для задачи минимизации максимального запаздывания на однородных машинах”, Upravliaemie systemy, 1993, no. 31, 19–25
2022
15.
Yu. A. Kochetov, A. V. Kononov, N. A. Kochetova, P. A. Kononova, “International Conference “Mathematical Optimization Theory and Operations Research” (MOTOR 2022)”, Diskretn. Anal. Issled. Oper., 29:3 (2022), 5–6
Contact us: