Abstract
Project scheduling techniques such as PERT and CPM are based upon project or activity networks. The algorithms required to generate an activity network from an initial list of activity precedence relationships are presented. Matrix operations are utilized to accomplish network editing which includes the determination of cycles and elimination of redundancy. Network construction involves dummy generation and nodal numbering. The minimal number of non-redundant dummy activity relationships are generated resulting in a matrix F*, which then contains the minimum number of connected activity pair relationships to completely describe an activity network. These activity pair relationships are used to create the nodes of the activity network maintaining topological order. Elementary critical path analysis techniques are presented and a scheme is given to determine the relative coordinates for graphical display of each node of the activity network. A computer program, the Analyzer, has been written in Fortran IV for the IBM Systems 360-65 computer to demonstrate the utility of the algorithms. A complete program listing and several examples of the development of activity networks are presented as Appendix A.
Stevens, William Leonard (1971). An automated method for the editing, construction and graphical display of activity networks. Doctoral dissertation, Texas A&M University. Texas A&M University. Libraries. Available electronically from
https : / /hdl .handle .net /1969 .1 /DISSERTATIONS -173236.