Alexander V. Kononov

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 39

Top Topics

Parallel Machines

Top Venues

J. Glob. Optim.

Publications

Alexander V. Kononov, Marina Pakulich
An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements. J. Comb. Optim. 47 (3) (2024)
Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov
An exact solution with an improved running time for the routing flow shop problem with two machines. J. Sched. 27 (4) (2024)
Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual
Non-Clairvoyant Makespan Minimization Scheduling with Predictions. ISAAC (2023)
Alexander V. Kononov, Victor P. Il'ev
On Cluster Editing Problem with Clusters of Small Sizes. OPTIMA (2023)
Alexander V. Kononov, Yulia V. Zakharova
Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion. J. Glob. Optim. 83 (3) (2022)
Alexander V. Kononov, Irina N. Lushchakova
Cost-aware scheduling on uniform parallel machines. Comput. Ind. Eng. 167 (2022)
Alexander V. Kononov, Julia Memar, Yakov Zinder
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements. J. Glob. Optim. 83 (3) (2022)
Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Alexander V. Kononov, Kim Thang Nguyen
A simple rounding scheme for multistage optimization. Theor. Comput. Sci. 907 (2022)
Panos M. Pardalos, Alexander V. Kononov, Vladimir Mazalov
Preface to the special issue dedicated to the International Conference "Mathematical optimization theory and Operations Research" (MOTOR 2020) held online from July 6 to July 10, 2020. Optim. Lett. 16 (7) (2022)
Evripidis Bampis, Konstantinos Dogeas, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual
Scheduling with Untrusted Predictions. IJCAI (2022)
Joanna Berlinska, Alexander V. Kononov, Yakov Zinder
Two-machine flow shop with dynamic storage space. Optim. Lett. 15 (7) (2021)
Alexander V. Kononov, Yulia V. Kovalenko
Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint. MOTOR (2021)
Evripidis Bampis, Konstantinos Dogeas, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual
Speed Scaling with Explorable Uncertainty. SPAA (2021)
Alexander V. Kononov, Julia Memar, Yakov Zinder
Algorithms for Flow Shop with Job-Dependent Buffer Requirements. MCO (2021)
Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov
A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes. CoRR (2020)
Alexander V. Kononov, Alexander S. Strekalovsky, Mikhail Posypkin, Artem V. Pyatkin
Preface. J. Glob. Optim. 76 (3) (2020)
Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov
A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes. MOTOR (2020)
Evripidis Bampis, Konstantinos Dogeas, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual
Scheduling Malleable Jobs Under Topological Constraints. IPDPS (2020)
Alexander V. Kononov, Polina A. Kononova, Alexander Gordeev
Branch-and-bound approach for optima localization in scheduling multiprocessor jobs. Int. Trans. Oper. Res. 27 (1) (2020)
Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov
LP-Based Algorithms for Multistage Minimization Problems. WAOA (2020)
Alexander V. Kononov, Yulia V. Kovalenko
Approximation algorithms for energy-efficient scheduling of parallel jobs. J. Sched. 23 (6) (2020)
Alexander V. Kononov, Yulia V. Kovalenko
Makespan Minimization for Parallel Jobs with Energy Constraint. MOTOR (2020)
Alexander V. Kononov, Mikhail Y. Kovalyov, Bertrand M. T. Lin
. Theor. Comput. Sci. 793 (2019)
Yousef M. Alhamdan, Alexander V. Kononov
Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem. CSR (2019)
Alexander V. Kononov, Julia Memar, Yakov Zinder
Flow Shop with Job-Dependent Buffer Requirements - a Polynomial-Time Algorithm and Efficient Heuristics. MOTOR (2019)
Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov
LP-based algorithms for multistage minimization problems. CoRR (2019)
Joanna Berlinska, Alexander V. Kononov, Yakov Zinder
Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations. WCGO (2019)
Alexander V. Kononov, Yulia V. Kovalenko
Approximate Schedules for Non-Migratory Parallel Jobs in Speed-Scaled Multiprocessor Systems. CoRR (2018)
Hanyu Gu, Alexander V. Kononov, Julia Memar, Yakov Zinder
Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements. J. Discrete Algorithms (2018)
Luciana Arantes, Evripidis Bampis, Alexander V. Kononov, Manthos Letsios, Giorgio Lucarelli, Pierre Sens
Scheduling under Uncertainty: A Query-based Approach. IJCAI (2018)
Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko
Energy-efficient scheduling and routing via randomized rounding. J. Sched. 21 (1) (2018)
Alexander V. Kononov, Yulia V. Kovalenko
An Approximation Algorithm for Preemptive Speed Scaling Scheduling of Parallel Jobs with Migration. LION (2017)
Aldar Dugarzhapov, Alexander V. Kononov
A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job. J. Sched. 19 (1) (2016)
Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos
Clustering on k-edge-colored graphs. Discret. Appl. Math. 211 (2016)
Victor P. Il'ev, Svetlana Il'eva, Alexander V. Kononov
Short Survey on Graph Correlation Clustering with Minimization Criteria. DOOR (2016)
Alexander V. Kononov, Yulia V. Kovalenko
On Speed Scaling Scheduling of Parallel Jobs with Preemption. DOOR (2016)
Alexander Gordeev, Alexander V. Kononov, Polina A. Kononova
Optima Localization in Scheduling Multi-Processor Jobs. DOOR (Supplement) (2016)
Alexander V. Kononov, Irina N. Lushchakova
Scheduling of Two Parallel Machines with Linear Decreasing Time Slot Costs to Minimize Total Weighted Completion Time. DOOR (Supplement) (2016)
Bertrand M. T. Lin, F. J. Hwang, Alexander V. Kononov
Relocation scheduling subject to fixed processing sequences. J. Sched. 19 (2) (2016)
Alexander V. Kononov, Bertrand M. T. Lin, Kuei-Tang Fang
Single-machine scheduling with supporting tasks. Discret. Optim. 17 (2015)
Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Nemparis
From preemptive to non-preemptive speed-scaling scheduling. Discret. Appl. Math. 181 (2015)
Eric Angel, Evripidis Bampis, Vincent Chau, Alexander V. Kononov
Min-Power Covering Problems. ISAAC (2015)
Stanislaw Gawiejnowicz, Alexander V. Kononov
Isomorphic scheduling problems. Ann. Oper. Res. 213 (1) (2014)
Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Ioannis Milis
Bounded max-colorings of graphs. J. Discrete Algorithms 26 (2014)
Alexander A. Ageev, Alexander V. Kononov
Improved Approximations for the Max k-Colored Clustering Problem. WAOA (2014)
Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko
Energy Efficient Scheduling and Routing via Randomized Rounding. CoRR (2014)
Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko
Energy Efficient Scheduling and Routing via Randomized Rounding. FSTTCS (2013)
Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov
Efficient approximation algorithms for the routing open shop problem. Comput. Oper. Res. 40 (3) (2013)
Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Nemparis
From Preemptive to Non-preemptive Speed-Scaling Scheduling. COCOON (2013)
Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos
Clustering on k-Edge-Colored Graphs. MFCS (2013)
Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko
Integer preemptive scheduling on parallel machines. Oper. Res. Lett. 40 (6) (2012)
Alexander V. Kononov, Jen-Shin Hong, Polina A. Kononova, Feng-Cheng Lin
Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications. J. Sched. 15 (4) (2012)
Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko
A Complete 4-parametric complexity classification of short shop scheduling problems. J. Sched. 15 (4) (2012)
Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko
Properties of optimal schedules in preemptive shop scheduling. Discret. Appl. Math. 159 (5) (2011)
Stanislaw Gawiejnowicz, Alexander V. Kononov
Complexity and approximability of scheduling resumable proportionally deteriorating jobs. Eur. J. Oper. Res. 200 (1) (2010)
Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Ioannis Milis
Bounded Max-colorings of Graphs. ISAAC (1) (2010)
Alexander V. Kononov, Bertrand M. T. Lin
Minimizing the total weighted completion time in the relocation problem. J. Sched. 13 (2) (2010)
Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko
Integrality Property in Preemptive Parallel Machine Scheduling. CSR (2009)
Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko
Complete Complexity Classification of Short Shop Scheduling. CSR (2009)
Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Ioannis Milis
Bounded Max-Colorings of Graphs CoRR (2009)
Ilya Chernykh, Nikita Dryuck, Alexander V. Kononov, Sergey Sevastyanov
The Routing Open Shop Problem: New Approximation Algorithms. WAOA (2009)
Binay K. Bhattacharya, Yuzhuang Hu, Alexander V. Kononov
Approximation Algorithms for the Black and White Traveling Salesman Problem. COCOON (2007)
Bertrand M. T. Lin, Alexander V. Kononov
Customer order scheduling to minimize the number of late jobs. Eur. J. Oper. Res. 183 (2) (2007)
Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov
Open block scheduling in optical communication networks. Theor. Comput. Sci. 361 (2-3) (2006)
Alexander A. Ageev, Alexander V. Kononov
Approximation Algorithms for Scheduling Problems with Exact Delays. WAOA (2006)
Alexander V. Kononov, Bertrand M. T. Lin
On relocation problems with multiple identical working crews. Discret. Optim. 3 (4) (2006)
Evripidis Bampis, Alexander V. Kononov
Bicriteria approximation algorithms for scheduling problems with communications delays. J. Sched. 8 (4) (2005)
Evripidis Bampis, Rodolphe Giroudeau, Alexander V. Kononov
Scheduling Tasks with Small Communication Delays for Clusters of Processors. Ann. Oper. Res. 129 (1-4) (2004)
Evripidis Bampis, Alexander V. Kononov
Bicriteria approximation algorithms for scheduling problems with communications. SPAA (2003)
Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov
Open Block Scheduling in Optical Communication Networks. WAOA (2003)
Eric Angel, Evripidis Bampis, Alexander V. Kononov
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. Theor. Comput. Sci. 306 (1-3) (2003)
Alexander V. Kononov, Maxim Sviridenko
A linear time approximation scheme for makespan minimization in an open shop with release dates. Oper. Res. Lett. 30 (4) (2002)
Evripidis Bampis, Rodolphe Giroudeau, Alexander V. Kononov
Scheduling tasks with small communication delays for clusters of processors. SPAA (2001)
Evripidis Bampis, Alexander V. Kononov
On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements. IPDPS (2001)
Eric Angel, Evripidis Bampis, Alexander V. Kononov
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. ESA (2001)
Alexander V. Kononov, Stanislaw Gawiejnowicz
NP-hard cases in scheduling deteriorating jobs on dedicated machines. J. Oper. Res. Soc. 52 (6) (2001)
Alexander V. Kononov, Sergey V. Sevastianov, I. D. Tchernykh
When difference in machine loads leadsto efficient scheduling in open shops. Ann. Oper. Res. 92 (1999)