An Extension to the DH-Branch-and-Bound Algorithm for MRCPSP
MRCPSP的一种精确算法

This paper deals with the multi mode multiple resource constrained project scheduling problem (MRCPSP). The duration of each activity in the project is not only dependent upon its executive mode,but also related to its actual start time in a schedule.Besides,differently from the problem invesigated by other researchers,the problem handled is with variable resource requirement and variable renewable resource availability constraints.As an extension,the branch and bound algorithm put forward can solve this kind of most general project scheduling problems with optimality.