A Heuristic Model for Scheduling Large Projects with Limited Resources

Jerome D. Wiest
Additional contact information
Jerome D. Wiest: Graduate School of Business Administration, University of California, Los Angeles

Management Science, 1967, vol. 13, issue 6, B359-B377

Abstract: Present PERT-type scheduling models implicitly assume unlimited availability of resources. As most project schedulers are aware, however, activities may be constrained in their start dates by availability of resources as well as by technological orderings. Analytic solutions to the limited-resource, project scheduling problem are infeasible at present for all but small projects; heuristic approaches seem most promising of useful results. One such approach, described here, is a computer model capable of scheduling single or multiple projects within resource limits and other constraints commonly encountered by the project scheduler. The basic formulation of the model is discussed along with its scheduling heuristics which determine the period-by-period allocation of resources to activities in a project. By changing certain parameters and heuristics in the model, one can simulate project scheduling under varying constraints and scheduling rules. Applications of the model to a number of fictitious and real projects are described.

Date: 1967
References: Add references at CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.13.6.B359 (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:13:y:1967:i:6:p:b359-b377

Access Statistics for this article

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