Heuristic Solution Procedure
- Start with the normal project duration
- Obtain the critical path(s)
- Choose that activity on the critical path which is cheapest
to crash.
- Crash that activity till either another path becomes critical
or the activity is fully crashed.
- Determine the most economical set of activities to be crashed
or relaxed to reduce the durations all critical paths.
- No further crashing is possible when atleast one critical
path cannot be reduced.
- When two or more activities on any path are simultaneously
crashed, some previously crashed activity on the path may be
relaxed.
|