An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints

Edward W. Davis and George E. Heidorn
Additional contact information
Edward W. Davis: Harvard University
George E. Heidorn: Naval Postgraduate School, Monterey, California

Management Science, 1971, vol. 17, issue 12, B803-B816

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.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (23)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.17.12.B803 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:17:y:1971:i:12:p:b803-b816

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().