An Algorithm for Changing Network Configurations

  • 발행 : 1977.12.31

초록

PERT/CPM type scheduling systems use a network to graphically portray the interrelationship among the activities of a project. This network representation of the project schedule shows all the precedence relationship regarding the order in which tasks must be performed. In this paper an algorithm is presented that changes the network configurations without violating precedence relationship of the original network.

키워드