Consider a project consisting of activities A, B, . . . , K. The information available on each activity can be found in Table 1. First, we are given the number of days required to perform it. Second, we have information on the predecessor activities, i.e., which activities need to be completed before that activity can start. Note that activities can be performed in parallel, as long as the predecessors constraints are not violated.
Find the critical activities, i.e., the activities that define the shortest time needed to complete the project.
