A Branch-and-bound Algorithm for RCPSP with Each Activity Duration Dependent upon Its Actual Start-Time
任务工期随实际开工时间变化的RCPSP精确算法

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.