Networks - Crashing

[phanphy]

NETWORKS & Decision Maths

Can somebody explain to me the process of "Crashing" events
(reducing the time of individual events to reduce the overall time of the project)

How do you determine which ones to reduce in time?
If one decreases by a certain number, won't that change the critical path?

Thanks in advance.

[plato]

NETWORKS & Decision Maths

Can somebody explain to me the process of "Crashing" events
(reducing the time of individual events to reduce the overall time of the project)

How do you determine which ones to reduce in time?
If one decreases by a certain number, won't that change the critical path?

Thanks in advance.

Crashing is only useful when you can reduce an activity that is on the critical path.
This does not necessarily change the critical path but should reduce the project time.
It is possible that such crashing may produce a new, different critical path.

If a new critical path has been created and this has a longer completion time than the reduced original path, you must look at crashing activities on this new path. If this cannot be done, then you have reduced the original path unneccessarily too far. You should then readjust the original crashing to finish up with two critical paths of equal timing.

[phanphy]

wow, thanks heaps!
explained it way better than my teacher ;P