Question

From this schedule of activities:

Activity	Immediate Predecessor	Activity Time
A	---	4
B	A	2
C	B	3
D	B	5
E	A	1
F	C, D	3
G	E, F	2

a. Draw the PERT/CPM network
b. Complete the forward and backward pass
c. Determine the critical path
d. Determine the total duration of the project.

Answer 1

ACTIVITY	DURATION	ES	EF	LS	LF	SLACK
A	4	0	4	0	4	0
B	2	4	6	4	6	0
C	3	6	9	8	11	2
D	5	6	11	6	11	0
E	1	4	5	13	14	9
F	3	11	14	11	14	0
G	2	14	16	14	16	0

FORWARD PASS = ES = MAX EF OF THE PREDECESSOR

EF = ES + DURATION

BACKWARD PASS = LF = MIN LS OF ALL PREDECESSORS

LS = LF - DURATION

CRITICAL PATH = PATH WITH LONGEST DURATION AND 0 NET SLACK

CRITICAL PATH & DURATION

A + B + D + F + G = 16