Professional Documents
Culture Documents
Given:
Activity A B C D E F G
Predecessors - - A A,B D C.E E
Expected time (Weeks) 7 9 12 8 9 6 5
Earliest Start
Earliest Finish
Activity
Activity A ES EF
t LS LF
Activity time
Activity
Latest Start Latest Finish
A C F
START
B D E
A C
7 12
FINISH START
G
B D
9 8
EF = ES + t
FORWARD PASS A 0 7 C
7 12
START
(highest)
B 0 9 D
9 8
BACKWARD PASS A 0 7 C
7 2 9 12
START
(highest if forward)
B 0 9 D
9 0 9 8
START
0
B 0 9 D
9 0 9 8
FINISH
E G
9 5
7 19 F 26 32
6
32
FINISH
(highest)
9 17 E 17 26 G 26 31
9 5
7 19 F 26 32
14 26 6 26 32
32
FINISH
highest if forward) (lowest if backward)
9 17 E 17 26 G 26 31
9 17 9 17 26 5 27 32
7 0
7 19 F 26 32
14 26 6 26 32
32
FINISH
0 0 1
9 17 E 17 26 G 26 31
9 17 9 17 26 5 27 32
3. Determine project completion time
KWARD PASS, WE START HERE!
LS = LF - t
Project Scheduling
Finding the Critical Path
TRY THIS!
Given:
Activity 1-2 1-3 2-4 2-5 3-5 4-5 5-6
Predecessors - - 1-2 2-4 1-3 2-4 3-5; 4-5
Expected time (Weeks) 8 4 6 11 9 3 1
Requirements:
1. Construct a project network
2.Perform a forward and backward passes
3.Determine project completion time
4. Calculate slack value
5. Determine the critical path
Earliest Start
Earliest Finish
Activity
Activity A ES EF
t LS LF
ActivityActivity
time
FINISH START
5-6
1-3
4
EF = ES + t
START
1-3 0
4
orward and backward passes
START
1-3 0
4 4
START
1-3 0
4 0
2-5 3-5
11 9
8 2-4 8 14
6
(highest)
4 2-5 8 19 3-5 19
11 9
8 2-4 8 14
8 6 22 28
(highest if forward)
4 2-5 8 19 3-5 19
8 11 8 19 9 19
-4 10
8 2-4 8 14
4 6 18 24
0 0
4 2-5 4 15 3-5 15
4 11 4 15 9 15
4-5 28 31
3
31
28 5-6 28 29 FINISH
1
4-5 28 31
3 28 31
(lowest if backward) 31
28 5-6 28 29 FINISH
28 1 30 31
0
4-5 24 27
3 24 27
0 2 27
24 5-6 24 25 FINISH
24 1 26 27
3. Determine project completion time