THE USE OF ARCS AND NODES FOR THE DETERMINATION OF CRITICAL PATHS IN PERT/CPM NETWORKS
Anne B. Koehler, Richard H. McClure
Abstract
Anne B. Koehler, Richard H. McClure
Abstract
ABSTRACT The critical path in a PERT/CPM network is determined in various textbooks by finding the path with associated minimal slack for the network arcs or by finding the path with associated minimal slack for the network nodes. This paper points out that the use of nodes can result in a network path being incorrectly identified as a path of maximum length.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
ABSTRACT The critical path in a PERT/CPM network is determined in various textbooks by finding the path with associated minimal slack for the network arcs or by finding the path with associated minimal slack for the network nodes. This paper points out that the use of nodes can result in a network path being incorrectly identified as a path of maximum length.
Key concepts: Path (computing), Critical path method, Computer science, Longest path problem, Path length, Mathematical optimization, Topology (electrical circuits), Algorithm