A new approach to determine the critical path in stochastic activity network

Weng Ming Chu, Koan Yuh Chang, Chien-Yu Lu, Chang Hung Hsu, Chien Hung Liu, Yung Chia Hsiao

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Article number547627
JournalMathematical Problems in Engineering
Volume2014
DOIs
Publication statusPublished - 2014 Jan 1

Fingerprint

PERT
Critical Path
Random variables
Labels
Stochastic Networks
Program Evaluation
Path
Longest Path
Tracing
Shortest path
Randomness
Monte Carlo simulation
Monte Carlo Simulation
Random variable
Numerical Results

All Science Journal Classification (ASJC) codes

  • Mathematics(all)
  • Engineering(all)

Cite this

Chu, Weng Ming ; Chang, Koan Yuh ; Lu, Chien-Yu ; Hsu, Chang Hung ; Liu, Chien Hung ; Hsiao, Yung Chia. / A new approach to determine the critical path in stochastic activity network. In: Mathematical Problems in Engineering. 2014 ; Vol. 2014.
@article{8783c5e4eefe4649b1abfa37473d7e2e,
title = "A new approach to determine the critical path in stochastic activity network",
abstract = "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.",
author = "Chu, {Weng Ming} and Chang, {Koan Yuh} and Chien-Yu Lu and Hsu, {Chang Hung} and Liu, {Chien Hung} and Hsiao, {Yung Chia}",
year = "2014",
month = "1",
day = "1",
doi = "10.1155/2014/547627",
language = "English",
volume = "2014",
journal = "Mathematical Problems in Engineering",
issn = "1024-123X",
publisher = "Hindawi Publishing Corporation",

}

A new approach to determine the critical path in stochastic activity network. / Chu, Weng Ming; Chang, Koan Yuh; Lu, Chien-Yu; Hsu, Chang Hung; Liu, Chien Hung; Hsiao, Yung Chia.

In: Mathematical Problems in Engineering, Vol. 2014, 547627, 01.01.2014.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A new approach to determine the critical path in stochastic activity network

AU - Chu, Weng Ming

AU - Chang, Koan Yuh

AU - Lu, Chien-Yu

AU - Hsu, Chang Hung

AU - Liu, Chien Hung

AU - Hsiao, Yung Chia

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84901784473&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84901784473&partnerID=8YFLogxK

U2 - 10.1155/2014/547627

DO - 10.1155/2014/547627

M3 - Article

VL - 2014

JO - Mathematical Problems in Engineering

JF - Mathematical Problems in Engineering

SN - 1024-123X

M1 - 547627

ER -