A multi-resource leveling algorithm for project networks.
Loading...
Authors
Lee, ChungUng
Subjects
project management
constrained resources
algorithms
program scheduling
constrained resources
algorithms
program scheduling
Advisors
McMasters, Alan W.
Date of Issue
1975-09
Date
September 1975
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
This thesis presents a modification and extension to the
Burgess and Killebrew heuristic resource leveling procedure
for project networks. In contrast to previous algorithms
appearing in the literature, the objective function of this
algorithm is the minimization of the sum of the squared
errors in each time period (deviations around the mean usage)
of all resources over the duration of the project. This
objective function continues the search for an improved
schedule beyond that of previous algorithms with their associated
objective functions. One important feature is that
the algorithm tends to reduce the number of periods that a
resource is idle during its duration on the project.
Type
Thesis
Description
Series/Report No
Department
Operations Research and Administrative Sciences
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
Copyright is reserved by the copyright owner