Sobolev Institute of Mathematics
Laboratory "Mathematical Models of Decision Making"

| Sobolev Institute of Mathematics | Laboratory "Mathematical Models of Decision Making" |

Curriculum Vitae

Name: Alexander KONONOV
Date of birth: 28.08.1965
Place of birth: Leninsk-Kuzneckii, Russia
Marital status: married
Nationality: Russian

Education:

PhD in Mathematics and Physics, Sobolev Institute of Mathematics, 1999.
PhD Thesis: Complexity of scheduling problem with time dependent processing times
Advisor: Prof. Vladimir L.Beresnev.

M.D. in Applied Mathematics, Novosibirsk State University, 1989.

Positions:

• July 2015 - October 2015: Invited Researcher of Chiao Tung University (Hsinchu, Taiwan)

• October 2012 - December 2012: Invited Researcher of University Pierre et Marie Curie (Paris, France)

• October 2010 - January 2011: Invited Researcher of Chiao Tung University (Hsinchu, Taiwan)

• September 2008-January 2009 : Researcher of the University of Evry (France)

• February - July 2008: Invited Researcher of Chiao Tung University (Hsinchu, Taiwan)

• November-December 2006 : Invited Researcher of the Polytechnic School (Paris, France)

• January 2003-January 2004 date Professor of  National Chi Nan University (Puli, Taiwan)

• September 2001-September 2002 : Researcher of the University of Evry (France)

• 2001 Post Doc Researcher of the Simon Fraser University (Canada)

• November-December 2000 : Researcher of the University of Evry (France)

• 2000 Post Doc Researcher of the Simon Fraser University (Canada)

• November-December 1999 : Post Doc Researcher of the University of Evry (France)

• 1999- date: senior researcher of the Sobolev Institute of Mathematics;

• 1989 - 1999: research fellow of the Sobolev Institute of Mathematics;

Other activities:

• Scientific consultant of the Department of Technical Projects and Programming
  of the Computer Centre of West Siberian Railway
  

Scientific interests

Scheduling theory

• Problems:
  
  Shop scheduling problems;
  Scheduling problems with communication delays;
  Scheduling problems with time-dependent processing time;
  Routing scheduling problems;
  Multicriteria scheduling problems.

• Research (Questions):
  Polynomial solvable classes and complexity;
  Approximation algorithms and schemes.

Teaching:

Novosibirsk State University; 
Department of Mechanics and Mathematics

NSU Master degree Scheduling Theory

NSU Master degree Combinatorial optimization

Industrial experience

1. Development of Decision Support System for construction time-table of local trains: development of mathematical models, algorithms, design the Delphi software (1997-1998).
   

2. Participation in development of mathematical models, algorithms and software for long range strategic planing R&D programs and creation DOS application to solve multi-mode project scheduling problem with resource-constraints (1992-1993).
   

3. Participation in development of mathematical models, algorithms and software for middle-time planing on steel processing manufactory and creation DOS application to solve the large scale job-shop scheduling problems with parallel machines, release and due dates, delays and other parameters (1990-1991).

Publications

2024

I. Chernykh, A. Kononov, S. Sevastyanov. An exact solution with an improved running time for the routing flow shop problem with two machines // Journal of Scheduling. 27, 329–340 (2024).
 https://doi.org/10.1007/s10951-023-00784-8  

A. Kononov, M. Pakulich. An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements // Journal of Combinatorial Optimization. Vol. 47, article number 45 (2024)  https://doi.org/10.1007/s10878-024-01121-1

2023

 Erzin A.I. , Kononov A.V. , Melidi G.E., Nazarenko S.A., 4/3 OPT+2/3 Approximation for Big Two-Bar Charts Packing Problem // Journal of Mathematical Sciences (United States), 2023, Vol. 269. N6. pp. 813-822. https://doi.org/10.1007/s10958-023-06319-y

 A.V. Kononov, Yu.V. Zakharova. Speed Scaling Scheduling of Multiprocessor Jobs with Energy Constraint and Total Completion Time Criterion // International Journal of Artificial Intelligence. 2023 Vol. 21(2), P. 109-129.

2022

Kononov A., Zakharova Yu. Minimizing makespan for parallelizable jobs with energy constraint // Siberian Electronic Mathematical Reports 2022. Vol. 19 (2022), N 2. pp. 586-600.  DOI 10.33048/semi.2022.19.049   PDF

A. Kononov, I. Lushchakova, Cost-aware scheduling on uniform parallel machines // Computers & Industrial Engineering, (2022), Vol. 167, 107845, https://doi.org/10.1016/j.cie.2021.107845 .

Bampis E., Christou D., Escoffier B., Kononov A., Nguyen K.T.  A simple rounding scheme for multistage optimization // Theoretical Computer Science, (2022), Vol. 907, pp. 1-10, https://doi.org/10.1016/j.tcs.2022.01.009

Kononov, A., Zakharova, Y. Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion // Journal of Global Optimization, 2022. Vol. 83(3), ð. 539–564 https://doi.org/10.1007/s10898-021-01115-x

Kononov, A., Memar, J., Zinder, Y. On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements // Journal of Global Optimization, 2022. Vol. 83, P. 445-456.  https://doi.org/10.1007/s10898-021-01097-w

2021

Kononov, A., Memar, J., Zinder, Y. On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements // Journal of Global Optimization, 2021. https://doi.org/10.1007/s10898-021-01097-w

Berlińska, J., Kononov, A., Zinder, Y. Two-machine flow shop with dynamic storage space // Optimization Letters, 2021, Vol. 15(7), P. 2433–2454. https://doi.org/10.1007/s11590-020-01645-5

  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) Vol. 42, P.  276–309, https://doi.org/10.1007/s10878-021-00706-4.

2020

Berlińska, J., Kononov, A., Zinder, Y. Two-machine flow shop with dynamic storage space // Optimization Letters, 2020  Vol. 15 P. 2433–2454, https://doi.org/10.1007/s11590-020-01645-5 

Kononov, A.; Kovalenko, Y. Approximation algorithms for energy-efficient scheduling of parallel jobs // Journal of Scheduling. 2020, Vol. 23(6), P. 693–709. https://doi.org/10.1007/s10951-020-00653-8 

Kononov, A., Kononova, P., Gordeev, A. Branch-and-bound approach for optima localization in scheduling multiprocessor jobs // International Transactions in Operational Research. 2020. Vol. 27, Issue 1, P. 381-393. https://doi.org/10.1111/itor.12503 

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. 2020. Vol. 991, P. 1139-1148. https://doi.org/10.1007/978-3-030-21803-4_112 

2019

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 Vol. 13(3), ñ. 500-510. https://doi.org/10.1134/S1990478919030104 

Kononov, A.V., Kovalyov, M.Y., Lin, B.M.T. Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||C_max // Theoretical Computer Science 2019 Vol. 793, P. 70-78  https://doi.org/10.1016/j.tcs.2019.05.024 

Kononov, A., Kovalenko, Y.  Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems// Siberian Electronic Mathematical Reports 2019. Vol.16, ñ. 249-257
https://doi.org/10.33048/semi.2019.16.016

2018

  H. Gu, A. Kononov, J. Memar, Y. Zinder. Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements // Journal of Discrete Algorithms 2018, Vol. 52-53, p.143-155  https://doi.org/10.1016/j.jda.2018.11.011

 E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, M. Sviridenko, Energy-efficient scheduling and routing via randomized rounding // Journal of Scheduling, 2018, Vol. 21, pp. 35–51. https://doi.org/10.1007/s10951-016-0500-2

 

2016-...

  E. Angel, E. Bampis, A. Kononov, D. Paparas, E. Pountourakis, V. Zissimopoulos. Clustering on k-Edge-Colored Graphs, Discrete Applied Mathematics, 2016. Vol 211. P. 15-22 DOI: 10.1016/j.dam.2016.04.017

  B.M.T. Lin, F.J.Hwang, A.V. Kononov. Relocation scheduling subject to fixed processing sequences, Journal of Scheduling. 2016. Vol. 19, Issue 2, pp. 153-163, DOI: 10.1007/s10951-015-0455-8.

A. Dugarzhapov, A. Kononov. A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job,  Journal of Scheduling. 2016. Vol. 19, Issue 1. P 61-72   DOI: 10.1007/s10951-015-0454-9

A.V. Kononov, B. M.T. Lin, K.-T. Fang. Single-machine scheduling with supporting tasks, Discrete Optimization 2015. Vol. 17. P. 69-79. DOI: 10.1016/j.disopt.2015.05.001

E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, I. Nemparis.  From preemptive to non-preemptive speed-scaling scheduling.  Discrete Applied Mathematics  2015. Vol. 181. P. 11–20.

Kononov A. O(log m)-approximation for the routing open shop problem.  RAIRO Oper. Res. 2015. Vol. 49, No 2. P. 383-391 DOI: 10.1051/ro/2014051

Bampis E., A. Kononov, G. Lucarelli and I. Milis, Bounded max-colorings of graphs, Journal of Discrete Algorithms. 2014. v. 26: p. 56-68.

 Gawiejnowicz S., Kononov A., Isomorphic scheduling problems, Annals of Operations Research. 2014, Vol. 213. pp. 131-145. DOI: 10.1007/s10479-012-1222-2.

Chernykh I., Kononov A., Sevastyanov S., Efficient approximation algorithms for the routing open shop problem, Computers & Operations Research, 2013, v. 40, No. 3, pp 841-847.

  Baptiste Ph., Carlier J., Kononov A., Queyranne M., Sevastianov S., Sviridenko M., Integer preemptive scheduling on parallel machines, Operations Research Letters, v. 40, N 6, 2012, pp. 440 – 444.

  Kononov A., Sevastianov S., Sviridenko M., A complete 4-parametric complexity classification of short shop scheduling problems, Journal of Scheduling, 2012, v. 15, p 427-446.

 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, 2012, v. 15, p. 487-497.

Kononov A.  About the two-machine routing open shop problem on a 2-node network, Discrete Analysis and Operations Research, 2012, v.19,  No. 2, p. 54-74 (in Russian), translated in Journal of Applied and Industrial Mathematics, 2012, Vol. 6, No. 3, pp. 318–331.

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)

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.

Ageev A., Iliev V., Kononov A., Talevnin A. Complexity of Approximation Graph Problem, Discrete Analysis and Operations Research, series 1. 2006, v.13, N 1, p. 3-15. (in russian)

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.

Kononov A., Sevastianov S., Complexity of finding of connected, prescribed colouring, Discrete Analysis and Operations Research, 2000, v.7, ¹ 2, p.21-46. (in russian)

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.

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.

Kononov A., Scheduling Problems with Linear Increasing Processing Times. Operations Research Proceedings 1996, Springer-Verlag, Berlin, 1997, p. 90-94.

Kononov A., Complexity of scheduling problems with simple linear detoriorations. Discrete Analysis and Operations Research, 1996, v.3, ¹ 2, p.15-32. (in russian)

 

Conference Papers

 

A. Kononov, V. Il’ev. On Cluster Editing Problem with Clusters of Small Sizes. OPTIMA 2023 Lecture Notes in Computer Science.  2023. Vol. 14395. P. 316-328. https://doi.org/10.1007/978-3-031-47859-8_23

E. Bampis, A. Kononov, G. Lucarelli, F. Pascual. Non-Clairvoyant Makespan Minimization Scheduling with  Predictions. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Vol. 283, p. 9:1-9:15,  https://doi.org/10.4230/LIPIcs.ISAAC.2023.9

  A.I. Erzin, A.V. Kononov, S.A. Nazarenko, K. Sharankhaev.  An O(n log n)-time OPT+1 approximation for packing big 2-bar charts.  MOTOR 2023. Communications in Computer and Information Science 2023.  Vol. 1881, p. 122-133  https://doi.org/10.1007/978-3-031-43257-6_10

 Kononov A. , Memar J., Zinder Y. Algorithms for Flow Shop with Job–Dependent Buffer Requirements, MCO 2021 Lecture Notes in Networks and Systems. 2022. V.363 LNNS. P.63-74. DOI: 10.1007/978-3-030-92666-3_6

 Bampis E., Dogeas K., Kononov A., Lucarelli G., Pascual F. Scheduling with Untrusted Predictions // Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI-22)

July 23-29, 2022. Messe Wien, Vienna, Austria.

Bampis E., Escoffier B., Kononov A. LP-Based Algorithms for Multistage Minimization Problem // WAOA 2020, Lecture Notes in Computer Science, 2021, V. 12806, p. 1-15. DOI: 10.1007/978-3-030-80879-2_1

  Kononov, A., Kovalenko, Y. Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint //MOTOR 2021, Lecture Notes in Computer Science 2021, Vol. 12755,
P.267-279.  DOI:10.1007/978-3-030-77876-7_18

  Bampis E., Dogeas K., Kononov A., Lucarelli G., Pascual F. Speed Scaling with Explorable Uncertainty // SPAA 2021, Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, ACM, P. 83-94.

Ageev A., Kononov A. A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem // MOTOR 2020 Communications in Computer and Information Science 2020 Vol. 1275, P. 3–15.  DOI: 10.1007/978-3-030-58657-7_1

Bampis E., Dogeas K., Kononov A., Lucarelli G., Pascual F. Scheduling Malleable Jobs under Topological Constraints //  IPDPS 2020, Proceedings - 2020 IEEE 34th International Parallel and Distributed Processing Symposium, P. 316-325,  DOI: 10.1109/IPDPS47924.2020.00041

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// MOTOR 2020 Lecture Notes in Computer Science 2020, Vol. 12095, P. 301-312. DOI:10.1007/978-3-030-49988-4_21

Kononov, A., Kovalenko, Y. Makespan Minimization for Parallel Jobs with Energy Constraint // MOTOR 2020 Lecture Notes in Computer Science 2020, Vol. 12095, P.289-300.  DOI:10.1007/978-3-030-49988-4_20

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 2020 Vol. 991 P. 1139-1148 DOI: 10.1007/978-3-030-21803-4_112

Kononov, A., Memar, J., Zinder, Y.  Flow shop with job–dependent buffer requirements—a polynomial–time algorithm and efficient heuristics//Lecture Notes in Computer Science  2019 Vol. 11548, P 342-357 DOI: 10.1007/978-3-030-22629-9_24

Alhamdan, Y.M., Kononov, A. Approximability and inapproximability for maximum k-edge-colored clustering problem//Lecture Notes in Computer Science 2019 Vol. 11532, P. 1-12
DOI: 10.1007/978-3-030-19955-5_1

A. Eremeev, A. Kononov, I. Ziegler. On Complexity and Exact Solution of Production Groups Formation Problem// OPTIMA-2018 Communications in Computer and Information Science, Vol 974. p. 111-122. DOI: 10.1007/978-3-030-10934-9_8

L. Arantes, E. Bampis, A. Kononov, M. Letsios, G. Lucarelli, P. Sens. Scheduling under uncertainty: A Query-based Approach //  IJCAI International Joint Conference on Artificial Intelligence 2018-July,  p. 4646-4652

A.V. Kononov, A.A. Panin, A.V. Plyasunov. A new model of competitive location and pricing with the uniform split of the demand //OPTA-2018 Communications in Computer and Information Science. 2018. Vol. 871, p.16-28.  DOI: 10.1007/978-3-319-93800-4_2

J. Memar, Y. Zinder, A.V. Kononov. Worst-case analysis of a modification of the Brucker-Garey-Johnson algorithm // OPTA-2018 Communications in Computer and Information Science 2018, Vol. 871 , p. 78-92  DOI: 10.1007/978-3-319-93800-4_7

A. Kononov, Yu. V. Kovalenko. An approximation algorithm for preemptive speed scaling scheduling of  parallel jobs with migration // LION'17. Lecture Notes in Computer Science. Vol. 10556, p. 351–357. Springer, 2017. DOI: 10.1007/978-3-319-69404-7_30 

V. Il'ev, S. Il'eva and A. Kononov.  Short Survey on Graph Correlation Clustering with Minimization Criteria Problems // DOOR 2016. Lecture Notes in Computer Science Vol. 9869. 2016. P. 24-35.  DOI: 10.1007/978-3-319-44914-2_3

A. Kononov, Yu. Kovalenko. On Speed Scaling Scheduling of Parallel Jobs with Preemption  // DOOR 2016. Lecture Notes in Computer Science Vol. 9869. 2016. P. 293-305 DOI: 10.1007/978-3-319-44914-2_25

E. Angel, E. Bampis, V. Chau, A. Kononov, Min-Power Covering Problems // ISAAC 2015, Lecture Notes in Computer Science, 2015, V. 9472, p. 367-377.

Ageev A., Kononov A., Improved Approximation for the Max k-Colored Clustering Problem // WAOA 2014, Lecture Notes in Computer Science, 2015, Vol. 8952, P.1-10.

E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, I. Nemparis, From preemptive to non-preemptive Speed-Scaling Scheduling // COCOON 2013, Lecture Notes in Computer Science, 2013, V. 7936, p. 134-146.

E. Angel, E. Bampis, A. Kononov, D. Paparas, E. Pountourakis, V. Zissimopoulos, Clustering on k-Edge-Colored Graphs // MFCS 2013, Lecture Notes in Computer Science, 2013, V. 8087, pp 50-61

E. Bampis, D. Letsios, G. Lucarelli, M. Sviridenko, Energy Efficient Scheduling and Routing via Randomized Rounding // FSTTCS 2013, Leibniz International Proceedings in Informatics, Schloss Dagstuhl – Leibniz-Zentrum fur Informatik, Dagstuhl  Publishing, Germany, 2013. V. 24, pp 449-460.

Bampis E.,  Kononov A., Lucarelli G.,  Milis I. Bounded Max-colorings of Graphs // ISAAC 2010, Lecture Notes in Computer Science, 2010, V. 6506, p. 353-365

Chernykh I,  Dryuck N,   Kononov A., Sevastyanov S. The Routing Open Shop Problem: New Approximation Algorithms //  WAOA 2009, Lecture Notes in Computer Science, 2010, V. 5893, p. 75-85.

  Kononov A.V., Sevastjanov S.V., Sviridenko M. I. Complete Complexity Classification  of Short Shop Scheduling  // CSR 2009, Lecture Notes in Computer Science, 2009, V. 5675, p. 227-236.

  Baptiste P., Carlier J., Kononov A.V., Queyranne M., Sevastjanov S.V., Sviridenko M. I. Integrality Property in Preemptive Parallel Machine Scheduling  // CSR 2009, Lecture Notes in Computer Science, 2009, V. 5675, p. 38-46.

Bhattacharia B., Hu Y., Kononov A., Approximation Algorithms for the Black and White Traveling Salesman Problem // COCOON 2007, Lecture Notes in Computer Science, 2007, V. 4598, p. 559-567.

Ageev A., Kononov A., Approximation Algorithms for Scheduling Problems with Exact Delays // WAOA 2006, Lecture Notes in Computer Science, 2006, v 4368, p.1 - 14.

Ageev A., Fishkin A., Kononov A., Sevastianov S., Open Block Scheduling in Optical Communication Networks // WAOA 2003, Lecture Notes in Computer Science, 2004, V. 2909, p. 13-26.

Bampis E., Kononov A., Bicriteria Approximation Algorithms for Scheduling Problems with Communication Delays, Proceedings of The Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '03)).

Angel.E., Bampis E., Kononov A., A FPTAS for approximating the Pareto curve of the unrelated parallel machines scheduling problem with costs, Algorithms - ESA 2001, Lecture Notes in Computer Science. 2001, V. 2161, p. 194-205.

Bampis E., Giroudeau R., Kononov A., Scheduling tasks with small communication delays for clusters of processors, Proceedings of The Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '01)).

Bampis E., Kononov A., On the approximability of scheduling multiprocessor tasks with Time-dependent and Time Requirements, Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2001), IEEE Computer Society Press, 8 p

 E-mail: alvenko@math.nsc.ru

Update 01.11.24