Line balancing calculator: operators needed, balance efficiency and the slowest station

Line balancing groups the tasks of one product into stations so that no station takes longer than takt time. Enter your available time, demand and task times to get the operators needed, the balance efficiency and the slowest station. Then a simulation shows what real variation does to the line, which the paper balance cannot.

Takt time in the example1.75 min420 minutes ÷ 240 units
Operators needed6the minimum is ⌈9.0 ÷ 1.75⌉ = 6
Balance efficiency88.2%9.0 ÷ (6 × 1.7)
Time in line with variation68 minagainst 9 min of work on paper (cv 0.6)

How to balance a line

  1. Enter the available time per shift and the customer demand to get the takt time.
  2. List the work elements in the order they must be done, with the minutes each takes.
  3. Read the stations, the tasks grouped into each and the slowest station.
  4. Compare the line capacity on paper with demand: a slowest station close to takt leaves no room for variation.
  5. Press the simulation check to see throughput, time in line and waiting between stations with your variation.

Your line

Takt time = 1.75 minutes per unit.

Work elements, in the order they must be done

How much do station times vary in the simulation?
Units arrive

Starting values are an example, not data about your line. Replace them with a time study. Tasks are assigned in the order given, so list them in precedence order.

Result

Operators needed6 6 is the minimum: ⌈9 ÷ 1.75⌉
Balance efficiency88.2% 9 ÷ (6 × 1.7)
Line capacity on paper35.3/h demand 34.3/h
Slowest station1.7 min takt 1.75
Stations, their tasks, their time and their load against takt
StationTasksMinutesShare of takt
1Task 1, Task 21.797%
2Task 3, Task 41.797%
3Task 5, Task 61.797%
4Task 7, Task 81.797%
5Task 91.480%
6Task 100.846%

The paper balance has no variation and no waiting. Press the simulation check to see what your own variation adds.

Open this exact case in Simflowly

Sequential assignment, not an optimiser: a smarter grouping of tasks can need fewer stations. One operator per station, unlimited space between stations, no breakdowns or breaks.

The formulas

takt time = available time ÷ demand operators needed ≥ ⌈total work content ÷ takt time⌉ balance efficiency = total work content ÷ (stations × slowest station time) line capacity on paper = 60 ÷ slowest station time (units per hour)

Worked example

A product needs 10 tasks in a fixed order, 9.0 minutes of work in total: 0.9, 0.8, 1.2, 0.5, 1.0, 0.7, 1.1, 0.6, 1.4, 0.8. The shift has 420 available minutes and the customer wants 240 units, so takt is 1.75 minutes. These are illustrative numbers, not data from a real line.

Filling each station up to takt in task order gives 6 stations: station 1 1.7 min, station 2 1.7 min, station 3 1.7 min, station 4 1.7 min, station 5 1.4 min, station 6 0.8 min. The slowest takes 1.7 minutes, so the line can build 35.3 units an hour against 34.3 demanded. Balance efficiency is 88.2%.

What the paper balance does not show

The same six stations, the same task times, run in the Simflowly engine with units arriving exactly one per takt. Only the variation of each station's time changes (seed 7, 30 replications of 200 hours):

The balanced six-station line at three levels of variation: throughput, time in line and units waiting
Variation of each station timeUnits per hour (95% interval)Time in lineWaiting between stations
No variation (what the paper assumes)34.3 (34.3 to 34.3)9 min0.0 units
Low variation (cv 0.3)34.3 (34.3 to 34.3)23.7 min8.4 units
Medium variation (cv 0.6)34.2 (34.2 to 34.2)68 min33.7 units

Throughput holds at about 34.3 units an hour, because the line keeps up on average. What changes is time in the line: from 9 min, which is just the work, to 68 min with medium variation, with 33.7 units waiting between stations. The cause is the slowest station: at 1.7 of 1.75 minutes it is 97% loaded. An efficiency of 88% says the work is spread evenly; it does not say there is slack. To buy slack, add a station, shorten the slowest task or run a faster slowest station, and test it before you commit.

When this model is wrong

  • Precedence is only a list order. Real lines have precedence diagrams where several tasks can follow one another in parallel; reordering within them can improve the balance.
  • Mixed models. Different products with different task times on the same line need a weighted average or a model per product.
  • Operators who move. One operator per station is assumed. Floating operators, cross-training and shared crews change the result.
  • Buffers, breaks and failures. Unlimited space between stations, no breaks and no breakdowns are assumed.

Questions

How many operators do I need on an assembly line?

Divide the total work content of one unit by takt time and round up. With 9.0 minutes of work and a 1.75 minute takt that is 5.14, so 6 operators at least. Then group the tasks so that no station exceeds takt; precedence and task sizes can force one more.

What is line balancing efficiency?

Total work content divided by the number of stations times the time of the slowest station. In the example that is 9.0 ÷ (6 × 1.7) = 88.2%. The rest is idle time built into the layout. It measures how evenly work is spread, not how well the line copes with variation.

Why is a well-balanced line still late?

Balance is computed with fixed task times. In the example the slowest station needs 1.7 of the 1.75 minutes of takt, 97% loaded, so any variation builds a queue. With medium variation a unit spends 68 min in the line instead of 9 min.

Does this find the best possible balance?

No. It assigns tasks in the order you list them, filling each station up to takt, which is the textbook first pass. An optimising method that reorders tasks within precedence limits can sometimes need fewer stations or a lower slowest time. Use it as a baseline to improve, not as proof of the minimum.

Keep going

Updated 20 November 2026. Free to use, no account. The calculation runs in your browser; nothing you type is sent to us. The engine behind the simulation checks is validated against exact queueing results.