The problems involved in network planning for project control are examined with reference to the published work in this field. Various solutions are described and compared.
A detailed investigation is made of the standard assumptions concerning expected activity durations. The different approaches to the estimation of these times are shown to be inconsistent with their areas of application.
A global heuristic solution to the problem of finding the minimum value of the maximum resource requirement during a project is presented. This procedure uses a modified resource profile. The results of a comparison between this solution and a standard local solution indicate a slight improvement with a considerable increase in computing time. The new approach permits easier subminimization. A combination of these methods is proposed. / Science, Faculty of / Computer Science, Department of / Graduate
| Identifer | oai:union.ndltd.org:UBC/oai:circle.library.ubc.ca:2429/35178 |
| Date | January 1968 |
| Creators | Arden, Nicholas Russel |
| Publisher | University of British Columbia |
| Source Sets | University of British Columbia |
| Language | English |
| Detected Language | English |
| Type | Text, Thesis/Dissertation |
| Rights | For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use. |
Page generated in 0.0022 seconds