9.6 Assembly Line Balancing, Precedence Constraints & Efficiency Heuristics

9.6 Assembly Line Balancing, Precedence Constraints & Efficiency Heuristics

In high-volume repetitive manufacturing, components flow sequentially through a series of physical workstations arranged along a paced conveyor or transfer mechanism. Assembly Line Balancing (ALB) is the mathematical and operational procedure of partitioning the total product assembly work content among workstations such that idle time is minimized, technological precedence rules are satisfied, and customer demand requirements are fulfilled.

---

1. The Assembly Line Balancing Problem (ALBP)

An assembly line consists of $N$ sequential workstations ($k = 1, 2, \dots, N$). The complete product assembly is decomposed into $n$ indivisible work elements (tasks), each requiring a deterministic standard processing time $t_i$ ($i = 1, 2, \dots, n$).

Mathematical Formulation

Let $S_k$ represent the set of tasks assigned to workstation $k$. The total station service time ($ST_k$) at workstation $k$ is:

$ST_k = \sum_{i \in S_k} t_i$

The optimization model seeks to partition all $n$ tasks into $N$ workstations subject to three structural constraints:

1. Work Completion Constraint: Every task $i \in \{1, \dots, n\}$ must be assigned to exactly one workstation $k$: $\bigcup_{k=1}^N S_k = \{1, 2, \dots, n\} \quad \text{and} \quad S_j \cap S_k = \emptyset \quad \forall j \neq k$
2. Precedence Constraint: If task $i$ is a technological prerequisite for task $j$ ($i \prec j$), then task $i$ must be assigned to an earlier or identical workstation ($k(i) \le k(j)$).
3. Cycle Time Constraint: The total service time at every workstation cannot exceed the established cycle time $C$: $ST_k \le C \quad \forall k = 1, 2, \dots, N$

Problem Typology

• Simple Assembly Line Balancing Problem 1 (SALBP-1): Minimize the number of workstations $N$ required to achieve a fixed, given cycle time $C$.
• Simple Assembly Line Balancing Problem 2 (SALBP-2): Minimize the cycle time $C$ (maximize production rate) for a fixed, predetermined number of workstations $N$.

---

2. Precedence Diagrams and Graph Theory

Technological assembly dependencies are formally modeled as a Directed Acyclic Graph (DAG), denoted $G = (V, E)$:

• Vertices ($V$): Nodes representing elemental tasks, each annotated with its task identifier and task duration $t_i$.
• Directed Edges ($E$): Directed arrows $(i, j)$ indicating that task $i$ is an immediate technological predecessor of task $j$.

Loading diagram...

This is the precedence network used in the worked RPW example below.

Graph Terminology

• Immediate Predecessors ($IP_i$): Tasks that must be completed immediately prior to the start of task $i$.
• All Predecessors: The complete set of ancestor tasks that must precede task $i$ directly or transitively.
• Immediate Followers ($IF_i$): Tasks that can begin only after task $i$ finishes.
• All Followers: The complete set of downstream descendant tasks dependent upon the completion of task $i$.
• Total Work Content ($T_{wc}$): The algebraic sum of all elemental task times across the entire product: $T_{wc} = \sum_{i=1}^n t_i$

---

3. Key Line Balancing Parameters and Performance Metrics

Before allocating tasks to stations, the industrial engineer must establish operational boundary parameters:

1. Desired Production Rate ($R_d$) and Cycle Time ($C$)

The line pacing is dictated by required market demand ($D$) over a specified net operating period ($T_{\text{net}}$):

$C = \frac{T_{\text{net}}}{D} = \frac{\text{Net Available Operating Time per Day}}{\text{Required Daily Production Volume}}$

2. Theoretical Minimum Number of Workstations ($N_{\min}$)

Under idealized conditions of zero idle time, the minimum number of stations required is total work content divided by cycle time. Because stations must be integer-valued, the theoretical lower bound is given by the ceiling function $\lceil \cdot \rceil$:

$N_{\min} = \left\lceil \frac{T_{wc}}{C} \right\rceil = \left\lceil \frac{\sum_{i=1}^n t_i}{C} \right\rceil$

3. Workstation Idle Time ($I_k$) and Total Line Idle Time ($IT$)

• Workstation Idle Time ($I_k$): The unused capacity at workstation $k$: $I_k = C - ST_k$
• Total System Idle Time ($IT$): The cumulative idle duration across all $N$ stations per cycle: $IT = \sum_{k=1}^N I_k = N \cdot C - \sum_{i=1}^n t_i = N \cdot C - T_{wc}$

4. Line Balancing Efficiency ($E$)

The percentage of total available line capacity that is productively utilized in assembling the product:

$E = \frac{\sum_{i=1}^n t_i}{N \cdot C} \times 100\% = \frac{T_{wc}}{N \cdot C} \times 100\%$

5. Balance Delay ($d$)

The percentage of total line capacity lost to unassigned idle time (also termed smoothness delay or balance slack):

$d = \frac{N \cdot C - \sum_{i=1}^n t_i}{N \cdot C} \times 100\% = 100\% - E$

6. Smoothness Index ($SI$)

A metric quantifying the relative workload uniformity across stations. A perfectly balanced line has $SI = 0$:

$SI = \sqrt{ \sum_{k=1}^N (ST_{\max} - ST_k)^2 }$

Where $ST_{\max} = \max_k \{ ST_k \}$.

---

4. Line Balancing Heuristics

Because the assembly line balancing problem is NP-hard, large industrial networks cannot be solved by brute-force enumeration. Engineers rely on structured heuristic algorithms.

1. Ranked Positional Weight (RPW) Heuristic (Helgeson & Birnie Method)

The RPW heuristic assigns highest priority to tasks that control the greatest cumulative duration of downstream work content.

Ranked Positional Weight Algorithm Workflow
├── Step 1: For each task i, calculate Positional Weight (PW_i):
│           PW_i = t_i + Sum of durations of ALL downstream followers
├── Step 2: Rank all n tasks in descending order of PW_i
├── Step 3: Initialize Station k = 1; unassigned time remaining = C
└── Step 4: Scan ranked list from top to bottom:
            Assign eligible task if:
            (a) All immediate predecessors are already assigned, AND
            (b) Task duration t_i <= remaining station time
            If no task fits, close Station k, advance to Station k + 1, and repeat.

2. Largest Candidate Rule (LCR)

Tasks are sorted strictly in descending order of individual processing time $t_i$. Eligible tasks are greedily assigned to the active workstation. While computationally simpler than RPW, LCR ignores downstream structural precedence, occasionally trapping long critical-path tasks behind unassigned steps.

3. Kilbridge & Wester Column Method

Partitions the precedence diagram into sequential vertical columns (zones) based on topological depth from the source nodes. Tasks are assigned strictly column by column from left to right, ensuring early precedence stages are exhausted before downstream tasks are evaluated.

---

5. Industrial Line Design Considerations

Real-world manufacturing environments introduce physical and operational complexities beyond idealized single-model SALBP:

1. Mixed-Model Assembly Lines: Lines that produce multiple product variants (e.g., sedans, hatchbacks, and wagons) simultaneously on a shared conveyor. Workstations must be balanced using weighted average task times based on product mix ratios, preventing operator starvation or buffer overflows.
2. Zoning Constraints:
   • Positive Zoning (Clustering): Tasks that must be collocated at the same workstation due to shared expensive infrastructure, high-tonnage hoists, fluid charging systems, or hazardous fume extraction.
   • Negative Zoning (Incompatibility): Tasks that cannot physically occupy the same station (e.g., spray painting cannot be placed adjacent to welding or grinding due to explosive vapor ignition hazards; precision electronics assembly cannot share space with oily metal stamping).
3. Mitigating Tasks Exceeding Cycle Time ($t_i > C$):
   • Task Re-engineering / Subdivision: Decomposing the long element into two smaller discrete elements.
   • Parallel Workstations: Installing two identical, parallel workstations ($A$ and $B$) operating at cycle time $2C$. Workpieces alternate between the two stations (odd units to Station $A$, even units to Station $B$), effectively doubling available station time.
   • Offline Pre-Assembly: Removing subassembly tasks from the main moving conveyor and executing them at decoupled offline feeder cells.

---

6. Comprehensive Worked RPW Numerical Problem

Operational Specifications

An industrial plant designs an assembly line to produce an electro-mechanical drive unit. The plant operates 480 net minutes per 8-hour shift and must satisfy a production demand of 360 units per shift.

The assembly consists of 8 elemental tasks whose technological dependencies and durations are specified below:

Step 1: Compute Cycle Time ($C$) and Theoretical Minimum Stations ($N_{\min}$)

Convert available time to seconds: $T_{\text{net}} = 480 \text{ minutes} \times 60 \text{ seconds/minute} = 28,800 \text{ seconds}$

Compute required cycle time: $C = \frac{28,800 \text{ seconds}}{360 \text{ units}} = 80.0 \text{ seconds per unit}$

Verify feasibility: $\max_i \{ t_i \} = t_C = 50 \text{ s} \le 80 \text{ s}$ (Feasible!).

Compute Total Work Content ($T_{wc}$): $T_{wc} = 40 + 30 + 50 + 25 + 35 + 45 + 20 + 15 = 260 \text{ seconds}$

Compute theoretical minimum workstations: $N_{\min} = \left\lceil \frac{T_{wc}}{C} \right\rceil = \left\lceil \frac{260}{80} \right\rceil = \lceil 3.25 \rceil = 4 \text{ workstations}$

Step 2: Compute Positional Weights ($PW_i$) and Rank Tasks

The Positional Weight of task $i$ is $PW_i = t_i + \sum_{j \in \text{Followers}(i)} t_j$:

• Task H: Followers = None $\implies PW_H = 15 \text{ s}$
• Task G: Followers = $\{H\} \implies PW_G = 20 + 15 = 35 \text{ s}$
• Task E: Followers = $\{H\} \implies PW_E = 35 + 15 = 50 \text{ s}$
• Task D: Followers = $\{G, H\} \implies PW_D = 25 + 20 + 15 = 60 \text{ s}$
• Task F: Followers = $\{G, H\} \implies PW_F = 45 + 20 + 15 = 80 \text{ s}$
• Task B: Followers = $\{D, E, G, H\} \implies PW_B = 30 + 25 + 35 + 20 + 15 = 125 \text{ s}$
• Task C: Followers = $\{F, G, H\} \implies PW_C = 50 + 45 + 20 + 15 = 130 \text{ s}$
• Task A: Followers = $\{B, C, D, E, F, G, H\} \implies PW_A = 40 + 220 = 260 \text{ s}$

Ranked Priority Master List

Step 3: Heuristic Workstation Assignment ($C = 80$ s)

Workstation 1 (Capacity = 80 s):

• Eligible tasks: A ($t_A = 40 \le 80$). Assign Task A. Remaining time $= 80 - 40 = 40$ s.
• Eligible tasks: C ($t_C = 50 > 40$, cannot fit), B ($t_B = 30 \le 40$). Assign Task B. Remaining time $= 40 - 30 = 10$ s.
• Eligible tasks: C ($50 > 10$), D ($25 > 10$), E ($35 > 10$). No task fits in 10 s.
• Workstation 1 Assigned: {A, B}. Station Time $ST_1 = 40 + 30 = 70$ s. Idle Time $I_1 = 80 - 70 = 10$ s.

Workstation 2 (Capacity = 80 s):

• Eligible tasks: C ($PW = 130, t_C = 50 \le 80$). Assign Task C. Remaining time $= 80 - 50 = 30$ s.
• Eligible tasks: F ($PW = 80, t_F = 45 > 30$, cannot fit), D ($PW = 60, t_D = 25 \le 30$). Assign Task D. Remaining time $= 30 - 25 = 5$ s.
• Eligible tasks: F ($45 > 5$), E ($35 > 5$). Neither fits in 5 s.
• Workstation 2 Assigned: {C, D}. Station Time $ST_2 = 50 + 25 = 75$ s. Idle Time $I_2 = 80 - 75 = 5$ s.

Workstation 3 (Capacity = 80 s):

• Eligible tasks: F ($PW = 80, t_F = 45 \le 80$). Assign Task F. Remaining time $= 80 - 45 = 35$ s.
• Eligible tasks: E ($PW = 50, t_E = 35 \le 35$), G (predecessors D and F completed, $PW = 35, t_G = 20 \le 35$).
• Task E has higher positional weight ($50 > 35$) and exactly fits remaining time. Assign Task E. Remaining time $= 35 - 35 = 0$ s.
• Workstation 3 Assigned: {F, E}. Station Time $ST_3 = 45 + 35 = 80$ s. Idle Time $I_3 = 80 - 80 = 0$ s.

Workstation 4 (Capacity = 80 s):

• Eligible tasks: G ($PW = 35, t_G = 20 \le 80$). Assign Task G. Remaining time $= 80 - 20 = 60$ s.
• Eligible tasks: H (predecessors E and G completed, $PW = 15, t_H = 15 \le 60$). Assign Task H. Remaining time $= 60 - 15 = 45$ s.
• All tasks assigned. Close line.
• Workstation 4 Assigned: {G, H}. Station Time $ST_4 = 20 + 15 = 35$ s. Idle Time $I_4 = 80 - 35 = 45$ s.

Step 4: Final Line Balance Evaluation

• Actual Workstations ($N$): 4 workstations (achieving the theoretical minimum $N_{\min} = 4$).
• Total Available Capacity: $N \times C = 4 \times 80 = 320 \text{ seconds}$.
• Total Line Idle Time: $IT = 320 - 260 = 60 \text{ seconds}$.
• Line Efficiency ($E$): $E = \frac{\sum t_i}{N \cdot C} \times 100\% = \frac{260}{320} \times 100\% = 81.25\%$
• Balance Delay ($d$): $d = 100\% - E = 100\% - 81.25\% = 18.75\%$
• Smoothness Index ($SI$): $SI = \sqrt{(80 - 70)^2 + (80 - 75)^2 + (80 - 80)^2 + (80 - 35)^2} = \sqrt{100 + 25 + 0 + 2025} = \sqrt{2150} = 46.37 \text{ seconds}$