Question

For the following, draw the node network, perform the CPM calculations, mark the critical Path, and complete the table.

IAAB 745 00 ABCDE Make possibility of rejection. Also show procurement activities CHAPTER 4 EXERCISES 1. For the following schedule, draw the node network, perform the CPM tions, mark the critical path, and complete the table. Activity Duration IPA ES EF LS LF TF FF В 8 B, C For the following schedule, draw the node network, perform the CPM tions, mark the critical path, and complete the table.

Answer 1

1. Network Diagram -

Network Paths and their duration -

ABD --> 3+7+5 = 15
ABE --> 3+7+8 = 18
ACE --> 3+4+8 = 15

Critical path is the path with longest duration i.e A-B-E

Project duration = duration of critical path = 18

Earliest Start (ES) = the earliest time when the activity can begin

Earliest Finish (EF) = ES + Activity Duration

Latest Finish (LF) = the latest time by whenthe activity can be finished without changing the project completion duration

Latest Start (LS) = LF - Activity Duration

Free float (FF) = (ES of next Activity – EF of current Activity)

Total Float (TF) = LS-ES = LF-EF

Computing using the above gives us the below -

Activity	Precedes	Duration	ES	EF	LS	LF	TF	FF
A	-	3	0	3	0	3	0	0
B	A	7	3	10	3	10	0	0
C	A	4	3	7	6	10	3	3
D	B	5	10	15	13	18	3	3
E	B, C	8	10	18	10	18	0	0