Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
Genetic algorithm for the resource-constrained project scheduling problem. / Goncharov, E. N.; Leonov, V. V.
в: Automation and Remote Control, Том 78, № 6, 01.06.2017, стр. 1101-1114.Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
}
TY - JOUR
T1 - Genetic algorithm for the resource-constrained project scheduling problem
AU - Goncharov, E. N.
AU - Leonov, V. V.
PY - 2017/6/1
Y1 - 2017/6/1
N2 - 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.
AB - 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.
KW - genetic algorithms
KW - PCPLIB
KW - renewable resources
KW - resource-constrained project scheduling problem
UR - http://www.scopus.com/inward/record.url?scp=85020666459&partnerID=8YFLogxK
U2 - 10.1134/S0005117917060108
DO - 10.1134/S0005117917060108
M3 - Article
AN - SCOPUS:85020666459
VL - 78
SP - 1101
EP - 1114
JO - Automation and Remote Control
JF - Automation and Remote Control
SN - 0005-1179
IS - 6
ER -
ID: 10184932