Scribd
Upload
2 views

Project Crashing T9Q1 (b)

The document outlines a project management analysis focusing on the critical path and crashing costs associated with various activities. It details the maximum time available for crashing, time reductions possible, and the corresponding costs for each activity. The analysis includes comments on the feasibility of time reductions based on existing and non-existing paths in the project schedule.

Uploaded by

alice jiahuii
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Project Crashing T9Q1 (b)

The document outlines a project management analysis focusing on the critical path and crashing costs associated with various activities. It details the maximum time available for crashing, time reductions possible, and the corresponding costs for each activity. The analysis includes comments on the feasibility of time reductions based on existing and non-existing paths in the project schedule.

Uploaded by

alice jiahuii
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Critical Path Crashing cost Max time Activity to Time Crashing A-C-G-H A-C-D-E-F-H B-G-H B-D-E-F-H

of Activities available for be crashed reduction cost spend


crash
17 20 18 21

B-D-E-F-H B=667 B=3 D 2 300(2) 17 18 18 19 Commented [TJH1]: Can straight away cut 2 months bcoz
D=300 D=2 =600 fulfil the rule RT of existing path is more than or equal RT of
non-existing path. So, can cut one month only
E=350 E=1
F=450 F=2 Commented [TJH2]: Minus two weeks bcoz time
H=1000 H=1 reduction (2)

B-D-E-F-H B=667 B=3 E 1 350 17 17 18 18


E=350 E=1
F=450 F=2
H=1000 H=1

B-D-E-F-H B=667 B=3 B 1 667 17 17 17 17 Commented [TJH6]: Cannot straight away cut max 2
B-G-H H=1000 H=1 months bcoz after cut 2 months, we cannot fulfil the rule RT
of existing path is more than or equal RT of non-existing
F&G=810 F&G=2
path. So, can cut one month only
2 5
B-D-E-F-H H=1000 H=1 F&G 1 810 16 16 16 16 Commented [TJH3]: Left F&G can do pair
B-G-H A&B=1067 A&B=2 Commented [TJH4]: 450+360
A-C-G-H B&C=1167 2 2
Commented [TJH5]: Follow the lowest value for crash
A-C-D-E-F-H F&G=810 B&C=1 time
3 1
F&G=2 Commented [TJH8]: B ald use one week so left 2
2 5
Commented [TJH7]: Left A B C F G, can do pair
2427 A&B; A&C; A&F; A&G
B&C; B&F; B&G
C&F; C&G
F&G
*choose those can cut equally one month

You might also like