A study of using the modified label-correcting tracing algorithm to solve the critical path problem of network

The Critical Path method (CPM) can be used to determine the length of time required to complete a project with deterministic operation tirne. However, It difficultly obtains the critical path with stochastic operation time. Since the influence of path dependence is not considered in CPM. The focus of this Study is to determine the critical path for the project network with stochastic operation time. We develop all effective modified label-correcting tracing algorithm to deal with the critical path problem of stochastic network by applying Yao, Chu & Tseng (2007). Based on our numerical results from the generated instances by Monte Carlo Simulation, we Conclude that the proposed modified label-correcting tracing algorithm is an efficient Solution approach.