A Modified Heuristic Approach for Constructing AOA Networks
This paper introduces a heuristic algorithm, which focuses on constructing a unique AOA network for any project
from its activities, and immediate predecessor constraints list. The algorithm guarantees a minimum number of dummy
nodes even when the project involves multi-critical paths. The proposed algorithm can be performed manually as well as
automatically. The final output of the algorithm is to determine two network matrices that can be used directly for optimal
project scheduling. The algorithm is explained through a detailed example of the process of converting any immediate
predecessor list to AOA networks.