Julia V. Kovalenko
Orcid: 0000-0003-4791-7011Affiliations:
- Sobolev Institute of Mathematics, Novosibirsk, Russia
According to our database1,
Julia V. Kovalenko
authored at least 26 papers
between 2013 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Complexity and heuristic algorithms for speed scaling scheduling of parallel jobs with energy constraint.
J. Comput. Appl. Math., 2025
2024
Adaptive Genetic Algorithm with Optimized Operators for Scheduling in Computer Systems.
Proceedings of the Intelligent Information Processing XII, 2024
2023
Heuristics with Local Improvements for Two-Processor Scheduling Problem with Energy Constraint and Parallelization.
Proceedings of the Numerical Computations: Theory and Algorithms, 2023
Proceedings of the Numerical Computations: Theory and Algorithms, 2023
2022
Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion.
J. Glob. Optim., 2022
Comput. Sci. Rev., 2022
2021
Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2021
Proceedings of the Mathematical Optimization Theory and Operations Research, 2021
Optimal recombination and adaptive restarts improve GA performance on the asymmetric TSP.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021
2020
J. Sched., 2020
A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem.
Memetic Comput., 2020
Proceedings of the Mathematical Optimization Theory and Operations Research, 2020
Proceedings of the Bioinspired Optimization Methods and Their Applications, 2020
2019
Pareto-Based Hybrid Algorithms for the Bicriteria Asymmetric Travelling Salesman Problem.
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.
CoRR, 2018
Approximate Schedules for Non-Migratory Parallel Jobs in Speed-Scaled Multiprocessor Systems.
CoRR, 2018
CoRR, 2018
2017
Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem.
Proceedings of the Large-Scale Scientific Computing - 11th International Conference, 2017
An Approximation Algorithm for Preemptive Speed Scaling Scheduling of Parallel Jobs with Migration.
Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017
2016
Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2016
Proceedings of the Discrete Optimization and Operations Research, 2016
Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times.
Proceedings of the Discrete Optimization and Operations Research, 2016
2014
Analysis of Optimal Recombination in Genetic Algorithm for a Scheduling Problem with Setups.
CoRR, 2014
Proceedings of the Operations Research Proceedings 2014, 2014
2013