Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
