任务工期随实际开工时间变化的RCPSP精确算法

A Branch-and-bound Algorithm for RCPSP with Each Activity Duration Dependent upon Its Actual Start-Time

针对资源受限项目调度展开讨论 .与前人研究的侧重点有所不同 ,我们考虑了项目中每个任务工期随其实际开工时间而变化、任务对可更新 (再生 )资源需求的任意分布、以及可更新 (再生 )资源的最大供给量随着时间而变化的一般情形 .作为对前人研究结果的进一步推广 ,我们利用分枝定界技术 ,以及事件驱动的时间增量方式 ,成功地获得了这种一般的项目调度问题的最优解 .

This paper deals with the multiple resource\|constrained project scheduling problem (RCPSP). Differently from the problem investigated by other researchers, the problem handled in this paper is with variable resource requirement and variable renewable resource availability constraints. Besides, the duration of each activity in the project is dependent upon its actual start\|time. As an extension, the branch\|and\|bound algorithm put forward in this paper can solve this kind of general project scheduling problems with optimality.