Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Logistics and Maritime Studies | en_US |
| dc.contributor.advisor | Song, Miao (LMS) | en_US |
| dc.creator | Chen, Siyuan | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/12591 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | en_US |
| dc.rights | All rights reserved | en_US |
| dc.title | Robust optimization for generalized project networks | en_US |
| dcterms.abstract | Completion time estimation is a key component for project management. In addition to uncertain task times, uncertain task outcomes also have a significant impact on the evaluation of completion time. For example, due to some uncontrolled factors in a project, certain task may have a probability of failure, which will result in full repetition or partial rework of the task. Introduction of new task or change of precedence relationships may occur during project execution as a contingency measure. Another example is probabilistic branching, i.e., after the project reaches a milestone, it may be necessary to choose among alternative plans by that time. However, these uncertainties are often ignored in standard approaches, e.g., the program evaluation and review technique (PERT). In this thesis, we introduce the generalized project network to capture all the uncertainties in both task durations and task outcomes. A distributionally robust optimization model is developed to estimate the project completion time as well as the target-based measure of tardiness. We develop an efficient algorithm to solve the distributionally robust optimization model. The performance of the estimates obtained through distributionally robust optimization is evaluated through numerical studies. Numerical studies show that our model is practical and general to capture all the uncertainties in both task durations and task outcomes in completion time estimation problems. The proposed algorithm demonstrates exceptional efficiency, allowing us to solve one large size project instance, solved by the simulation method in the literature, in 98.2 seconds. | en_US |
| dcterms.extent | vi, 69 pages : color illustrations | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2023 | en_US |
| dcterms.educationalLevel | M.Phil. | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.LCSH | Project management | en_US |
| dcterms.LCSH | Production scheduling -- Mathematical models | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | open access | en_US |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/12591