A branch-and-bound algorithm for the multiple resource-constrained project scheduling problem with each activity duration dependent upon its actual start-time

This paper deals with the multiple resource-constrained project scheduling problem. It is different from the problem investigated by other researchers, as the problem handled in this paper has variable resource requirements 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 to optimality.