Operations Management and Strategic Management · Simulation and Line Balancing

Assembly Line Balancing Basics: Cycle Time and Minimum Stations

Updated 10 October 2026 · Fact-checked

Assembly line balancing assigns tasks to workstations so that each station has about equal work. First draw the precedence diagram. Then find cycle time = available time ÷ required output. Theoretical minimum stations = total task time ÷ cycle time, rounded up to the next whole number.

Understand Assembly Line Balancing Basics

An assembly line moves a product through a series of workstations. Each station does a few small tasks, called work elements. The product moves on after a fixed time. That fixed time is the cycle time.

Some tasks cannot start until others are done. You cannot paint a part before it is welded. These rules are called precedence relationships. A precedence diagram shows them. Each task is a circle or node with its time, and arrows show which task must come before which.

Line balancing means grouping the tasks into stations so that no station needs more time than the cycle time and the idle time is small. Precedence rules must be obeyed. If one station is overloaded, it slows the whole line. If one station has little work, labour is wasted.

Before you assign anything, you find the cycle time from the demand. Then you find the theoretical minimum number of stations. It is a lower limit. Real lines often need more stations because tasks cannot be split and precedence rules restrict how you group them.

This page covers the basics: the diagram, cycle time and minimum stations. Allocation rules and efficiency calculations are studied in the topic on line balancing methods and efficiency.

Key rules to remember

Cycle time: Cycle time (C) = Available production time per period ÷ Required output per period; Keep time and output in the same period, such as minutes per day and units per day. Convert hours to minutes first if task times are in minutes.
Theoretical minimum number of stations: N(min) = Σt ÷ C, rounded up to the next whole number; Σt is the sum of all task times. Always round up, never down, even if the decimal is small, such as 3.1 becomes 4.
Maximum output rate from a given cycle time: Output per period = Available time per period ÷ Cycle time; This is the reverse of the cycle time formula. Use it when the cycle time is given.
Minimum possible cycle time: Minimum cycle time ≥ the longest single task time; A task cannot be split across stations in the basic method, so the cycle time cannot be shorter than the longest task.
Maximum possible cycle time: Maximum cycle time ≤ Σt; This happens when all tasks are done at one station.
Idle time at a station: Idle time = Cycle time − Station time; Station time is the sum of times of tasks assigned to that station.

How to solve Assembly Line Balancing Basics questions

Use this order for any basic line balancing question. It keeps the working clear and earns step marks.

1List all tasks with their times and immediate predecessors in a small table.
2Draw the precedence diagram. Put each task in a node with its time, and draw arrows from predecessor to successor. Check that every arrow in the table appears.
3Add up all task times to get Σt.
4Find the cycle time. If it is not given, use available time ÷ required output. Make the time units match.
5Calculate the theoretical minimum stations = Σt ÷ C. Round up to a whole number.
6Check that the cycle time is not less than the longest task. If it is, the line cannot meet that cycle time without splitting the task.
7If asked, assign tasks to stations in precedence order so that no station time exceeds C. Write the station time and idle time for each station.
8State the final answer with units and a one-line conclusion.

Quickest way: Three-line calculation for cycle time and minimum stations

When to use it: Use it for MCQs and for the first part of a written question where only cycle time and minimum stations are asked.

Convert the available time into the same unit as the task times, usually minutes.
Divide by the required output to get C. Add up the task times to get Σt.
Compute Σt ÷ C and round up. Then compare C with the longest task as a quick check.

Common mistakes in Assembly Line Balancing Basics

Rounding the minimum number of stations down or to the nearest number
Students treat it like ordinary rounding. A result of 4.2 looks close to 4.
Fix: Always round up. You cannot have 0.2 of a station, and 4 stations would not give enough capacity.
Mixing time units when finding cycle time
The shift is given in hours, task times in minutes, and output per day.
Fix: Convert everything to minutes before dividing. Write the unit next to each number.
Drawing arrows that do not match the predecessor table
Students rush or link tasks in alphabetical order instead of using the given predecessors.
Fix: Tick each predecessor from the table as you draw its arrow. Tasks with no predecessor start the diagram.
Using only the immediate predecessor and then ignoring earlier tasks when assigning
Students forget that a task needs all its predecessors finished, not just one.
Fix: Before placing a task in a station, check that every task leading to it is already placed in the same or an earlier station.
Including idle or break time in available production time
Students use the full shift length without reading the question for breaks.
Fix: Subtract lunch, tea breaks and planned stoppages first. Use only the productive time stated.
Assuming the minimum number of stations will always be achieved
The formula looks like a final answer.
Fix: Call it theoretical. The actual number may be higher because tasks are indivisible and precedence limits grouping.

Worked examples

Example 1

A company in Pune assembles electric fans. The plant works 8 hours a day, with a 30-minute break. The target is 210 fans a day. The total of all task times is 6.5 minutes. Find the cycle time and the theoretical minimum number of workstations.

Show the solution

Available time = 8 hours × 60 − 30 = 480 − 30 = 450 minutes per day.
Cycle time = 450 ÷ 210 = 2.142857 minutes, about 2.14 minutes per fan.
Σt = 6.5 minutes.
Minimum stations = 6.5 ÷ 2.142857 = 3.033.
Round up to the next whole number, which is 4.

Answer: Cycle time is about 2.14 minutes per fan. The theoretical minimum number of workstations is 4.

Example 2

A small unit in Coimbatore assembles a pump. The tasks, times and immediate predecessors are: A (2 min, none), B (3 min, A), C (4 min, A), D (2 min, B), E (3 min, C), F (4 min, D and E). The line must produce 60 pumps in a 4-hour shift with no breaks. (a) Draw the precedence relationships. (b) Find the cycle time and the theoretical minimum number of stations. (c) Assign the tasks to stations without exceeding the cycle time.

Show the solution

(a) Precedence: A comes first and leads to B and C. B leads to D. C leads to E. D and E both lead to F. So there are two parallel paths, A-B-D-F and A-C-E-F.
(b) Available time = 4 × 60 = 240 minutes. Cycle time = 240 ÷ 60 = 4 minutes.
Σt = 2 + 3 + 4 + 2 + 3 + 4 = 18 minutes.
Minimum stations = 18 ÷ 4 = 4.5, rounded up to 5.
Check: the longest task is 4 minutes, which is not more than the cycle time of 4. So the cycle time is feasible.
(c) Check which tasks can share a station. Two tasks can share only if their times add up to 4 minutes or less. The only such pair is A (2) and D (2). But D needs B, and B needs A. B cannot sit with A because A + B = 5, which is above 4. So B must be in a later station than A, and D must be in B's station or later. A and D can never share a station.
Every other pair of tasks totals 5 minutes or more (for example B + D = 5, D + E = 5, A + B = 5), and C and F take the whole 4 minutes alone. So each task needs its own station.
Station 1: A (2). Idle time = 4 − 2 = 2 minutes.
Station 2: B (3). Idle time = 4 − 3 = 1 minute.
Station 3: C (4). Idle time = 0.
Station 4: D (2). Idle time = 2 minutes.
Station 5: E (3). Idle time = 1 minute.
Station 6: F (4). Idle time = 0. F needs both D and E, so it comes last.
Total idle time = 2 + 1 + 0 + 2 + 1 + 0 = 6 minutes. Check: 6 stations × 4 minutes = 24 minutes of capacity, and 24 − 18 = 6.
Five stations are not possible. They would need at least one pair of tasks to share a station, and we showed that no pair can.

Answer: Cycle time is 4 minutes and the theoretical minimum number of stations is 5. Because tasks cannot be split and no two tasks can share a station within 4 minutes under the precedence rules, the line needs 6 stations (A; B; C; D; E; F) with total idle time of 6 minutes. The gap between 5 and 6 shows that the theoretical minimum is only a lower limit.

Exam tips

Write the cycle time and minimum stations formulas first, then substitute. Even if arithmetic slips, you earn formula marks.
In MCQs, check the units of time and the rounding rule. Wrong options are often the unrounded value or the value from using hours instead of minutes.
When a question gives a predecessor table, draw the diagram neatly. Examiners usually give marks for it.
State clearly that the minimum number of stations is theoretical and that the actual number can be higher.
Show a small table of stations, tasks, station time and idle time. It makes the answer easy to mark.

Practice questions from Simulation and Line Balancing

Assembly Line Balancing Basics: frequently asked questions

What is cycle time in line balancing?

Cycle time is the maximum time allowed at each workstation before the product moves on. It is found by dividing the available production time by the required output. A shorter cycle time means a higher output rate.

How do you calculate the theoretical minimum number of workstations?

Add up all the task times and divide by the cycle time. Round the answer up to the next whole number. The result is a lower limit, because the actual number of stations may be higher.

What is a precedence diagram?

A precedence diagram shows the order in which tasks must be done. Each task is a node with its time, and arrows connect a task to the tasks that must follow it. You use it to make sure that your station assignment respects the sequence of work.

Why is the actual number of stations often higher than the theoretical minimum?

Tasks usually cannot be split between stations, and precedence rules limit which tasks can be grouped. This leaves some idle time at stations. So more stations may be needed than the formula suggests.