Based on the crashing analysis, what is the maximum reduction in project time if both C and D are crashed?

Based on the crashing analysis, what is the maximum reduction in project time if both C and D are crashed?

• A. 12 days
• B. 14 days
• C. 16 days
• D. 18 days

Answer: (B)

Crashing shortens activity durations on the critical path by how much each activity can be reduced to its minimum. When you crash more than one activity on that path, the total time saved is essentially the sum of the individual reductions, as long as the path remains the limiting path and you don’t crash beyond each activity’s minimum duration. In this case, the crashing analysis shows that crashing both C and D together can save a total of 14 days—the maximum achievable under the given constraints. The other numbers would require more reduction than is allowable for these activities or would depend on changes to the critical path that aren’t feasible here.

Crashing shortens activity durations on the critical path by how much each activity can be reduced to its minimum. When you crash more than one activity on that path, the total time saved is essentially the sum of the individual reductions, as long as the path remains the limiting path and you don’t crash beyond each activity’s minimum duration. In this case, the crashing analysis shows that crashing both C and D together can save a total of 14 days—the maximum achievable under the given constraints. The other numbers would require more reduction than is allowable for these activities or would depend on changes to the critical path that aren’t feasible here.