Weng Ming Chu
An efficient Activity Network Reduction Algorithm based on the Label Correcting Tracing Algorithm
2064 - 2072
2009
3
8
International Journal of Computer and Information Engineering
https://publications.waset.org/pdf/15982
https://publications.waset.org/vol/32
World Academy of Science, Engineering and Technology
When faced with stochastic networks with an uncertain
duration for their activities, the securing of network completion time
becomes problematical, not only because of the nonidentical pdf of
duration for each node, but also because of the interdependence of
network paths. As evidenced by Adlakha & Kulkarni 1, many
methods and algorithms have been put forward in attempt to resolve
this issue, but most have encountered this same largesize network
problem. Therefore, in this research, we focus on network reduction
through a SeriesParallel combined mechanism. Our suggested
algorithm, named the Activity Network Reduction Algorithm
(ANRA), can efficiently transfer a largesize network into an SP
Irreducible Network (SPIN). SPIN can enhance stochastic network
analysis, as well as serve as the judgment of symmetry for the Graph
Theory.
Open Science Index 32, 2009