An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints

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 techniques originally developed for the solution of the assembly line balancing problem. Initial computational results are given, along with an example of the type problems solved. Among the advantages of the procedure are that resource requirements can vary over job duration, and various assumptions concerning job continuity are allowable, with no extra computational effort.