Julia V. Kovalenko

Maria Yu. Sakhno

J. Comput. Appl. Math., 2025

2024

Adaptive Genetic Algorithm with Optimized Operators for Scheduling in Computer Systems.

[BibT_eX]

[DOI]

Yulia V. Zakharova

Maria Yu. Sakhno

Proceedings of the Intelligent Information Processing XII, 2024

2022

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

[BibT_eX]

[DOI]

Yulia V. Zakharova

J. Glob. Optim., 2022

Hybridizations of evolutionary algorithms with Large Neighborhood Search.

[BibT_eX]

[DOI]

Christian Blum

Comput. Sci. Rev., 2022

2021

Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Optimization Theory and Operations Research, 2021

Rig Routing with Possible Returns and Stochastic Drilling Times.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Optimization Theory and Operations Research, 2021

Optimal recombination and adaptive restarts improve GA performance on the asymmetric TSP.

[BibT_eX]

[DOI]

Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

2020

Approximation algorithms for energy-efficient scheduling of parallel jobs.

[BibT_eX]

[DOI]

J. Sched., 2020

A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem.

[BibT_eX]

[DOI]

Memetic Comput., 2020

Makespan Minimization for Parallel Jobs with Energy Constraint.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

A Memetic Algorithm with Parallel Local Search for Flowshop Scheduling Problems.

[BibT_eX]

[DOI]

Pavel A. Borisovsky

Proceedings of the Bioinspired Optimization Methods and Their Applications, 2020

2019

Pareto-Based Hybrid Algorithms for the Bicriteria Asymmetric Travelling Salesman Problem.

[BibT_eX]

[DOI]

Aleksey O. Zakharov

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

2018

Construction and reduction of the Pareto set in asymmetric travelling salesman problem with two criteria.

[BibT_eX]

[DOI]

Aleksey O. Zakharov

CoRR, 2018

Approximate Schedules for Non-Migratory Parallel Jobs in Speed-Scaled Multiprocessor Systems.

[BibT_eX]

[DOI]

CoRR, 2018

Reduction of the Pareto Set in Bicriteria Asymmetric Traveling Salesman Problem.

[BibT_eX]

[DOI]

Aleksey O. Zakharov

CoRR, 2018

2017

On Solving Travelling Salesman Problem with Vertex Requisitions.

[BibT_eX]

[DOI]

CoRR, 2017

Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem.

[BibT_eX]

[DOI]

Proceedings of the Large-Scale Scientific Computing - 11th International Conference, 2017

An Approximation Algorithm for Preemptive Speed Scaling Scheduling of Parallel Jobs with Migration.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017

2016

Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems.

[BibT_eX]

[DOI]

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2016

On Speed Scaling Scheduling of Parallel Jobs with Preemption.

[BibT_eX]

[DOI]

Proceedings of the Discrete Optimization and Operations Research, 2016

Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times.

[BibT_eX]

[DOI]

Proceedings of the Discrete Optimization and Operations Research, 2016

2014

Analysis of Optimal Recombination in Genetic Algorithm for a Scheduling Problem with Setups.

[BibT_eX]

[DOI]

CoRR, 2014

On Multi-product Lot-Sizing and Scheduling with Multi-machine Technologies.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2014, 2014

2013

Optimal Recombination in Genetic Algorithms.

[BibT_eX]

[DOI]