Question

Problem 15-8 (Algo) Based on the precedence table below, identify the critical path, earliest start and finish, and slack for each task. Activity Duration (Days) Immediate Predecessor none none none KUHIGT mono 00 00 ONTHOOOO D, E G, J, K

Answer 1

ACTIVITY	DURATION	ES	EF	LS	LF	SLACK
A	8	0	8	3	11	3
B	8	0	8	6	14	6
C	9	0	9	0	9	0
D	7	8	15	11	18	3
E	4	8	12	14	18	6
F	1	9	10	9	10	0
G	9	15	24	18	27	3
H	8	10	18	10	18	0
I	1	10	11	17	18	7
J	9	18	27	18	27	0
K	9	11	20	18	27	7
L	4	27	31	27	31	0

FORWARD PASS: ES = MAXIMUM EF OF ALL PREDECESSOR ACTIVITIES; 0 IF NO PREDECESSORS ARE PRESENT. EF = ES + DURATION OF THE ACTIVITY.

BACKWARD PASS: LF = MINIMUM LS OF ALL SUCCESSOR ACTIVITIES; COMPLETION TIME OF THE PROJECT IF NO SUCCESSORS ARE PRESENT. LS = LF - DURATION OF THE ACTIVITY.

SLACK = LF - EF, OR, LS - ES

CRITICAL PATH = PATH WITH THE LONGEST COMBINED DURATION VALUE AND 0 SLACK.

CRITICAL PATH = C-F-H-J-L

DURATION OF PROJECT = 31