What Is the Critical Path in Manufacturing?

The critical path is the longest sequence of dependent routing steps that determines the earliest possible completion of a job. A job's finish date is not the sum of all its step hours; it is the length of its longest dependency chain, because steps that can run in parallel overlap in time. Any delay to a step on the critical path pushes the whole job later, while steps off the critical path carry slack and can slip somewhat without moving the finish.

This entry defines the critical path and shows how it behaves inside EDGEBIC by User Solutions. For the wider index of planning terms, see the manufacturing glossary, and for the structure the critical path is computed from, read what is a dependency graph in scheduling.

How it works

Building a house makes the idea concrete. The foundation must cure before the frame goes up, and the frame must stand before the roof goes on. That foundation to frame to roof sequence is the critical path: it dictates the earliest the house can be weatherproof. Painting the garden fence does not matter until the roof is on, so the fence has slack. You can start it late or leave it for a slow afternoon and the move-in date does not change.

A routing behaves the same way. Some steps must follow others: you cannot deburr a part before you machine it, and you cannot assemble before the components exist. Other steps run in parallel on different machines and overlap. The finish date is set by tracing the longest connected chain of must-follow steps from start to end. Steps on that chain have zero slack; a delay to any of them delays the job. Steps on shorter parallel branches have positive slack equal to how much longer the critical chain is than their own branch.

This matters because it tells a planner where effort pays off. Shortening a step that sits on the critical path pulls the whole finish date in. Shortening a step with slack does nothing to the finish date; the saving just vanishes into that branch's spare time. The critical path is the map of which delays are dangerous and which are harmless. It draws that map assuming a machine is free whenever a step is ready; count contention for shared resources as well and you get the critical chain, which is usually the longer and more honest number.

A concrete example

A job has five steps. Step 10, cut material, feeds two parallel branches: step 20, machine part A, taking six hours, and step 30, machine part B, taking four hours. Both branches feed step 40, assemble, which feeds step 50, quality check.

Step 20 and step 30 start together after cutting. Assembly cannot begin until both are done, so it waits on the longer branch, step 20 at six hours, not on the four plus six total. The critical path runs 10, 20, 40, 50. Step 30 has two hours of slack: it could take up to six hours and still finish in time to feed assembly. If a planner speeds step 30 from four hours to three, the finish date does not budge, because step 30 was never critical. To move the finish date, the planner must attack step 20, step 40, or step 50.

How EDGEBIC uses it

EDGEBIC schedules from the dependency structure of each routing, which is exactly the information the critical path is derived from. When it schedules a job, the engine builds a dependency graph of the routing steps, orders them so every predecessor is placed before its dependent step, and times each step from the completion of the steps that feed it. Parallel branches overlap, and a joining step waits for the latest of its feeders, which is precisely the critical-path rule.

Because the engine respects those dependencies, the planned finish date it produces reflects the longest dependent chain rather than the raw sum of step hours. On the Gantt view a planner can see which steps line up back to back with no gap, the critical chain, and which sit on shorter parallel branches with room to spare. That distinction guides where to add capacity, where a delay will hurt, and where slack absorbs small slips without touching the promise date.

To understand the graph the critical path is traced through, continue with what is a dependency graph in scheduling. For the ordering method that respects those dependencies, read what is a topological sort in job scheduling. And for the plant-wide constraint that is a different limit on time, see production bottleneck identification.