Câu 3 + 6
Câu 3 + 6
Câu 3 + 6
0 7 7 10
A 7 B 7
0 7 7 10
10 12
Start
E 2 Finish
0 6 6 9 10 12
C 6 D 3
1 7 7 10
I 2
A 3 C 6 F 3
H 3
D 4 G 7
Critical Paths:
• A-B-E-I = 3 + 4 + 5 + 2 = 14 days
• A-C-F-H-I = 3 + 6 + 3 + 3 + 2 = 17 days
• A-D-G-H-I = 3 + 4 + 7 + 3 + 2 = 19 days
A is the critical activity with the lowest cost. We perform crashing project as follows:
• Crashing A by 1 day:
Total crash cost: $50
Project duration: 19 - 1 = 18 days
(A-B-E-I = 2 + 4 + 5 + 2 = 13 days
A-C-F-H-I = 2 + 6 + 3 + 3 + 2 = 16 days
A-D-G-H-I = 2 + 4 + 7 + 3 + 2 = 18 days)
• Crashing G by 1 day:
Total crash cost: $50 + $120 = $170
Project duration: 18 - 1 = 17 days
(A-B-E-I = 2 + 4 + 5 + 2 = 13 days
A-C-F-H-I = 2 + 6 + 3 + 3 + 2 = 16 days
A-D-G-H-I = 2 + 4 + 6 + 3 + 2 = 17 days)
• Crashing G by 1 day:
Total crash cost: $170 + $120 = $290
Project duration: 17 - 1 = 16 days
(A-B-E-I = 2 + 4 + 5 + 2 = 13 days
A-C-F-H-I = 2 + 6 + 3 + 3 + 2 = 16 days
A-D-G-H-I = 2 + 4 + 5 + 3 + 2 = 16 days)
• Project appears 2 critical paths with 16 days, based on existing data we have feasible
combinations of crashing activities:
+(G; C) with additional crashing cost is $(120 + 200) = $320
+(G, F) with additional crashing cost is $(120 + 80) = $200
+(A), (H), (I), (D, C), (D, F) are rejected because no available time to crash
=> Crashing F and G by 1 day, we have:
Total crash cost:
$290 + $200 = $490 > $400