7 citations · 14 across the 6 of their papers we have counts for
6 papers
Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint
Alexander Kononov, Yulia Kovalenko
We consider the problem of scheduling multiprocessor jobs to minimize the total completion time under the given energy budget. Each multiprocessor job requires more than one proces…
Approximate Schedules for Non-Migratory Parallel Jobs in Speed-Scaled Multiprocessor Systems
Alexander Kononov, Yulia Kovalenko
We consider a problem of scheduling rigid parallel jobs on variable speed processors so as to minimize the total energy consumption. Each job is specified by its processing volume…
Construction and reduction of the Pareto set in asymmetric travelling salesman problem with two criteria
Aleksey O. Zakharov, Yulia V. Kovalenko
We consider the bicriteria asymmetric travelling salesman problem (bi-ATSP). Optimal solution to a multicriteria problem is usually supposed to be the Pareto set, which is rather w…
Reduction of the Pareto Set in Bicriteria Asymmetric Traveling Salesman Problem
Aleksey O. Zakharov, Yulia V. Kovalenko
We consider the bicriteria asymmetric traveling salesman problem (bi-ATSP). Optimal solution to a multicriteria problem is usually supposed to be the Pareto set, which is rather wi…
Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
A. V. Eremeev, Yu. V. Kovalenko
We propose a new genetic algorithm with optimal recombination for the asymmetric instances of travelling salesman problem. The algorithm incorporates several new features that cont…
On Solving Travelling Salesman Problem with Vertex Requisitions
Anton Eremeev, Yulia Kovalenko
We consider the Travelling Salesman Problem with Vertex Requisitions, where for each position of the tour at most two possible vertices are given. It is known that the problem is s…