392. Line Balancing

The task of allocating work to stations on a production line so each station’s work time is below the takt time, minimizing idle time and station count.

392.1. Setup

Goals (often trade-offs):

392.2. Theoretical bounds

Minimum stations:

𝑁𝑖𝑡𝑖takt

(Total work ÷ takt time, rounded up.)

Minimum cycle time: max𝑖𝑡𝑖 (longest indivisible task sets a floor).

392.3. Balance efficiency

Balance efficiency=𝑖𝑡𝑖𝑁cycle time

100% means every station fully loaded — no idle time. Lower efficiency means wasted capacity.

392.4. Heuristics

The problem (Assembly Line Balancing Problem, ALBP) is NP-hard. Common heuristics:

Longest Task Time (LTT): pick assignable tasks (precedences satisfied, fits in remaining station time) in decreasing order of 𝑡𝑖.

Ranked Positional Weight (RPW, Helgeson-Birnie 1961):

  1. Compute each task’s positional weight = 𝑡𝑖 + sum of 𝑡𝑗 for all successors 𝑗
  2. Assign tasks in decreasing positional weight, respecting precedences

COMSOAL (Arcus 1966): Random assignment with backtracking. Multi-start.

392.5. Worked example

10 tasks with times (5,3,4,6,4,5,4,3,5,4), total =43 minutes. Takt time =8 minutes.

Minimum stations: 438=6.

LTT heuristic with simple precedence chain: place tasks into stations one at a time, picking the longest available task that fits.

Result might give 6 or 7 stations, balance efficiency 89%–100%.

392.6. Mixed-model line balancing

Real lines produce multiple products with different task sets. Mixed-model balancing:

392.7. Single-product vs U-shaped lines

LayoutProsCons
Straight linesimple, fastworkers can’t help each other
U-shapedworkers reach multiple stations, can help bottleneckmore complex, requires multi-skilled workers
Cellflexible, small batchescoordinating multiple cells

U-shaped (cellular) layout is the lean ideal — natural for CONWIP / kanban control.

392.8. Variability and balance

Even a perfectly balanced deterministic line behaves much worse than the formula suggests when variability is added (per VUT). Real balancing requires both:

Otherwise the high-variance station becomes a “virtual bottleneck” that drives queueing throughout.

392.9. See also