基于自适应大邻域搜索的鲁棒多项目调度方法

多项目资源管理有时需要采用一种资源专享-转移策略，该策略下可更新资源在多项目之间不共享，但在当前项目完工之后其资源可以转移至其它还未开始的项目。针对这一实际问题的理论研究非常有限。考虑活动工期的不确定性，从时差效用函数视角评价项目调度计划的鲁棒性，在考虑拖期成本-鲁棒性的多目标问题框架下，构建了一个资源专享-转移视角下的多项目资源分配(战术层)与鲁棒调度(运作层)双层决策优化模型。针对模型的NP-hard性质和多目标组合优化特征，设计了一种新的自适应大邻域搜索(adaptive large neighborhood search，ALNS)算法求解模型。该算法采用“项目-缓冲-资源-活动”列表的混合编码表示问题可行解，提出基于四类列表的destroy-repair邻域结构，设计一种超体积指标进行自适应搜索以提高算法性能。最后，为了验证ALNS算法的适用性和有效性，设计一种NSGA-II算法作为比较基准，通过大规模仿真实验对算法性能进行了对比分析，并探索工期不确定水平对多项目调度方案鲁棒性的影响。

An Adaptive Large Neighborhood Search Metaheuristic for Robust Multi-project Scheduling

In multi-project management, it is critical to allocate limited resources among different projects and within each project, because it affects the resource utilization and the implementation of project plans. According to the execution environment of multiple projects or the characteristics of resources, there are two approaches to the management of renewable resources: resource sharing and resource dedication. The resource sharing policy has been studied a lot, but the research on the resource dedication problem is very limited. In this paper, a novel resource dedication-transferring policy for managing resources is proposed, in which renewable resources are dedicated to each individual project during execution but can be transferred to another one starting after the finish of the corresponding project.