A new approach to determine the critical path in stochastic activity network
From MaRDI portal
Publication:1718645
DOI10.1155/2014/547627zbMath1407.90088OpenAlexW2123862452WikidataQ59065938 ScholiaQ59065938MaRDI QIDQ1718645
Yung-Chia Hsiao, Chang-Hung Hsu, Weng-Ming Chu, Koan-Yuh Chang, Chien-Hung Liu, Chien-Yu Lu
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/547627
Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15)
Uses Software
Cites Work
- Unnamed Item
- The use of cutsets in Monte Carlo analysis of stochastic networks
- An upper bound on the expected completion time of PERT networks
- Approximating the distribution functions in stochastic networks
- Optimal paths in probabilistic networks: A case with temporary preferences
- PSPLIB -- a project scheduling problem library
- On criticality and sensitivity in activity networks
- Path critical index and activity critical index in PERT networks
- A new approximation algorithm for obtaining the probability distribution function for project completion time
- Optimal paths in graphs with stochastic or multidimensional weights
- Determining the K Most Critical Paths in PERT Networks
- Normally Distributed Activity Durations in PERT Networks
- Approximating the Criticality Indices of the Activities in PERT Networks
- A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987
- A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems
- Stochastic shortest path problems with recourse
- Shortest paths in stochastic networks with ARC lengths having discrete distributions
- Distribution of the Time Through a Directed, Acyclic Network
- On computing the distribution function of the sum of independent random variables
This page was built for publication: A new approach to determine the critical path in stochastic activity network
