Bottleneck Analysis

Enter the steps of your line or process. The page finds the bottleneck, compares every step with the takt time, shows where capacity is lost and what each improvement would bring. Everything stays on your device.

1 · Demand and working time

2 · Steps of the process (in order)

Cycle time = seconds for one piece at one station. Parallel stations = machines or places doing the same step at the same time. Availability = % of the time the step really runs (stops, setups and waiting lower it). Scrap = % of pieces thrown away or reworked at this step.

3 · Results

4 · Strong points and weak points

Weak points

    Strong points

      5 · Improvement options (what if…)

      Each line changes only one thing and calculates the line again. Gains are in good pieces per day.

      Save and open

      Your work is saved automatically in this browser. Download a copy to keep it, send it to a colleague or open it on another computer.

      What is a bottleneck?

      The bottleneck is the step with the lowest capacity. It decides how many good pieces the whole line can make: an hour lost at the bottleneck is an hour lost for the whole line, while an hour saved anywhere else changes nothing.

      How the page calculates

      Takt time = net working time per day ÷ customer demand. It is the rhythm the line must keep.

      Capacity of a step = 3600 ÷ cycle time × parallel stations × availability (pieces per hour). Scrap at a step and at all later steps means that more pieces must enter, so each capacity is converted to good finished pieces per hour. The step with the lowest value is the bottleneck.

      Effective cycle time = 3600 ÷ that capacity. If it is longer than the takt time, the step cannot meet the demand. Utilization shows how busy each step is; low values mean idle time. Line balance = sum of effective cycle times ÷ (number of steps × longest effective cycle time); 100 % means perfectly even steps.

      Limits you should know

      This is a steady-state calculation for a line that runs in a fixed order. It does not model buffers between steps, batch sizes, product mix or random breakdowns in time. For those, a simulation is needed – but the bottleneck found here is usually the right place to start.