|
||||||||||
|
DOI: 10.17587/it.25.467-474 Yu. A. Zack, D. Sc., Aachen, Germany, e-mail: yuriy_zack@hotmail.com Various strategies and algorithms for the effective allocation of limited volumes of resources in the process of fulfilling project tasks, the sequence of which is set by the network, are considered. At various stages of development, the most important work packages have been identified that require an increase in the volumes of resources allocated with the aim of reducing their execution time. The methods proposed in the work allow to reduce the time of the critical path to complete the implementation of both individual tasks and the whole complex of project activities. The proposed algorithms are illustrated by numerical examples. P. 467–474 |