资源约束下多项目调度的迭代算法

Iterative technique for scheduling resource constrained multiple projects

项目实施过程中往往涉及到不同项目之间的资源共享与冲突,因此在资源受限的情况下如何调度项目以满足不同项目的资源要求并缩短各项目工期是一个重要的问题.在对该问题进行分析的基础上,建立了资源约束下的多项目调度问题的数学模型,并在单项目调度迭代算法的基础上进行扩展和改进,设计了多项目调度的迭代算法.该算法结合了串行进度计划生成机制和逆向算法的优点,在保证项目任务紧前关系与资源约束的条件下,能够合理优化多项目的资源分配,从而有效地缩短多项目的总工期.通过具体实例的应用和与其他算法的比较,说明了迭代算法可以得到较好的项目进度计划.

Resource conflict was an outstanding problem in concurrent multiple projects sharing a common and limited resource pool, and it often leads to lower performance of these projects. Therefore, it was (urgent) to find an effective method for scheduling multiple projects with limited resources. A mathematical model of the resource-constrained multi-project scheduling problem was established, and an iterative forward-backward scheduling algorithm was proposed to solve this problem. The proposed algorithm expands and enhances the original iterative algorithm designed for single project scheduling, and incorporates the merits of serial schedule generation scheme and backward scheduling. The algorithm can optimize the (resource) allocation among project activities without violating precedence relations and resource constraints, and can compress the project schedules and shorten the overall project durations by using the iterative forward-backward scheduling technique. Its application in real projects and comparison with other scheduling schemes confirmed that the proposed algorithm is capable to generate effective schedules for multiple projects with limited renewable resources.