An algorithm is described which permits the computation of optimal (minimum-duration) solutions for the resource-constrained project network scheduling problem under conditions of multiple resource requirements per job (activity). The approach is a form of bounded enumeration and employs...

The problem addressed is that of scheduling the activities of a project network to minimize project duration under conditions of multiple limited resource requirements and availabilities. Various heuristic sequencing rules have been applied to this problem, and the effectiveness of these rules...