Abstract
The determination of the Critical Path (CP) in stochastic networks has being a hard work, it is because of path durations are random variables and the selection of the critical path in the network causes probability problems. In this study, the authors have given a new definition on the CP in stochastic network and developed a modified Label-Correcting Tracing Algorithm (LCTA) to solve it. Based on the numerical results, as compared with Monte Carlo Simulation (MCS), it is proved that the proposed approach can accurately solve the CP in stochastic networks.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2014 International Symposium on Computer, Consumer and Control, IS3C 2014 |
| Publisher | IEEE Computer Society |
| Pages | 1123-1128 |
| Number of pages | 6 |
| ISBN (Print) | 9781479952779 |
| DOIs | |
| Publication status | Published - 2014 Jan 1 |
| Event | 2nd International Symposium on Computer, Consumer and Control, IS3C 2014 - Taichung, Taiwan Duration: 2014 Jun 10 → 2014 Jun 12 |
Publication series
| Name | Proceedings - 2014 International Symposium on Computer, Consumer and Control, IS3C 2014 |
|---|
Other
| Other | 2nd International Symposium on Computer, Consumer and Control, IS3C 2014 |
|---|---|
| Country | Taiwan |
| City | Taichung |
| Period | 14-06-10 → 14-06-12 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Control and Systems Engineering
Cite this
}
A new approach to determine the critical path in stochastic activity network. / Chu, Eng Ming; Chang, Koan Yuh; Lu, Chien-Yu; Hsu, Chang Hung; Liu, Chien Hung; Hsiao, Yung Chia.
Proceedings - 2014 International Symposium on Computer, Consumer and Control, IS3C 2014. IEEE Computer Society, 2014. p. 1123-1128 6846084 (Proceedings - 2014 International Symposium on Computer, Consumer and Control, IS3C 2014).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - A new approach to determine the critical path in stochastic activity network
AU - Chu, Eng 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 has being a hard work, it is because of path durations are random variables and the selection of the critical path in the network causes probability problems. In this study, the authors have given a new definition on the CP in stochastic network and developed a modified Label-Correcting Tracing Algorithm (LCTA) to solve it. Based on the numerical results, as compared with Monte Carlo Simulation (MCS), it is proved that the proposed approach can accurately solve the CP in stochastic networks.
AB - The determination of the Critical Path (CP) in stochastic networks has being a hard work, it is because of path durations are random variables and the selection of the critical path in the network causes probability problems. In this study, the authors have given a new definition on the CP in stochastic network and developed a modified Label-Correcting Tracing Algorithm (LCTA) to solve it. Based on the numerical results, as compared with Monte Carlo Simulation (MCS), it is proved that the proposed approach can accurately solve the CP in stochastic networks.
UR - http://www.scopus.com/inward/record.url?scp=84904409174&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84904409174&partnerID=8YFLogxK
U2 - 10.1109/IS3C.2014.292
DO - 10.1109/IS3C.2014.292
M3 - Conference contribution
SN - 9781479952779
T3 - Proceedings - 2014 International Symposium on Computer, Consumer and Control, IS3C 2014
SP - 1123
EP - 1128
BT - Proceedings - 2014 International Symposium on Computer, Consumer and Control, IS3C 2014
PB - IEEE Computer Society
ER -