On Solving Network Fixed Logic Problem-Resource - Driven CPM Scheduling

Logic relationships of activities in a CPM network can be categorized into highly dependent and largely independent. The current available CPM scheduling techniques, however, equally treat the logic relationships and, thus, is considered as one of its major deficiencies. This paper proposes an approach that starts from a preliminary network in which highly dependent activities are sequenced according to their physical constraints while largely independent activities are initially treated as possibly being parallel. Then, a resource allocation algorithm is suggested to modify the preliminary network and to set the “sequence” of the “parallel” activities when they compete using same resources that are limited. In addition, the impacts from both network related and project related factors are included in the algorithm.