Combining Cycle Determination with Forward Time Calculations in Deterministic Activity Networks

Abstract

This paper describes an algorithm which combines a cycle checking procedure due to Marimont with the forward time calculations of the Montalbano algorithm. If one or more cycles are detedted, the new algorithm provides the user with diagnostic information about the activities involved in the cycles. The algorithm can provide forward and backward level partitions of the project digraph. The combined algorithm has essentially the same memory requirements and calculation time as a Montalbano procedure.