Evaluating project completion time in project networks with discrete random activity durations
Deterministic models for project scheduling suffer from the fact that they assume complete information and neglect random influences, that occur during project execution. A typical consequence is the underestimation of the project duration as frequently observed in practice. This phenomenon occurs e...
Saved in:
Published in | Computers & operations research Vol. 36; no. 10; pp. 2716 - 2722 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Kidlington
Elsevier Ltd
01.10.2009
Elsevier Pergamon Press Inc |
Subjects | |
Online Access | Get full text |
ISSN | 0305-0548 1873-765X 0305-0548 |
DOI | 10.1016/j.cor.2008.11.021 |
Cover
Summary: | Deterministic models for project scheduling suffer from the fact that they assume complete information and neglect random influences, that occur during project execution. A typical consequence is the underestimation of the project duration as frequently observed in practice. This phenomenon occurs even in the absence of resource constraints and has been the subject of extensive research in the scientific community. This paper presents a method for obtaining relevant information about the project makespan for scheduling models, with dependent random processing time available in the form of scenarios. |
---|---|
Bibliography: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
ISSN: | 0305-0548 1873-765X 0305-0548 |
DOI: | 10.1016/j.cor.2008.11.021 |