A. Kononov

发表

Approximation Algorithms for Scheduling Problems with Exact Delays

A. Ageev, A. Kononov, 2006, WAOA.

RELOCATION PROBLEMS WITH MULTIPLE WORKING

B. Lin, A. Kononov, Crews, 2005 .

Competitive facility location models

A. Kononov, Y. Kochetov, A. Plyasunov, 2009 .

Computational complexity of the graph approximation problem

A. Ageev, A. Kononov, V. P. Il'ev, 2007 .

Complete Complexity Classification of Short Shop Scheduling

M. Sviridenko, A. Kononov, S. Sevastyanov, 2009, CSR.

A $4/3\cdot OPT+2/3$ approximation for big two-bar charts packing problem

A. Kononov, A. Erzin, Georgii Melidi, 2022, 2212.00944.

Approximation algorithms for energy-efficient scheduling of parallel jobs

A. Kononov, Y. V. Kovalenko, 2018, Journal of Scheduling.

A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job

A. Kononov, Aldar Dugarzhapov, 2015, Journal of Scheduling.

Scheduling with Untrusted Predictions

E. Bampis, Fanny Pascual, A. Kononov, 2022, IJCAI.

Clustering on k-edge-colored graphs

Evripidis Bampis, Alexander V. Kononov, Emmanouil Pountourakis, 2013, Discret. Appl. Math..

On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems

Evripidis Bampis, Alexander V. Kononov, Eric Angel, 2003, Theor. Comput. Sci..

A 4/3 OPT+2/3 Approximation for Big Two-Bar Charts Packing Problem

A. Kononov, A. Erzin, Georgii Melidi, 2023, Journal of Mathematical Sciences.

A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs

Evripidis Bampis, Alexander V. Kononov, Eric Angel, 2001, ESA.

Isomorphic scheduling problems

Stanislaw Gawiejnowicz, Alexander Kononov, A. Kononov, 2012, Annals of Operations Research.

Complexity and approximability of scheduling resumable proportionally deteriorating jobs

Alexander V. Kononov, Stanislaw Gawiejnowicz, A. Kononov, 2010, Eur. J. Oper. Res..

Efficient approximation algorithms for the routing open shop problem

Alexander V. Kononov, Sergey Sevastyanov, Ilya Chernykh, 2013, Comput. Oper. Res..

Branch-and-bound approach for optima localization in scheduling multiprocessor jobs

Alexander V. Kononov, Alexander Gordeev, Polina A. Kononova, 2020, Int. Trans. Oper. Res..

Optima Localization in Scheduling Multi-Processor Jobs

Alexander V. Kononov, Alexander Gordeev, Polina A. Kononova, 2016, DOOR.

On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements

Evripidis Bampis, Alexander V. Kononov, E. Bampis, 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

Isomorphic scheduling problems

A. Kononov, Stanisław Gawiejnowicz, 2014, Ann. Oper. Res..

NP-hard cases in scheduling deteriorating jobs on dedicated machines

Stanisław Gawiejnowicz, Alexander V. Kononov, A. Kononov, 2001, J. Oper. Res. Soc..

Scheduling Problems with Linear Increasing Processing Times

Alexander V. Kononov, A. Kononov, 1997 .

Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion

A. Kononov, Yulia Zakharova, 2021, Journal of Global Optimization.

Makespan Minimization for Parallel Jobs with Energy Constraint

Yulia V. Kovalenko, Alexander Kononov, A. Kononov, 2020, MOTOR.

Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||Cmax

Bertrand M. T. Lin, Mikhail Y. Kovalyov, A. V. Kononov, 2019, Theor. Comput. Sci..

A Complete 4-parametric complexity classification of short shop scheduling problems

M. Sviridenko, A. Kononov, S. Sevastyanov, 2011, Journal of Scheduling.

A simple rounding scheme for multistage optimization

K. Nguyen, B. Escoffier, E. Bampis, 2022, Theor. Comput. Sci..

Open Block Scheduling in Optical Communication Networks

Alexander V. Kononov, Aleksei V. Fishkin, Alexander A. Ageev, 2003, WAOA.

Approximation Algorithms for the Black and White Traveling Salesman Problem

Binay K. Bhattacharya, Yuzhuang Hu, Alexander Kononov, 2007, COCOON.

Energy-efficient scheduling and routing via randomized rounding

Evripidis Bampis, Maxim Sviridenko, Alexander V. Kononov, 2013, Journal of Scheduling.

From preemptive to non-preemptive speed-scaling scheduling

Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, 2013, Discret. Appl. Math..

Integrality Property in Preemptive Parallel Machine Scheduling

Philippe Baptiste, Maxim Sviridenko, Jacques Carlier, 2009, CSR.

On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements

Julia Memar, Yakov Zinder, Alexander Kononov, 2021, Journal of Global Optimization.

A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements

Yakov Zinder, Alexandr Kononov, Joey Fung, 2021, Journal of Combinatorial Optimization.

Flow Shop with Job-Dependent Buffer Requirements - a Polynomial-Time Algorithm and Efficient Heuristics

Julia Memar, Yakov Zinder, Alexander Kononov, 2019, MOTOR.

Customer order scheduling to minimize the number of late jobs

Bertrand M. T. Lin, Alexander V. Kononov, B. Lin, 2007, Eur. J. Oper. Res..

Relocation scheduling subject to fixed processing sequences

Bertrand M. T. Lin, Alexander V. Kononov, Feng-Jang Hwang, 2016, J. Sched..

Relocation scheduling subject to fixed processing sequences

B. Lin, A. Kononov, F. Hwang, 2015, Journal of Scheduling.

Single-machine scheduling with supporting tasks

Bertrand M. T. Lin, Alexander V. Kononov, Kuei-Tang Fang, 2015, Discret. Optim..

Min-Power Covering Problems

Evripidis Bampis, Alexander V. Kononov, Eric Angel, 2015, ISAAC.

ON SCHEDULES OF A SINGLE MACHINE JOBS WITH PROCESSING TIMES NONLINEAR IN TIME

A. V. Kononov, A. Kononov, 1997 .

LP-based algorithms for multistage minimization problems pdf

Evripidis Bampis, Bruno Escoffier, Alexander Kononov, 2019, WAOA.

Algorithms for Flow Shop with Job-Dependent Buffer Requirements

Alexander V. Kononov, Julia Memar, Yakov Zinder, 2021, MCO.