Evgenii N. Goncharov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Evgenii N. Goncharov has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Edward Kh. Gimadi
Sobolev Institute of Mathematics
4 shared publications - Aleksandr A. Shtepa
Novosibirsk State University
2 shared publications - D.V. Mishin
Sobolev Institute of Mathematics, Novosibirsk, Russia
1 shared publication V. V. Leonov
Russian Academy of Sciences
1 shared publicationА. А. Штепа
1 shared publication
Latest Publications
- 1 September 2025
- Published by Krasovskii Institute of Mathematics and Mechanics UB RAS in Trudy Instituta Matematiki i Mekhaniki UrO RAN
- Vol. 31 (3)
Прямо-двойственный полиномиальный приближенный алгоритм для задачи размещения предприятий
УДК 519.8+518.25 MSC: 05C09, 05C12, 05C92 DOI: 10.21538/0134-4889-2025-31-3-77-90 Работа выполнена в рамках государственного задания ИМ СО РАН (проект FWNF-2022-0019). В данной работе рассматривается задача размещения предприятий без ограничения на объемы производства. Эта задача является NP-трудной в сильном смысле. Для ее решения предлагается прямо-двойственный
- 1 September 2025
- Published by Krasovskii Institute of Mathematics and Mechanics UB RAS in Trudy Instituta Matematiki i Mekhaniki UrO RAN
- Vol. 31 (3)
Прямо-двойственный полиномиальный приближенный алгоритм для задачи размещения предприятий
УДК 519.8+518.25 MSC: 05C09, 05C12, 05C92 DOI: 10.21538/0134-4889-2025-31-3-77-90 Работа выполнена в рамках государственного задания ИМ СО РАН (проект FWNF-2022-0019). В данной работе рассматривается задача размещения предприятий без ограничения на объемы производства. Эта задача является NP-трудной в сильном смысле. Для ее решения предлагается прямо-двойственный
- 1 December 2024
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 18 (4) , 679-685
A Greedy Algorithm for the Resource-Constrained Project Scheduling Problem
The resource-constrained project scheduling problem (briefly RCPSP) is a general scheduling problem that includes precedence and resource constraints. Activities preemptions are not allowed. Resources are renewable and there is a unique way to perform the activities. The problem with renewable resources is NP-hard in the strong sense. We propose a new deterministic greedy algorithm. It is based on heuristics that use information obtained from a relaxing problem. The algorithm is tested with standard data sets given by Kolisch library PSPLIB for j60, j90, and j120 and found to be performing well.
- 1 December 2024
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 18 (4) , 679-685
A Greedy Algorithm for the Resource-Constrained Project Scheduling Problem
The resource-constrained project scheduling problem (briefly RCPSP) is a general scheduling problem that includes precedence and resource constraints. Activities preemptions are not allowed. Resources are renewable and there is a unique way to perform the activities. The problem with renewable resources is NP-hard in the strong sense. We propose a new deterministic greedy algorithm. It is based on heuristics that use information obtained from a relaxing problem. The algorithm is tested with standard data sets given by Kolisch library PSPLIB for j60, j90, and j120 and found to be performing well.
- 1 November 2022
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 16 (4) , 672-683
A Local Search Algorithm for the Resource-Constrained Project Scheduling Problem
We consider the resource-constrained project scheduling problem (RCPSP). The problem accounts for technological constraints of activities precedence together with resource constraints. All resources are renewable. Activities interruptions are not allowed. This problem is NP-hard in the strong sense. We present a new local search algorithm that uses a Tabu-list and two types of neighborhoods. The algorithm is evaluated using three data bases of instances of the problem: 480 instances of 60 activities, 480 of 90, and 600 of 120 activities, respectively, taken from the PSPLIB library available online. Numerical experiments demonstrate that the proposed algorithm produces better results than existing algorithms described in the literature for large-sized instances. For some instances from the dataset j120, the best known heuristic solutions were improved.
- 1 November 2022
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 16 (4) , 672-683
A Local Search Algorithm for the Resource-Constrained Project Scheduling Problem
We consider the resource-constrained project scheduling problem (RCPSP). The problem accounts for technological constraints of activities precedence together with resource constraints. All resources are renewable. Activities interruptions are not allowed. This problem is NP-hard in the strong sense. We present a new local search algorithm that uses a Tabu-list and two types of neighborhoods. The algorithm is evaluated using three data bases of instances of the problem: 480 instances of 60 activities, 480 of 90, and 600 of 120 activities, respectively, taken from the PSPLIB library available online. Numerical experiments demonstrate that the proposed algorithm produces better results than existing algorithms described in the literature for large-sized instances. For some instances from the dataset j120, the best known heuristic solutions were improved.
- 1 January 2022
- Published by Springer Nature
- p. 35-47
An Improved Genetic Algorithm for the Resource-Constrained Project Scheduling Problem
- 1 January 2022
- Published by Springer Nature
- p. 35-47
An Improved Genetic Algorithm for the Resource-Constrained Project Scheduling Problem
- 9 April 2021
- Published by Springer Nature
- p. 407-420
Lower Bound Polynomial Fast Procedure for the Resource-Constrained Project Scheduling Problem Tested on PSPLIB Instances
- 9 April 2021
- Published by Springer Nature
- p. 407-420
Lower Bound Polynomial Fast Procedure for the Resource-Constrained Project Scheduling Problem Tested on PSPLIB Instances
- 1 March 2021
- Published by Krasovskii Institute of Mathematics and Mechanics UB RAS in Trudy Instituta Matematiki i Mekhaniki UrO RAN
- Vol. 27 (1) , 22-36
Быстрый алгоритм вычисления нижней оценки для решения задачи ресурсно-календарного планирования с тестированием на примерах библиотеки PSPLIB
УДК 519.8 MSC: 90C10, 90B35 DOI: 10.21538/0134-4889-2021-27-1-22-36 Работа выполнена при поддержке программы фундаментальных исследований СО РАН I.5.1 (проект 0314-2019-0014) и РФФИ (проект 20-31-90091). В статье рассматривается труднорешаемая задача ресурсно-календарного планирования (ЗРКП). Предполагается, что функции интенсивности выделения и потребления ресурсов постоянны
- 1 March 2021
- Published by Krasovskii Institute of Mathematics and Mechanics UB RAS in Trudy Instituta Matematiki i Mekhaniki UrO RAN
- Vol. 27 (1) , 22-36
Быстрый алгоритм вычисления нижней оценки для решения задачи ресурсно-календарного планирования с тестированием на примерах библиотеки PSPLIB
УДК 519.8 MSC: 90C10, 90B35 DOI: 10.21538/0134-4889-2021-27-1-22-36 Работа выполнена при поддержке программы фундаментальных исследований СО РАН I.5.1 (проект 0314-2019-0014) и РФФИ (проект 20-31-90091). В статье рассматривается труднорешаемая задача ресурсно-календарного планирования (ЗРКП). Предполагается, что функции интенсивности выделения и потребления ресурсов постоянны
- 27 October 2019
- Published by Springer Nature
- p. 39-50
Variable Neighborhood Search for the Resource Constrained Project Scheduling Problem
- 27 October 2019
- Published by Springer Nature
- p. 39-50
Variable Neighborhood Search for the Resource Constrained Project Scheduling Problem
- Open Access
- 1 January 2019
- Published by National Library of Serbia in Yugoslav Journal of Operations Research
- Vol. 29 (1) , 31-42
On some implementations of solving the resource constrained project scheduling problems
We consider a resource-constrained project scheduling problem with respect to the makespan minimization criterion. The problem accounts for technological constraints of activities precedence together with resource constraints. Activities pre- emptions are not allowed. The problem with renewable resources is NP-hard in the strong sense. We propose an exact branch and bound algorithm for solving the problem with renewable resources. It uses our new branching scheme based on the representation of a schedule in form of the activity list. We use two approaches of constructing the lower bound. We present results of numerical experiments, illustrating the quality of the proposed lower bounds. The test instances are taken from the library of test instances PSPLIB.
- 1 January 2019
- Published by National Library of Serbia in Yugoslav Journal of Operations Research
- Vol. 29 (1) , 31-42
Open AccessOn some implementations of solving the resource constrained project scheduling problems
We consider a resource-constrained project scheduling problem with respect to the makespan minimization criterion. The problem accounts for technological constraints of activities precedence together with resource constraints. Activities pre- emptions are not allowed. The problem with renewable resources is NP-hard in the strong sense. We propose an exact branch and bound algorithm for solving the problem with renewable resources. It uses our new branching scheme based on the representation of a schedule in form of the activity list. We use two approaches of constructing the lower bound. We present results of numerical experiments, illustrating the quality of the proposed lower bounds. The test instances are taken from the library of test instances PSPLIB.
- 9 June 2017
- Published by Pleiades Publishing Ltd in Automation and Remote Control
- Vol. 78 (6) , 1101-1114
Genetic algorithm for the resource-constrained project scheduling problem
We consider the resource-constrained project scheduling problem with respect to the makespan minimization criterion. The problem accounts for technological constraints of activities precedence together with resource constraints. We propose a genetic algorithm with two versions of crossovers based on the idea of most rational use of constrained resources. The crossovers uses a heuristic that takes into account the degree of criticality for the resources, which is derived from the solution of a relaxed problem with a constraint on accumulative resources. A numerical experiment with examples from the PCPLIB library has shown that the proposed algorithm has competitive quality. For some examples from the j120 test series the best known solutions were improved and for j60 (50 000 and 500 000 iterations) and for j120 (500 000 iterations) we have obtain the best average deviations of the solutions from the critical path value.
- 9 June 2017
- Published by Pleiades Publishing Ltd in Automation and Remote Control
- Vol. 78 (6) , 1101-1114
Genetic algorithm for the resource-constrained project scheduling problem
We consider the resource-constrained project scheduling problem with respect to the makespan minimization criterion. The problem accounts for technological constraints of activities precedence together with resource constraints. We propose a genetic algorithm with two versions of crossovers based on the idea of most rational use of constrained resources. The crossovers uses a heuristic that takes into account the degree of criticality for the resources, which is derived from the solution of a relaxed problem with a constraint on accumulative resources. A numerical experiment with examples from the PCPLIB library has shown that the proposed algorithm has competitive quality. For some examples from the j120 test series the best known solutions were improved and for j60 (50 000 and 500 000 iterations) and for j120 (500 000 iterations) we have obtain the best average deviations of the solutions from the critical path value.