AN ALGORITHM TO IDENTIFY ALL PATHS IN SCHEDULING NETWORKS

The purpose of this paper is to present an algorithm that identifies every path in scheduling networks. The algorithm finds the answer by simulating the way we solve the problem by hand. The result is a list, in sequential order, of all activities involved in each path, the algorithm is divided into forward and backward passes that are repeated until all paths have been identified. Backward passes determine the existence of paths, while forward passes determine the activities involved in the paths. The algorithm has been successfully tested with 31 construction networks, and has been implemented in simulation programs used for construction scheduling and probabilistic analyses.