Operations Management and Strategic Management · Simulation and Line Balancing

Line Balancing Methods and Efficiency Explained

Updated 10 October 2026 · Fact-checked

Line balancing assigns tasks to workstations so each station's work is close to the cycle time while respecting precedence. Find the cycle time and minimum stations, assign tasks by a rule such as largest task time or ranked positional weight, then compute efficiency = total task time ÷ (stations × cycle time) × 100.

Understand Line Balancing Methods and Efficiency

An assembly line splits a job into small tasks and places them at workstations. Each product moves from station to station. The line can only move as fast as its slowest station, so uneven work wastes time.

Line balancing means grouping tasks into stations so that every station has nearly the same workload. You must obey two limits. First, a station's total time cannot exceed the cycle time. Second, precedence must be respected: a task cannot start before the tasks it depends on are done.

Cycle time is the maximum time allowed at each station per unit. It is set by the output you need: cycle time = available production time ÷ required output. Takt time is the same calculation viewed from the customer side: available time ÷ customer demand. Takt time is the pace demanded by the market. Cycle time is the pace the line actually runs at, and it should not be longer than takt time if demand is to be met. In many exam problems the two numbers are equal, but the ideas differ.

Exact balancing is hard, so we use heuristic rules. The largest task time rule picks, among tasks that are eligible, the one with the longest time. The ranked positional weight (RPW) method gives each task a weight equal to its own time plus the times of all tasks that follow it. Tasks are ranked from highest weight to lowest and assigned in that order. Both rules give good, not always perfect, answers.

After assigning, you measure quality. Idle time is the unused time at stations. Balance delay is the percentage of total available time that is idle. Efficiency is the percentage that is used productively. Efficiency and balance delay always add up to 100%.

Key rules to remember

Cycle time: Cycle time = Available production time per period ÷ Required output per period; Use the same time unit for both. Subtract breaks before computing available time.
Takt time: Takt time = Available time ÷ Customer demand; The pace set by demand. Cycle time should be less than or equal to takt time.
Theoretical minimum stations: N(min) = Σ task times ÷ Cycle time, rounded up to the next whole number; Always round up, never down.
Positional weight: RPW of a task = its own time + times of all tasks that follow it; Include every successor, direct and indirect, once each.
Station idle time: Idle time of a station = Cycle time − Sum of task times at that station; Total idle time = N × Cycle time − Σ task times.
Efficiency: Efficiency (%) = Σ task times ÷ (N × Cycle time) × 100; N is the actual number of stations used.
Balance delay: Balance delay (%) = 100 − Efficiency = Total idle time ÷ (N × Cycle time) × 100; Lower is better.

How to solve Line Balancing Methods and Efficiency questions

Use this order for any line balancing question. It works whichever heuristic the question names.

1Write down the task times, precedence relations and required output. Compute the cycle time (or note the one given) and check that no single task time exceeds it.
2Add all task times and compute the minimum number of stations by dividing by cycle time and rounding up.
3Apply the rule asked. For RPW, compute each task's weight and rank the tasks. For largest task time, list the tasks by time.
4Open Station 1. From the tasks that are eligible (all predecessors already assigned) and that fit in the remaining time, pick the one the rule prefers. Assign it and reduce the remaining time.
5Repeat until no eligible task fits. Then open the next station and continue until all tasks are assigned.
6Show a table with station, tasks, task time total and idle time.
7Compute total idle time, efficiency and balance delay using the number of stations actually used. Comment on how close it is to the minimum.

Quickest way: Table-first RPW shortcut

When to use it: Use when the question gives a small precedence diagram of 6 to 12 tasks and asks for RPW or a station allocation with efficiency.

Work backwards from the last task: its weight is its own time. Then each earlier task is its own time plus successors already summed.
Write the ranked order in one line.
Fill stations one by one, crossing off tasks. At each step check the precedence first, then the time that remains.
Get efficiency as Σ times ÷ (N × cycle time). You do not need to compute each idle time separately.
Check: efficiency plus balance delay must equal 100%.

Common mistakes in Line Balancing Methods and Efficiency

Rounding the minimum number of stations down
Students round 3.4 to 3 out of habit.
Fix: Always round up. Three stations cannot hold 3.4 cycles of work.
Assigning a task before its predecessor
The task has the highest rank or time, so it looks like the next choice.
Fix: Before each assignment, check that all predecessors are already placed. Only eligible tasks may be chosen.
Leaving out indirect successors in positional weight
Students add only the tasks that follow immediately.
Fix: Add every task that must come after, directly or through other tasks, counting each once.
Computing efficiency with the theoretical minimum stations
The minimum was just calculated, so it is reused.
Fix: Use the number of stations your allocation actually needs.
Confusing cycle time with takt time
Both are found as time ÷ number of units.
Fix: Takt time uses customer demand. Cycle time is the line's pace per unit. State the difference in one line if asked.
Ignoring time left at a station that could fit a smaller task
Students move to the next station once the best task does not fit.
Fix: Before closing a station, scan every eligible task for one that still fits.

Worked examples

Example 1

A line has tasks A to F with times (minutes) A 4, B 3, C 5, D 2, E 4, F 2. Precedence: A before B and C; B and C before D; D before E; E before F. The line must make 60 units in a 300-minute shift. Find the cycle time and minimum stations, and allocate tasks using the largest task time rule. Find the efficiency and balance delay.

Show the solution

Cycle time = 300 ÷ 60 = 5 minutes. The largest task (C = 5) does not exceed it.
Total time = 4 + 3 + 5 + 2 + 4 + 2 = 20 minutes. Minimum stations = 20 ÷ 5 = 4.
Station 1: only A is eligible. Assign A (4). Remaining 1 minute. B (3) and C (5) do not fit. Close Station 1 with idle time 1.
Station 2: B and C are eligible. The largest is C (5). Assign C. Remaining 0. Station 2 total 5, idle 0.
Station 3: B is eligible. Assign B (3). Remaining 2. D (2) is now eligible and fits. Assign D. Total 5, idle 0.
Station 4: E (4) is eligible. Assign E. Remaining 1. F (2) does not fit. Idle 1.
Station 5: F (2). Idle 3.
Stations used = 5. Total idle time = 1 + 0 + 0 + 1 + 3 = 5 minutes. Check: 5 × 5 − 20 = 5.
Efficiency = 20 ÷ (5 × 5) × 100 = 80%. Balance delay = 20%.

Answer: Cycle time 5 minutes; minimum stations 4; the rule uses 5 stations; efficiency 80%; balance delay 20%.

Example 2

Tasks and times (minutes): P 6, Q 5, R 4, S 3, T 2. Precedence: P before Q and R; Q before S; R before S; S before T. Cycle time is 10 minutes. Using ranked positional weight, allocate tasks to stations and find efficiency.

Show the solution

Positional weights: T = 2. S = 3 + 2 = 5. Q = 5 + S + T = 5 + 3 + 2 = 10. R = 4 + 3 + 2 = 9. P = 6 + Q + R + S + T = 6 + 5 + 4 + 3 + 2 = 20.
Ranking from highest: P (20), Q (10), R (9), S (5), T (2).
Total time = 6 + 5 + 4 + 3 + 2 = 20. Minimum stations = 20 ÷ 10 = 2.
Station 1: assign P (6). Remaining 4. Q (5) is eligible but does not fit. R (4) is eligible and fits. Assign R. Remaining 0. Station 1 total 10, idle 0.
Station 2: Q is eligible. Assign Q (5). Remaining 5. S now eligible (P, Q, R done) and fits (3). Assign S. Remaining 2. T (2) is eligible and fits. Assign T. Station 2 total 10, idle 0.
Stations used = 2. Total idle time = 0.
Efficiency = 20 ÷ (2 × 10) × 100 = 100%. Balance delay = 0%.

Answer: Station 1: P and R; Station 2: Q, S and T. Efficiency 100%; balance delay 0%.

Exam tips

Show the cycle time, total time and minimum stations first. Examiners give step marks for these even if the allocation goes wrong.
Draw a small allocation table with station, tasks, time and idle time. It is easier to mark and easier for you to check.
For MCQs, compute efficiency as Σ times ÷ (N × cycle time). Check whether the question asks for efficiency or balance delay before you choose an option.
Write one line of interpretation, such as which station is the bottleneck or how close the line is to the minimum stations.
If asked for the difference between cycle time and takt time, state that takt is demand-driven and cycle time is the actual line pace.

Practice questions from Simulation and Line Balancing

Line Balancing Methods and Efficiency: frequently asked questions

What is the difference between cycle time and takt time?

Takt time is available time divided by customer demand. It is the pace the market needs. Cycle time is the time each station is allowed per unit on the line. Cycle time should be no more than takt time, or demand will not be met.

How do I apply the ranked positional weight method?

Compute each task's weight as its own time plus the times of all tasks that follow it. Rank tasks from highest weight to lowest. Assign tasks to stations in that order, skipping any that do not fit or whose predecessors are not done.

How do I calculate line efficiency and balance delay?

Efficiency = total task time ÷ (number of stations × cycle time) × 100. Balance delay = 100 minus efficiency. Use the actual number of stations in your allocation.

Do different heuristics give different answers?

They can. Heuristics are rules of thumb and do not always give the best allocation. Follow the rule named in the question and state any tie-breaking choice you make.