An extension to the branch-and-bound algorithm for the multi-mode multiple resource-constrained project scheduling problems

This paper deals with the multi-mode multiple resource-constrained project scheduling problem. The duration of each activity in the project is not only dependent upon its execution mode, but is also related to its actual start-time in a schedule. Besides, differently from the problem investigated 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.