Critical Path Method Numerical Problem

EXAMPLE:

a) Construct an activity on arrow network based on the activity descriptions below. Show all your work. Label activities in the network by their activity letters and node numbers. Remove any redundant dependencies and label dummy Activities DUMMY1, DUMMY2, etc.

b) Construct a precedence network based on the same activity descriptions below. Show all your work. Label activities in the network by their activity letters and node numbers. Remove all redundant dependencies and arrange activities in proper sequence steps.

• Activities H, R2, T1 start the project.

• Activity T2 can start when Activities H, E1 and S are completed.

• Activity E1 also depends on Activity R2.

• Activity X follows Activity H and precedes Activity L.

• Activity E is preceded by Activities T2 and P1.

• The predecessors to Activity G are Activities L, T2 and P1.

• The successors to Activity T1 are Activities E1, S, W and D2.

• Activity P1 cannot begin until Activity W is finished.

• Activity P2 and F follow Activities W and D2, and precede Activities E and R1.

• Activity O2 depends on T2 and P1, and precedes Activity L.

Solution: (a):

(b):