An Algorithmic & Functional Dissection of Graphical Path Method (GPM) Float, Drift, and Total Float in Comparison to CPM Total Float
November 21, 2013
Graphical Path Method, Papers
With the advent of a novel network scheduling technique, graphical path method, new paradigms are created which, when fully understood, offer planners and schedulers insights into and flexibility around designing and optimizing networks of activities. This paper will analyze GPM float, drift, and total float in comparison to CPM total float.
Algorithms for both networking methods will be described and explained along with graphical explanatory figures detailing the comparative evaluation between CPM and GPM. This paper demonstrates how GPM provides planners with additional flexibility in network development and allows planners to solve previously intractable resource optimization problems.
Authored By:
Timothy Deane Mather, PMP, CTO, Managing Principal, PMA Consultants LLC
Dr. Liang Liu, Associate Professor & William E. O’Neil Faculty Scholar, Department of Civil and Environmental Engineering at the University of Illinois at Urbana‐Champaign
John Zann, P.E, LEED AP, Principal, PMA Consultants LLC