Math 108 Topics in Mathematics | James Baglama |
2.5 Critical Path Analysis - Video

2.5 Critical Path Analysis - Video

Key Ideas

The necessary arrangement of tasks in a complex job can be represented in an
order-requirement digraph (directed graph), with arrows showing the order requirements.

The longest path in an order-requirement digraph is called the critical path. The length is measured
in terms of summing the task times of the tasks making up the path. The length of the longest path corresponds to the earliest completion time.