Critical path analysis

Activity networks and critical paths

A project's activities and their dependencies form a network. A forward pass gives earliest times, a backward pass latest times. Activities with zero total float form the critical path, whose length is the minimum project duration. Total float $=$ latest finish $-$ earliest start $-$ duration. A lower bound for workers is $\left\lceil\frac{\text{total activity time}}{\text{duration}}\right\rceil$.