基于最早开始时间的项目进度关键链搜索算法

The Project Schedule Critical Chain Searching Algorithm Based on the Beginning Time Priority

针对项目进度优化调度问题,提出了一种面向资源受限约束的关键链搜索算法(ESCCPM)。当存在资源冲突时,该算法以最早开始时间优先为原则,对项目资源进行分配,并根据资源标记修改有资源冲突工序的紧前工序集。由于修改后的紧前工序集合中不仅包含由时序关系确定的工序,还包含由资源关联确定的工序,证明了该算法能够建立项目最优关键链。最后通过算例分析说明了算法执行过程,并与其他资源分配方法对比,验证了算法的有效性和正确性。

In order to solve the project schedule optimization problems,it puts forward a project critical chain searching algorithm(ESCCPM) under the resource constraint condition.When the resource is used by more than one procedure at the same time,this algorithm can reallocate the resource based on the beginning time priority of procedures.Since the updated predecessor procedure set consists of both the procedures determined by the time schedule and the ones determined by resource conflicts,it provens the ESCCPM to be the optimal algorithm.This paper implements a numerical example for demonstrating the critical chain searching steps.The comparison results with other resource allocation methods verify the effectiveness and correctness of ESCCPM.