项目鲁棒调度的资源分配启发式算法研究  

Research on Resource Allocation Heuristic Algorithm for Robust Project Scheduling

作　　者：庞南生[1] 叶博童 PANG Nan-sheng;YE Bo-tong(School of Economics and Management, North China Electronic Power University, Beijing 102206, China)

机构地区：[1]华北电力大学经济与管理学院,北京102206

出　　处：《运筹与管理》2021年第8期21-27,共7页Operations Research and Management Science

基　　金：国家自然科学基金资助项目(71840004)。

摘　　要：合理的资源配置是提高项目调度鲁棒性一种有效的方法。本文针对项目鲁棒调度问题,提出了Max-PRUA资源分配启发式算法,以期通过生成鲁棒性高的资源分配方案来提高调度计划的鲁棒性。本算法设计了最大化利用优先关系和不可避免弧传递资源的资源分配两项策略来传递最大资源量,以减少由额外约束传递的资源量,降低对项目调度鲁棒性的影响。为寻优最优资源分配方案,配合局部搜索算法,本算法构建了动态活动组GRA,通过对组内活动顺序重排以生成多种资源分配方案,以利于从解空间中寻优出最佳的鲁棒性方案。最后通过大量的仿真实验验证和与其它算法进行比较,结果表明本算法对于不同规模和不同因素影响的项目均有较好的适应性,生成的资源分配方案对调度计划鲁棒性影响较小,是一种有效的算法。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.

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

分 类 号：F224[经济管理—国民经济]