针对一类多技能人力资源约束的项目调度问题(PSPMSWC),提出了一种两阶段优化算法,并按算法步骤对模型进行了分解.算法针对分解后的子模型,应用遗传局域搜索及CPLEX优化软件对模型进行求解,并设计了整体迭代求解策略,从而确保所有问题案例都能够进行求解.通过引用基于标准问题库中的典型问题,生成了大量随机算例,并对算法进行了求解实验.实验结果显示,所有案例均能够迅速求解,部分案例可达到最优,从而证明该方法是一种求解PSPMSWC的有效方法,具有较强的实际意义.
A two-stage optimization algorithm was represented to solve one type of project scheduling problems with multi-skilled workforce constraints (PSPMSWC). The model of PSPMSWC was proposed and decomposed into sub-models corresponding to the algorithm. By using hybrid genetic local search (GLS) and CPLEX optimization software, a strategy to iteratively solve the sub-models in sequence was proposed to ensure that all the instances could be solved successfully. Instances were randomly generated from a standard problem library and utilized to test the performance of algorithm experimentally. Computational results show that all of instances can be solved efficiently, with some of instances having the optimal values. Therefore, the two-stage algorithm is proved to be a good method to solve PSPMSWC with practical significance.