关键词: 项目鲁棒调度, 资源分配, 启发式算法, 局部搜索算法

Abstract: The study of project scheduling problem has become an important content to improve the robustness of project scheduling through reasonable resource allocation. The authors propose a Max-PRUA resource allocation heuristic algorithm for improving the robustness of project scheduling by generating a reasonable resource allocation scheme. To reduce the impact of additional constraints on schedule robustness, the algorithm allocates resources by maximizing the use of priority relationship and unavoidable resource arc to reduce the amount of resources with additional constraints. The Max-PRUA algorithm also constructs a dynamic activity group GRAand introduces a local search algorithm for the optimal resource allocation scheme. We can choose the best solution from a variety of resource allocation schemes, which are obtained by rearranging the activities in the group GRA. Finally, the algorithm is validated and compared with other algorithms by extensive simulation experiments. The results show that the algorithm can adapt to the projects affected by different scales and different factors, and the resource allocation scheme generated by the algorithm has little influence on the scheduling plan robustness. The algorithm is an effective algorithm.

Key words: robust project scheduling, resource allocation, heuristic algorithm, local search algorithm