Julia V. Kovalenko

Orcid: 0000-0003-4791-7011

Affiliations:
  • Sobolev Institute of Mathematics, Novosibirsk, Russia


According to our database1, Julia V. Kovalenko authored at least 23 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Adaptive Genetic Algorithm with Optimized Operators for Scheduling in Computer Systems.
Proceedings of the Intelligent Information Processing XII, 2024

2022
Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion.
J. Glob. Optim., 2022

Hybridizations of evolutionary algorithms with Large Neighborhood Search.
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

Rig Routing with Possible Returns and Stochastic Drilling Times.
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
Approximation algorithms for energy-efficient scheduling of parallel jobs.
J. Sched., 2020

A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem.
Memetic Comput., 2020

Makespan Minimization for Parallel Jobs with Energy Constraint.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

A Memetic Algorithm with Parallel Local Search for Flowshop Scheduling Problems.
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

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

2017
On Solving Travelling Salesman Problem with Vertex Requisitions.
CoRR, 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

On Speed Scaling Scheduling of Parallel Jobs with Preemption.
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

On Multi-product Lot-Sizing and Scheduling with Multi-machine Technologies.
Proceedings of the Operations Research Proceedings 2014, 2014

2013
Optimal Recombination in Genetic Algorithms.
CoRR, 2013


  Loading...