Академический Документы
Профессиональный Документы
Культура Документы
A. Activity on Node (AON) network diagram done on Photoshop, Jpeg format. And all the
numbers are on days. Example: 90 days, 115 days, 129 days, etc.
FIN5003
Appu Shahi Thakuri Student ID: U1114854
B. Table representing the earliest start, earliest finish, latest start, latest finish and critical path of
each activity of the project network.
The critical path is A-F-G-D-J, cheapest crash cost on the critical path is activity G which is
$112 and we crash G first by 1 day from 14 days to 13 days.
FIN5003
Appu Shahi Thakuri Student ID: U1114854
The critical path still remains the same A-F-G-D-J but the length of the critical path is decreased by 1day.
The next cheapest activity on the critical path is D and we crash it for 1 day form 20 days to 19 days.
FIN5003
Appu Shahi Thakuri Student ID: U1114854
Still no changes in the critical path, we have to crash one more time the remaining smallest crash cost
which is F $375, from 25 to 24 days.
The Critical path is still A-F-G-D-J. The next smallest crash cost is J $1530. We cash J for 1 day from 45 to
44.
FIN5003
Appu Shahi Thakuri Student ID: U1114854
The critical path is still the same one as before. The last one left is A so, we crash it by 1 day from 90 to
89.
For the 6th time crashing we have to crash G again because there are no other left on critical path, we
crash G again for a day from 13 to 12 days.
FIN5003
Appu Shahi Thakuri Student ID: U1114854
FIN5003
Appu Shahi Thakuri Student ID: U1114854
After crashing the activity for 8 days from total 194 days to 186 days we still can’t find another critical
path. So, the additional cost would be
= 21+10+41.7+45+54+21+10+41.7
= $244.4.
$244.4 additional cost will be added to bring the computer 8 days earlier.
FIN5003