The critical path is your minimum duration — no amount of parallelization or resources can compress time below this chain

Why This Is a Rule

The critical path — the longest sequential chain of dependent tasks — sets the absolute minimum duration for any project. If tasks A→B→C form a chain where each depends on the previous one's output and takes 3 days each, the minimum duration is 9 days. You can add ten more people, parallelize everything else, and eliminate all non-critical tasks — but those 9 days are irreducible because the dependency chain is the binding constraint.

Fred Brooks's insight from "The Mythical Man-Month" applies: adding resources to a late project makes it later, because the critical path can't be compressed by throwing people at non-critical tasks. The only way to shorten total duration is to shorten the critical path itself — either by making individual critical-path tasks faster or by restructuring dependencies to create a shorter chain.

Identifying the critical path is therefore the first step in any time optimization effort, because optimizing non-critical tasks (no matter how dramatically) produces zero reduction in total duration. It's Only optimize the constraint — verify that improving a loop component would increase total system throughput before investing effort (optimize only the constraint) applied to time.

When This Fires

• When planning any multi-step project with dependencies between steps
• When optimizing a workflow for speed — identify what actually constrains total time before optimizing anything
• When a project is running late and you need to determine where intervention will actually help
• When estimating realistic minimum duration for a project with multiple parallel and serial streams

Common Failure Mode

Optimizing non-critical tasks: "We reduced the documentation step from 5 days to 2 days!" If documentation isn't on the critical path, this saves zero days on the project timeline. The critical path tasks still take the same amount of time. The team feels productive (3 days saved!) while the project's actual completion date hasn't changed.

The Protocol

(1) Map all tasks and their dependencies (Map agent dependencies and arrange in topological order — no agent executes before its required inputs are available). (2) For each path through the dependency graph, sum the durations of all tasks on that path. (3) The longest sum is the critical path. This is your minimum project duration. (4) All optimization effort for schedule compression must target critical-path tasks. Non-critical tasks can be delayed, reduced, or removed without affecting the timeline. (5) After shortening a critical-path task, re-evaluate: the critical path may have shifted to a different chain. Follow the new critical path. (6) Accept the critical path as a hard constraint: promising delivery before the critical path duration is mathematically impossible without restructuring dependencies.