A multi-resource leveling algorithm for project networks.

Download
Author
Lee, ChungUng
Date
1975-09Advisor
McMasters, Alan W.
Second Reader
Howard, Gilbert T.
Metadata
Show full item recordAbstract
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.
Rights
Copyright is reserved by the copyright ownerCollections
Related items
Showing items related by title, author, creator and subject.
-
An algorithm for scheduling a ship's force during a shipyard overhaul.
Karadaḡ, Osman (Monterey, California. Naval Postgraduate School, 1980-09);This thesis considers the combining of a ship overhaul project network with a shipyard project network to minimize possible scheduling conflicts during the ship overhaul process. The combined project is called the ship ... -
An heuristic scheduling algorithm for resource-constrained project networks.
Marsh, Stewart Iden Jr. (Monterey, California. Naval Postgraduate School, 1976-12);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 ... -
Resource constrained scheduling problem at U.S. Naval Shipyards
Nawara, Terrence M. (Monterey California. Naval Postgraduate School, 2013-06);Submarine repair schedules are some of the most complex schedules seen in project management. Repairs of a nuclear U.S. submarine are resource constrained since resources are divided among approximately thirty shops (e.g., ...