This study is concerned with the problem of resource-constrained project scheduling which includes splittable and nonsplittable jobs, renewable and nonrenewable resources, variation in resource availabi1ity, time-resource tradeoff, time-cost tradeoff, and multiple objectives.
The problem is formulated as a zero-one integer programming model. A specialized solution technique is developed for the preemptive goal programming, resource-constrained project. scheduling problem for time, cost, and resource leveling objectives. In addition, single objective algorithms are also provided for the time, cost, and resource leveling objectives. These algorithms are based on the idea of the implicit enumeration process, and use the special structures of the problem to expedite the search process.
Computer-generated problems are used to test each of the single objective algorithms. The results show that the algorithms give optimal solutions to tested problems with time and cost objectives using a reasonable computation time; however, heuristic solutions are more feasible for problems
with resource leveling objective. The multiple objective algorithm is illustrated through application to a warehouse
project problem. / Graduation date: 1993
| Identifer | oai:union.ndltd.org:ORGSU/oai:ir.library.oregonstate.edu:1957/35939 |
| Date | 12 March 1993 |
| Creators | Nudtasomboon, Nudtapon |
| Contributors | Randhawa, Sabah U. |
| Source Sets | Oregon State University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis/Dissertation |
Page generated in 0.0022 seconds