Heuristic programming, Production scheduling -- Data processing
Traditional critical path methods imply the assumption of unlimited availability of resources. Mathematical models and heuristic techniques are two alternatives that consider resource limitation to sequence the activities of a project. This research explores the consideration of project scheduling under resource constraints for the specific case of single resource, single project scheduling. A computer model called GENRES-II search model is developed using a modification of Brooks' algorithm to develop project schedules. The criteria used are various weighted combinations of ACTIM, ACTRES and ACTFOL. An improvement of GENRES-II solutions is obtained when the best set of GEN-II values is input to a computer model called COMSOAL simulation model. The criteria developed generates a large number of feasible solutions rapidly. The probability of generating optimal solutions is related to the size of the generated sample. Eight network cases were considered to validate both computer models. Special attention was given to those activities that were considered critical at a specific time. The number of resources available was increased to a new higher limit in order to schedule activities that became critical. The GENRES-II model was effective in finding project durations equal to or less than ACTIM, ACTRES, GENRES or ACTFOL. The COMSOAL model was found very effective in most of the cases in improving the GEN-II solutions.
If this is your thesis or dissertation, and want to learn how to access it or for more information about readership statistics, contact us at STARS@ucf.edu
Whitehouse, Gary E.
Master of Science (M.S.)
College of Engineering
Length of Campus-only Access
Masters Thesis (Open Access)
Rojas, Enrique J. Daboin, "Project Network Scheduling with Limited Resources Using Heuristic Solution Techniques" (1981). Retrospective Theses and Dissertations. 587.
Contributor (Linked data)
Whitehouse, Gary E., 1938- [VIAF]