A new approximation algorithm for obtaining the probability distribution function for project completion time

Yao, Ming-Jong; Chu, Weng Ming

doi:10.1016/j.camwa.2007.01.036

Cited by 39 publications

(19 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• Critiques of the proposed activity distribution (Why is Beta assumed for the distribution of the activity duration, instead of other, maybe better distributions?) (Kotiah and Wallace 1973;Mohan and Chandrashekar 2007;Hahn 2008;Johnson 1997;Trietsch et al 2012;Premachandra and Gonzales 1996;Kamburowski 1997 (Clark 1961;Dodin 1985aDodin , 1985bAdlakha 1989;Elmaghraby 1989;Kamburowski 1992;Yao 2007).…”

Section: Foundations and Problems 21 Pert Networkmentioning

confidence: 99%

Sixty years of project planning: history and future

Hajdu

Isaac

2016

Organization, Technology and Management in Construction: An International Journal

View full text Add to dashboard Cite

Modern project management owes its reputation to the development of modern scheduling techniques based on the theory of graphs, namely, network scheduling techniques. In 2017, these techniques are celebrating their 60th birthday. This anniversary provides the opportunity to look back at the most important achievements such as non-linear activities and new precedence relations, as well as to take a look into the future. The highlights of this subjective retrospective are the presentation of the latest results and the compilation of those problems that will probably define the priorities for future research. This paper is the extended version of the keynote lecture/ presentation that has been presented at the PBE 2016 Conference (People, Buildings and Environment, Luhačovice, Czech Republic) (Hajdu 2016a).

show abstract

Section: Foundations and Problems 21 Pert Networkmentioning

confidence: 99%

Sixty years of project planning: history and future

Hajdu

Isaac

2016

Organization, Technology and Management in Construction: An International Journal

View full text Add to dashboard Cite

show abstract

“…First, there exists neither an exact data structure nor implementation scheme for the computer programming. Second, an approximated error may arise from assuming independence between subpaths in the activity network; such a bias will be getting larger when increasing the network size [19].…”

Section: The Difficulty Of Solving Critical Path In Stochastic Networkmentioning

confidence: 99%

“…A new proposed algorithm named as the modified M-LCTA is developed for CP in stochastic network. The labelcorrecting tracing algorithm (LCTA) is originally developed for approximating the completion time of stochastic network [19]. In this study, it is added with a RSDO for executing the paths sorting, so as to solve the CP.…”

Section: The Proposed Algorithm For Critical Path In a Stochastic Netmentioning

confidence: 99%

A New Approach to Determine the Critical Path in Stochastic Activity Network

Chu

Chang

et al. 2014

Mathematical Problems in Engineering

Self Cite

View full text Add to dashboard Cite

The determination of the critical path (CP) in stochastic networks is difficult. It is partly due to the randomness of path durations and partly due to the probability issue of the selection of the critical path in the network. What we are confronted with is not only the complexity among random variables but also the problem of path dependence of the network. Besides, we found that CP is not necessarily the longest (or shortest) path in the network, which was a conventional assumption in use. The Program Evaluation and Review Technique (PERT) and Critical Path Index (CPI) approaches are not able to deal with this problem efficiently. In this study, we give a new definition on the CP in stochastic network and propose a modified label-correcting tracing algorithm (M-LCTA) to solve it. Based on the numerical results, compared with Monte Carlo simulation (MCS), the proposed approach can accurately determine the CP in stochastic networks.

show abstract

“…Motivated by the heavy computational burden of simulation techniques, various researchers have published analytical methods and/or approximation methods as a worthy alternative. An overview can be found in the study of Yao and Chu [112] and will not be discussed in the current research paper. Although not very recently published, another interesting reference related to this topic is the classified bibliography of research related to project risk management written by Williams [113].…”

Section: Test Datamentioning

confidence: 99%

An Overview of Recent Research Results and Future Research Avenues Using Simulation Studies in Project Management

Vanhoucke

2013

ISRN Computational Mathematics

View full text Add to dashboard Cite

This paper gives an overview of three simulation studies in dynamic project scheduling integrating baseline scheduling with risk analysis and project control. This integration is known in the literature as dynamic scheduling. An integrated project control method is presented using a project control simulation approach that combines the three topics into a single decision support system. The method makes use of Monte Carlo simulations and connects schedule risk analysis (SRA) with earned value management (EVM). A corrective action mechanism is added to the simulation model to measure the efficiency of two alternative project control methods. At the end of the paper, a summary of recent and state-of-the-art results is given, and directions for future research based on a new research study are presented.

show abstract

A new approximation algorithm for obtaining the probability distribution function for project completion time

Cited by 39 publications

References 24 publications

Sixty years of project planning: history and future

Sixty years of project planning: history and future

A New Approach to Determine the Critical Path in Stochastic Activity Network

An Overview of Recent Research Results and Future Research Avenues Using Simulation Studies in Project Management

Contact Info

Product

Resources

About