RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Kononov, Alexander Veniaminovich

Statistics Math-Net.Ru
Total publications: 12
Scientific articles: 12

Number of views:
This page:539
Abstract pages:3042
Full texts:989
References:196
Associate professor
Doctor of physico-mathematical sciences (1999)
Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
Birth date: 28.08.1965
Phone: +7 (383) 333 20 86
Fax: +7 (383) 333 25 98
E-mail:
Website: http://www.math.nsc.ru/LBRT/k5/konon.html
Keywords: scheduling, approximation, NP-hardness.
UDC: 519.8, 519.854.2, 519.86, 519.658, 519.2, 621.391

Subject:

Operations research, Scheduling theory, Approximation algorithms.

   
Main publications:
  • 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.

http://www.mathnet.ru/eng/person27789
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/601422

Publications in Math-Net.Ru
2019
1. 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  mathnet; J. Appl. Industr. Math., 13:3 (2019), 500–510  scopus
2. A. Kononov, Yu. Kovalenko, “Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems”, Sib. Èlektron. Mat. Izv., 16 (2019),  249–257  mathnet  isi
2016
3. 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  mathnet  mathscinet  elib; J. Appl. Industr. Math., 10:4 (2016), 494–504  scopus
2012
4. 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  mathnet  mathscinet; J. Appl. Industr. Math., 6:3 (2012), 318–331
2009
5. 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  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 4:4 (2010), 455–474  scopus
6. A. V. Kononov, Yu. A. Kochetov, A. V. Plyasunov, “Competitive facility location models”, Zh. Vychisl. Mat. Mat. Fiz., 49:6 (2009),  1037–1054  mathnet  zmath; Comput. Math. Math. Phys., 49:6 (2009), 994–1009  isi  scopus
2006
7. 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  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 1:1 (2007), 1–8  scopus
2001
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  mathnet  mathscinet  zmath
2000
9. 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  mathnet  mathscinet  zmath
1998
10. 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  mathnet  mathscinet  zmath
1996
11. A. V. Kononov, “Combinatorial complexity of scheduling jobs with simple linear growth of processing times”, Diskretn. Anal. Issled. Oper., 3:2 (1996),  15–32  mathnet  mathscinet  zmath
1995
12. 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  mathnet  mathscinet  zmath

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019