离散人工蜂群算法求解资源时变的项目调度问题

A discrete artificial bee colony algorithm for project schedulingwith time-varying resource capacities

针对资源量随时间变动的项目调度问题提出了一种新的离散人工蜂群求解算法。算法食物源的位置采用基于任务排列的编码方法,并提出一种可以保持解的离散性和可行性的候选食物源生成方法。仿真结果表明,该算法能有效地求解资源时变的受限项目调度问题,研究发现在保持资源总量不变甚至减少的情况下,通过调整资源配置能够显著缩短项目工期,可见资源配置优化在项目管理中的重要作用。

The paper provided a new discrete artificial bee colony （DABC） algorithm for project scheduling problem with timevarying resource capacities. In DABC each food source location represonts a feasible permutation of the set of activities. The paper gave a new method to produce candidate food sources which can keep the solution discrete and feasible. The simulation results show that the algorithm can effectively solve the project scheduling problem with time-varying resource capacities. Maintaining resource gross unchanged or even reduced, the makespan of project can be shorten significantly by adjusting the allocation of resources. It draw a conclusion that optimization of resource allocation is very important in project management.