An activity-list-based nested partitions algorithm for resource-constrained project scheduling
提出一种基于活动列表的嵌套划分算法（ALNP）及其改进版P-ALNP，用于求解资源受限项目调度问题，实验表明该算法在大规模复杂问题上优于传统串行调度方案。
The resource-constrained project scheduling problem (RCPSP) has received wide attention. In this paper, an activity-list-based nested partitions algorithm (ALNP) is developed for solving the RCPSP and a P-ALNP is proposed to improve ALNP with local adjustment. In the algorithms, to improve the search efficiency, a partial double justification is employed as local search mechanism. The computational experiments on the PSPLIB and analysis on robustness of the algorithms show that ALNP outperforms the traditional serial scheduling scheme for solving the large-scale, complex RCPSPs, and P-ALNP can improve ALNP and obtain better results. P-ALNP is a competitive algorithm for solving the RCPSP.