An heuristic scheduling algorithm for resource-constrained project networks.

Loading...
Thumbnail Image
Authors
Marsh, Stewart Iden Jr.
Subjects
scheduling
networks
heuristic scheduling
Advisors
McMasters, Alan W.
Date of Issue
1976-12
Date
December 1976
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
An algorithm is proposed for scheduling project networks having a single constraining resource and a constant level of available resources. The algorithm seeks to generate a minimum length schedule indirectly by maximizing the average resource utilization over the two time intervals represented by the current decision point and its successor. An attempt is made to schedule all of the activities whose predecessors have been completed, failing this all feasible subsets are considered. Where possible, the algorithm considers only those subsets which introduce new activities at the subsequent decision point.
Type
Thesis
Description
Series/Report No
Department
Operations Research
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections