Study guide

11.2 Assembly Line Balancing, Takt Time, Cycle Time, and Throughput

FE Industrial and Systems Study Guide Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Exam Overview, CBT Strategy & Handbook Navigation

1.1 FE Industrial Exam Structure, CBT Logistics, and Pacing 1.2 Using the NCEES FE Reference Handbook and Approved Calculators

2 Chapter 2: Mathematics for Industrial Engineers

2.1 Analytic Geometry, Coordinate Systems, and Trigonometry 2.2 Calculus: Differential, Integral, and Series Approximations 2.3 Linear Algebra: Matrix Operations, Systems of Equations, and Vectors

3 Chapter 3: Engineering Sciences Core

3.1 Thermodynamics Fundamentals and Fluid Flow Principles 3.2 Statics, Dynamics, and Mechanics of Materials Core 3.3 Electrical Circuits, DC/AC Analysis, and Power in Industrial Systems

4 Chapter 4: Ethics and Professional Practice

4.1 NCEES Model Rules of Professional Conduct and Technical Society Ethics 4.2 Engineering Licensure, Public Welfare, and Professional Liability 4.3 Engineering Contracts, Intellectual Property, and Conflicts of Interest

5 Chapter 5: Engineering Economics

5.1 Time Value of Money, Discount Factors, and Equivalence 5.2 Evaluating Alternatives: Present Worth, Equivalent Annual Cost, and IRR 5.3 Incremental Rate of Return, Replacement Analysis, and Break-Even 5.4 Depreciation Methods, MACRS, Income Taxes, and Inflation

6 Chapter 6: Probability Foundations & Distributions

6.1 Basic Probability Concepts, Conditional Probability, and Bayes' Theorem 6.2 Discrete Probability Distributions 6.3 Continuous Probability Distributions

7 Chapter 7: Statistical Inference, Regression & Design of Experiments

7.1 Sampling Distributions, Central Limit Theorem, and Confidence Intervals 7.2 Hypothesis Testing: Means, Proportions, and Variances 7.3 Linear Regression, Correlation Analysis, and Design of Experiments (ANOVA)

8 Chapter 8: Data, Logic, Modeling & Linear Programming

8.1 Optimization Modeling: Decision Variables, Objectives, and Constraints 8.2 Linear Programming: Graphical Solutions and Simplex Fundamentals 8.3 Duality, Sensitivity Analysis, and Integer Linear Programming 8.4 Data, Logic Development, and Analytics

9 Chapter 9: Stochastic Models & Simulation

9.1 Queuing Theory: Little's Law, M/M/1, and Multi-Server Systems 9.2 Discrete-Time Markov Chains: Transition Matrices and Steady-State Probabilities 9.3 Discrete-Event Simulation Principles and Monte Carlo Modeling

10 Chapter 10: Engineering Management, Project Planning & Performance Measurement

10.1 Organizational Structure, Leadership, and Worker Motivation Theories 10.2 Project Management: WBS, Critical Path Method (CPM), PERT, and Crashing 10.3 Earned Value Management (EVM), Decision Trees, and Risk Preference 10.4 Performance Measurement: Productivity, KPIs, Wage Systems, and the Balanced Scorecard

11 Chapter 11: Manufacturing & Production Systems

11.1 Manufacturing Processes, Material Processing, and Tolerancing 11.2 Assembly Line Balancing, Takt Time, Cycle Time, and Throughput 11.3 Sustainable Manufacturing, Waste Minimization, and Life-Cycle Assessment

12 Chapter 12: Production Planning, Inventory Control & Sequencing

12.1 Demand Forecasting Methods and Forecast Error Tracking 12.2 Aggregate Planning, Master Production Scheduling (MPS), and MRP 12.3 Deterministic Inventory Models: EOQ, EPQ, and Safety Stock 12.4 Job Sequencing, Dispatching Rules, and Flow Shop Scheduling

13 Chapter 13: Lean Systems & Theory of Constraints

13.1 Lean Foundations: Value Stream Mapping, Seven Wastes, and 5S 13.2 Pull Systems, Kanban, Just-In-Time (JIT), and SMED Setup Reduction 13.3 Theory of Constraints: Bottleneck Identification and Drum-Buffer-Rope

14 Chapter 14: Facilities Planning & Material Handling

14.1 Facility Location Analysis: Qualitative Factor Rating and Centroid Method 14.2 Facility Layout Design and Flow Analysis 14.3 Material Handling Equipment, Warehousing, and AS/RS

15 Chapter 15: Supply Chain Design & Logistics

15.1 Supply Chain Network Architecture and Transportation Modes 15.2 Distribution Strategies, Cross-Docking, and Vehicle Routing 15.3 The Bullwhip Effect, Risk Pooling, and Supply Chain Coordination

16 Chapter 16: Human Factors & Cognitive Ergonomics

16.1 Cognitive Engineering, Human-Machine Interface, Displays, and Controls 16.2 Anthropometric Principles, Percentile Design, and Biomechanical Posture 16.3 Environmental Ergonomics: Industrial Noise, Lighting, and Heat Stress

17 Chapter 17: Physical Ergonomics & Workplace Safety

17.1 Physical Ergonomics: The NIOSH Manual Lifting Equation 17.2 Cumulative Trauma Disorders and Postural Assessment 17.3 Workplace Safety: OSHA Standards, Hazard Analysis, and Control Hierarchy

18 Chapter 18: Work Design & Measurement

18.1 Methods Engineering, Process Charting, and Principles of Motion Economy 18.2 Direct Stopwatch Time Study: Observed Time, Performance Rating, and Allowances 18.3 Predetermined Time Systems, Work Sampling, and Learning Curves

19 Chapter 19: Quality Management, Six Sigma & Analytical Tools

19.1 Quality Philosophies, Total Quality Management, and Cost of Quality 19.2 Six Sigma DMAIC Methodology and Quality Function Deployment 19.3 The Seven Basic Quality Tools, Root Cause Analysis, and Taguchi Loss Function

20 Chapter 20: Statistical Process Control

20.1 Statistical Process Control Principles, Variation, and Run Rules 20.2 Variable Control Charts: X-bar & R, X-bar & S, and Individual-Moving Range 20.3 Attribute Control Charts: Defectives (p, np) and Defects (c, u)

21 Chapter 21: Process Capability & Acceptance Sampling

21.1 Process Capability Indices and Defect Levels 21.2 Acceptance Sampling Concepts and Operating Characteristic Curves 21.3 Sampling Risks, AQL, LTPD, and Standard Sampling Plans

22 Chapter 22: Systems Engineering & Life-Cycle Management

22.1 The Systems Engineering V-Model, Stakeholder Requirements, and Functional Architecture 22.2 Configuration Management, Interface Control, and Verification & Validation 22.3 Life-Cycle Costing, Maintainability, and System Availability

23 Chapter 23: Reliability Engineering & Risk Analysis

23.1 Reliability Mathematics, Hazard Rates, and the Bathtub Curve 23.2 System Reliability Configurations: Series, Parallel, and k-out-of-n Systems 23.3 Failure Modes and Effects Analysis and Fault Tree Analysis

11.2 Assembly Line Balancing, Takt Time, Cycle Time, and Throughput

Key Takeaways Explain This Topic AI

Takt Time defines the pacing heartbeat of production dictated by customer demand (Takt = Available Operating Time / Customer Demand), whereas Cycle Time (C) represents the actual line completion interval dictated by the bottleneck workstation.

The theoretical minimum number of workstations is calculated as N_min = ceil(Σ t_i / C), where Σ t_i is the total work content time and the ceiling function strictly rounds up to the next whole workstation.

Heuristic line balancing algorithms such as Ranked Positional Weight (RPW / Helgeson-Birnie) assign work elements to stations based on cumulative downstream path duration while honoring strict technological precedence constraints.

Balancing efficiency E = Σ t_i / (N_actual * C) measures the proportion of productive time on the line, while balance delay d = 1 - E quantifies line unbalance and total idle capacity.

Little's Law (WIP = Throughput * Flow Time) governs production line dynamics, demonstrating that queue accumulation and lead time escalate directly when station cycle times are uncoordinated.

Last updated: September 2026

Assembly lines are product-oriented production flow systems where discrete work units move sequentially along a configured material handling transfer system past assigned workstations. Balancing an assembly line involves partitioning the total work content into discrete subsets assigned to workstations such that technological precedence constraints are satisfied and station idle times are minimized.

1. Flow Line Principles: Demand Pacing vs. Capacity

To configure an assembly line, industrial engineers must distinguish between the pace required by the market and the operational capability of the manufacturing line. Line Balancing Parameter Relationships:

  • ├── Customer Demand (D) & Available Time (T_a) ──> Takt Time = T_a / D (Pacing heartbeat)
  • ├── Bottleneck Station Duration (S_max) ─────────> Line Cycle Time C = S_max (Production interval)
  • ├── Production Pacing Condition ────────────────> C <= Takt (Prevents starving customer demand)
  • └── Line Capacity / Throughput ──────────────────> TH = 1 / C (Units produced per unit time)
  • Takt Time ( T a k t Takt T ak t )

Originating from the German word for "musical meter" or "beat," Takt time represents the rate at which finished goods must emerge from the line to exactly satisfy customer demand without building excess finished-goods inventory: T a k t = Available Net Operating Time per Period ( T a ) Customer Demand per Period ( D ) Takt = \frac{\text{Available Net Operating Time per Period} (T_a)}{\text{Customer Demand per Period} (D)} T ak t = Customer Demand per Period ( D ) Available Net Operating Time per Period ( T a ​ ) ​

Critical Convention : Available operating time ( T a T_a T a ​ ) must account only for planned production operating duration. Unpaid lunch breaks, scheduled preventive maintenance, and planned plant shutdowns must be subtracted from the gross shift length. If paid rest breaks occur while the line is halted, that break time must also be deducted to find the net productive time.

Cycle Time ( C C C )

Cycle time ( C C C or T c T_c T c ​ ) is the actual elapsed time between consecutive finished units exiting the final workstation of the line. On a synchronous transfer line without inter-station buffer accumulation, the overall line cycle time is governed by the slowest station—the bottleneck station: C = max ⁡ j = 1 , … , N { S j } C = \max_{j=1,\dots,N} \{S_j\} C = j = 1 , … , N max ​ { S j ​ }

Where S j S_j S j ​ is the total work element processing time assigned to station j j j ( S j = ∑ i ∈ Station j t i S_j = \sum_{i \in \text{Station } j} t_i S j ​ = ∑ i ∈ Station j ​ t i ​ ).

Stability and Feasibility Requirement : To fulfill customer demand without overtime, the line cycle time cannot exceed Takt time: C ≤ T a k t C \le Takt C ≤ T ak t .

Throughput Rate ( T H TH T H ) : The continuous output rate of the production line: T H = 1 C TH = \frac{1}{C} T H = C 1 ​ (units per unit time).

  • 2. Precedence Constraints & Theoretical Minimum Workstations
  • Precedence Diagram and Total Work Content

Every product design requires a specific set of basic work elements (tasks) i = 1 , 2 , … , n i = 1, 2, \dots, n i = 1 , 2 , … , n , each having a known deterministic execution duration t i t_i t i ​ . The total work content ( T wc T_{\text{wc}} T wc ​ ) is the arithmetic sum of all individual task times: T wc = ∑ i = 1 n t i T_{\text{wc}} = \sum_{i=1}^n t_i T wc ​ = i = 1 ∑ n ​ t i ​

A precedence diagram is a directed acyclic graph (DAG) where nodes represent individual work elements and directed arrows represent technological sequencing constraints (e.g., a screw cannot be torqued until the washer and bracket are placed). Illustrative Precedence Graph:

  • [Task 1: 0.8 min] ───> [Task 3: 0.5 min] ──┐
  • ├───> [Task 5: 1.2 min]
  • [Task 2: 1.0 min] ───> [Task 4: 0.9 min] ──┘
  • Theoretical Minimum Number of Workstations ( N min ⁡ N_{\min} N m i n ​ )

Dividing total work content by the desired cycle time establishes the theoretical lower bound on required workstations: N min ⁡ = ⌈ ∑ i = 1 n t i C ⌉ = ⌈ T wc C ⌉ N_{\min} = \left\lceil \frac{\sum_{i=1}^n t_i}{C} \right\rceil = \left\lceil \frac{T_{\text{wc}}}{C} \right\rceil N m i n ​ = ⌈ C ∑ i = 1 n ​ t i ​ ​ ⌉ = ⌈ C T wc ​ ​ ⌉

Where ⌈ ⋅ ⌉ \lceil \cdot \rceil ⌈ ⋅ ⌉ denotes the mathematical ceiling function , which mandates rounding up to the next integer regardless of how small the fractional remainder may be. Because fractional workstations (e.g., 4.1 stations) cannot exist physically, at least 5 workstations are required.

3. Heuristic Assembly Line Balancing Algorithms

The assembly line balancing problem is an NP-hard combinatorial optimization problem. For industrial-scale applications, heuristic algorithms generate near-optimal station assignments efficiently.

Ranked Positional Weight (RPW / Helgeson-Birnie Method)

The RPW method prioritizes tasks that have large processing times and command long chains of dependent downstream tasks.

Step 1: Compute Positional Weight ( P W i PW_i P W i ​ ) for each task i i i :

The positional weight is the sum of task i i i 's own duration plus the durations of all tasks that technologically follow it in the precedence network: P W i = t i + ∑ k ∈ Followers ( i ) t k PW_i = t_i + \sum_{k \in \text{Followers}(i)} t_k P W i ​ = t i ​ + k ∈ Followers ( i ) ∑ ​ t k ​

Step 2: Rank Tasks : Sort all tasks in strictly descending order of their P W i PW_i P W i ​ values.

Step 3: Assign Tasks to Stations :

Open Station 1 with available time capacity equal to C C C .

Scan the ranked list from highest to lowest P W PW P W . Assign task i i i to the active station if:

All immediate technological predecessors of task i i i have already been assigned (either to earlier stations or earlier in the current station).

The task duration t i t_i t i ​ does not exceed the remaining unassigned time of the active station ( t i ≤ C − S active t_i \le C - S_{\text{active}} t i ​ ≤ C − S active ​ ).

If no eligible unassigned task fits into the remaining station time, close the current station, open Station j + 1 j+1 j + 1 , and repeat until all n n n tasks are assigned.

Largest Candidate Rule

A simpler heuristic that sorts all unassigned tasks in descending order of individual task times ( t i t_i t i ​ ). At each step, the algorithm selects the largest eligible task that satisfies precedence constraints and fits within remaining station capacity. While computationally simpler, the Largest Candidate Rule can become trapped in local sub-optima if a short task blocks a long downstream critical path.

4. Line Balancing Metrics: Efficiency, Delay, and Smoothing

Once an assembly line is configured with N actual N_{\text{actual}} N actual ​ workstations and cycle time C C C , its operational performance is quantified using standardized NCEES efficiency metrics:

Metric Mathematical Formulation Interpretation & Operational Target

Total Work Content ( T wc T_{\text{wc}} T wc ​ ) T wc = ∑ i = 1 n t i T_{\text{wc}} = \sum_{i=1}^n t_i T wc ​ = ∑ i = 1 n ​ t i ​ Total standard labor time required to fabricate one complete product unit.

Total Available Line Time T avail = N actual × C T_{\text{avail}} = N_{\text{actual}} \times C T avail ​ = N actual ​ × C Total gross labor time capacity deployed across all active workstations during one cycle.

Balancing Efficiency ( E E E ) E = ∑ t i N actual × C × 100 % E = \frac{\sum t_i}{N_{\text{actual}} \times C} \times 100\% E = N actual ​ × C ∑ t i ​ ​ × 100% Percentage of available station time spent performing value-added assembly tasks ( 0 < E ≤ 100 % 0 < E \le 100\% 0 < E ≤ 100% ).

Balance Delay ( d d d or B D BD B D ) d = 1 − E = N actual × C − ∑ t i N actual × C × 100 % d = 1 - E = \frac{N_{\text{actual}} \times C - \sum t_i}{N_{\text{actual}} \times C} \times 100\% d = 1 − E = N actual ​ × C N actual ​ × C − ∑ t i ​ ​ × 100% Idle percentage; quantifies unproductive time lost due to workload imbalances and precedence blocking.

Workload Smoothness Index ( S I SI S I ) S I = ∑ j = 1 N actual ( S max ⁡ − S j ) 2 SI = \sqrt{\sum_{j=1}^{N_{\text{actual}}} (S_{\max} - S_j)^2} S I = ∑ j = 1 N actual ​ ​ ( S m a x ​ − S j ​ ) 2 ​ Evaluates workload distribution equity; lower values indicate balanced, uniform physical pacing.

5. Little's Law and Flow Dynamics in Production Lines

In manufacturing systems, Work-in-Process ( W I P WIP W I P ), Throughput ( T H TH T H ), and Manufacturing Lead Time ( M L T MLT M L T or Flow Time, C T CT CT ) are fundamentally linked by Little's Law : W I P = T H × C T WIP = TH \times CT W I P = T H × CT

Where:

W I P WIP W I P = average number of parts residing within the line boundaries (in stations and intermediate buffers)

T H TH T H = steady-state average production output rate ( T H = 1 / C TH = 1 / C T H = 1/ C when running at bottleneck capacity)

C T CT CT = average total flow time (lead time) an individual workpiece spends entering, traversing, and exiting the line Production Line WIP Buffer Dynamics:

  • [Station 1] ───> [Buffer 1] ───> [Station 2 (Bottleneck)] ───> [Buffer 2] ───> [Station 3]
  • (S1 = 1.2 min) (Accumulates) (S2 = 2.0 min) (Starved) (S3 = 1.4 min)
  • Bottleneck Blocking and Starvation Dynamics

When station cycle times are unevenly balanced:

Starvation : A downstream station with processing time S j + 1 < S j S_{j+1} < S_j S j + 1 ​ < S j ​ completes its assigned task and remains idle because the slower upstream feeding station has not released the next part.

Blocking : An upstream station with processing time S j − 1 < S j S_{j-1} < S_j S j − 1 ​ < S j ​ completes its task but cannot discharge the part because the downstream station's buffer is completely full.

Workload Smoothing Strategy : To alleviate bottlenecks without adding stations, industrial engineers re-sequence tasks across boundaries, introduce parallel workstations at the bottleneck ( C effective = S bottleneck / m C_{\text{effective}} = S_{\text{bottleneck}} / m C effective ​ = S bottleneck ​ / m ), or invest in automated poka-yoke fixturing to compress high-variance task times.

  • 6. Step-by-Step Worked Engineering Calculations
  • Worked Example 11.2.1: Full Line Balancing via Ranked Positional Weight (RPW)

Problem : A manufacturer of medical infusion pumps operates an assembly line for an 8-hour shift. The shift includes two 15-minute paid rest breaks during which the line is stopped. Target customer demand is D = 300 units/shift D = 300\text{ units/shift} D = 300 units/shift . The assembly work content consists of 7 discrete tasks with times and precedence shown below:

  • Task ( i i i ) Duration t i t_i t i ​ (sec) Immediate Predecessors
  • 1 35 —
  • 2 50 1
  • 3 40 1
  • 4 25 2
  • 5 45 3
  • 6 60 4, 5
  • 7 30 6

Calculate the Takt time ( T a k t Takt T ak t ) and theoretical minimum number of workstations ( N min ⁡ N_{\min} N m i n ​ ).

Balance the line using the Ranked Positional Weight (RPW) algorithm with cycle time equal to Takt time.

Compute the resulting balancing efficiency ( E E E ) and balance delay ( d d d ).

Solution :

Takt Time and N min ⁡ N_{\min} N m i n ​ :

Gross shift duration = 8 hours × 60 = 480 minutes = 28 , 800 seconds 8\text{ hours} \times 60 = 480\text{ minutes} = 28,800\text{ seconds} 8 hours × 60 = 480 minutes = 28 , 800 seconds .

Deduct two 15-minute scheduled line stoppages: T a = 480 − 30 = 450 minutes = 27 , 000 seconds T_a = 480 - 30 = 450\text{ minutes} = 27,000\text{ seconds} T a ​ = 480 − 30 = 450 minutes = 27 , 000 seconds .

Takt Time: T a k t = T a D = 27 , 000 seconds 300 units = 90.0 seconds/unit Takt = \frac{T_a}{D} = \frac{27,000\text{ seconds}}{300\text{ units}} = 90.0\text{ seconds/unit} T ak t = D T a ​ ​ = 300 units 27 , 000 seconds ​ = 90.0 seconds/unit

Total work content: T wc = ∑ i = 1 7 t i = 35 + 50 + 40 + 25 + 45 + 60 + 30 = 285 seconds T_{\text{wc}} = \sum_{i=1}^7 t_i = 35 + 50 + 40 + 25 + 45 + 60 + 30 = 285\text{ seconds} T wc ​ = i = 1 ∑ 7 ​ t i ​ = 35 + 50 + 40 + 25 + 45 + 60 + 30 = 285 seconds

Theoretical minimum workstations: N min ⁡ = ⌈ T wc C ⌉ = ⌈ 285 90 ⌉ = ⌈ 3.167 ⌉ = 4 workstations N_{\min} = \left\lceil \frac{T_{\text{wc}}}{C} \right\rceil = \left\lceil \frac{285}{90} \right\rceil = \lceil 3.167 \rceil = 4\text{ workstations} N m i n ​ = ⌈ C T wc ​ ​ ⌉ = ⌈ 90 285 ​ ⌉ = ⌈ 3.167 ⌉ = 4 workstations

RPW Calculation and Ranking:

Task 7 followers: none ⟹ P W 7 = t 7 = 30 s \implies PW_7 = t_7 = 30\text{ s} ⟹ P W 7 ​ = t 7 ​ = 30 s .

Task 6 followers: 7 ⟹ P W 6 = 60 + 30 = 90 s \implies PW_6 = 60 + 30 = 90\text{ s} ⟹ P W 6 ​ = 60 + 30 = 90 s .

Task 5 followers: 6, 7 ⟹ P W 5 = 45 + 60 + 30 = 135 s \implies PW_5 = 45 + 60 + 30 = 135\text{ s} ⟹ P W 5 ​ = 45 + 60 + 30 = 135 s .

Task 4 followers: 6, 7 ⟹ P W 4 = 25 + 60 + 30 = 115 s \implies PW_4 = 25 + 60 + 30 = 115\text{ s} ⟹ P W 4 ​ = 25 + 60 + 30 = 115 s .

Task 3 followers: 5, 6, 7 ⟹ P W 3 = 40 + 45 + 60 + 30 = 175 s \implies PW_3 = 40 + 45 + 60 + 30 = 175\text{ s} ⟹ P W 3 ​ = 40 + 45 + 60 + 30 = 175 s .

Task 2 followers: 4, 6, 7 ⟹ P W 2 = 50 + 25 + 60 + 30 = 165 s \implies PW_2 = 50 + 25 + 60 + 30 = 165\text{ s} ⟹ P W 2 ​ = 50 + 25 + 60 + 30 = 165 s .

Task 1 followers: all (2, 3, 4, 5, 6, 7) ⟹ P W 1 = 285 s \implies PW_1 = 285\text{ s} ⟹ P W 1 ​ = 285 s .

Ranking Order : Task 1 (285), Task 3 (175), Task 2 (165), Task 5 (135), Task 4 (115), Task 6 (90), Task 7 (30).

Station Assignment (Cycle Time C = 90 s C = 90\text{ s} C = 90 s ):

Station 1 (Capacity = 90 s):

Assign Task 1 ( t 1 = 35 s t_1 = 35\text{ s} t 1 ​ = 35 s , no preds). Remaining time = 90 − 35 = 55 s 90 - 35 = 55\text{ s} 90 − 35 = 55 s .

Evaluate next ranked: Task 3 ( t 3 = 40 s t_3 = 40\text{ s} t 3 ​ = 40 s , pred 1 done). 40 ≤ 55 40 \le 55 40 ≤ 55 , assign Task 3. Remaining time = 55 − 40 = 15 s 55 - 40 = 15\text{ s} 55 − 40 = 15 s .

Evaluate next: Task 2 ( t 2 = 50 > 15 t_2 = 50 > 15 t 2 ​ = 50 > 15 ), Task 5 ( t 5 = 45 > 15 t_5 = 45 > 15 t 5 ​ = 45 > 15 ), Task 4 ( t 4 = 25 > 15 t_4 = 25 > 15 t 4 ​ = 25 > 15 ). None fit.

Station 1 total: Tasks {1, 3}, Station time S 1 = 35 + 40 = 75 s S_1 = 35 + 40 = 75\text{ s} S 1 ​ = 35 + 40 = 75 s , idle = 15 s 15\text{ s} 15 s .

Station 2 (Capacity = 90 s):

Evaluate highest ranked unassigned: Task 2 ( t 2 = 50 s t_2 = 50\text{ s} t 2 ​ = 50 s , pred 1 done). Assign Task 2. Remaining = 90 − 50 = 40 s 90 - 50 = 40\text{ s} 90 − 50 = 40 s .

Evaluate next: Task 5 ( t 5 = 45 > 40 t_5 = 45 > 40 t 5 ​ = 45 > 40 ). Cannot fit.

Evaluate next: Task 4 ( t 4 = 25 s t_4 = 25\text{ s} t 4 ​ = 25 s , pred 2 done). 25 ≤ 40 25 \le 40 25 ≤ 40 , assign Task 4. Remaining = 40 − 25 = 15 s 40 - 25 = 15\text{ s} 40 − 25 = 15 s .

No other tasks fit in 15 s.

Station 2 total: Tasks {2, 4}, Station time S 2 = 50 + 25 = 75 s S_2 = 50 + 25 = 75\text{ s} S 2 ​ = 50 + 25 = 75 s , idle = 15 s 15\text{ s} 15 s .

Station 3 (Capacity = 90 s):

Evaluate highest ranked unassigned: Task 5 ( t 5 = 45 s t_5 = 45\text{ s} t 5 ​ = 45 s , pred 3 done). Assign Task 5. Remaining = 90 − 45 = 45 s 90 - 45 = 45\text{ s} 90 − 45 = 45 s .

Evaluate next: Task 6 ( t 6 = 60 > 45 t_6 = 60 > 45 t 6 ​ = 60 > 45 ). Cannot fit.

Station 3 total: Task {5}, Station time S 3 = 45 s S_3 = 45\text{ s} S 3 ​ = 45 s , idle = 45 s 45\text{ s} 45 s .

Station 4 (Capacity = 90 s):

Evaluate next: Task 6 ( t 6 = 60 s t_6 = 60\text{ s} t 6 ​ = 60 s , preds 4 and 5 done). Assign Task 6. Remaining = 90 − 60 = 30 s 90 - 60 = 30\text{ s} 90 − 60 = 30 s .

Evaluate next: Task 7 ( t 7 = 30 s t_7 = 30\text{ s} t 7 ​ = 30 s , pred 6 done). Assign Task 7. Remaining = 30 − 30 = 0 s 30 - 30 = 0\text{ s} 30 − 30 = 0 s .

Station 4 total: Tasks {6, 7}, Station time S 4 = 60 + 30 = 90 s S_4 = 60 + 30 = 90\text{ s} S 4 ​ = 60 + 30 = 90 s , idle = 0 s 0\text{ s} 0 s .

Actual Stations : N actual = 4 N_{\text{actual}} = 4 N actual ​ = 4 workstations. (Matches N min ⁡ N_{\min} N m i n ​ !)

Performance Evaluation:

Total available capacity: N actual × C = 4 × 90 = 360 seconds N_{\text{actual}} \times C = 4 \times 90 = 360\text{ seconds} N actual ​ × C = 4 × 90 = 360 seconds .

Balancing Efficiency: E = ∑ t i N actual × C = 285 360 = 0.7917 = 79.17 % E = \frac{\sum t_i}{N_{\text{actual}} \times C} = \frac{285}{360} = 0.7917 = 79.17\% E = N actual ​ × C ∑ t i ​ ​ = 360 285 ​ = 0.7917 = 79.17%

Balance Delay: d = 1 − E = 1 − 0.7917 = 0.2083 = 20.83 % d = 1 - E = 1 - 0.7917 = 0.2083 = 20.83\% d = 1 − E = 1 − 0.7917 = 0.2083 = 20.83%

Engineering Conclusion : The line achieves a 79.2% balancing efficiency with 4 workstations, satisfying the 90-second Takt time constraint.

Worked Example 11.2.2: Bottleneck Identification & Little's Law WIP Sizing

Problem : A circuit board assembly line features five sequential automated machines with observed station times: S 1 = 45 s S_1 = 45\text{ s} S 1 ​ = 45 s , S 2 = 72 s S_2 = 72\text{ s} S 2 ​ = 72 s , S 3 = 60 s S_3 = 60\text{ s} S 3 ​ = 60 s , S 4 = 50 s S_4 = 50\text{ s} S 4 ​ = 50 s , and S 5 = 40 s S_5 = 40\text{ s} S 5 ​ = 40 s . In-line buffer racks between stations hold parts when transfers are delayed. Quality audits indicate an average Work-in-Process inventory of W I P = 120 circuit boards WIP = 120\text{ circuit boards} W I P = 120 circuit boards distributed across the line.

Identify the bottleneck station and determine the maximum sustainable line throughput in boards per hour.

Using Little's Law, compute the average manufacturing lead time (flow time) for a board traversing the entire line.

Solution :

Bottleneck Station & Throughput:

The bottleneck is Station 2 because it has the longest processing time: S max ⁡ = S 2 = 72 seconds/board S_{\max} = S_2 = 72\text{ seconds/board} S m a x ​ = S 2 ​ = 72 seconds/board .

The governing line cycle time is C = 72 seconds C = 72\text{ seconds} C = 72 seconds .

Line Throughput: T H = 1 C = 1 unit 72 seconds = 3600 seconds/hour 72 seconds/unit = 50.0 units/hour TH = \frac{1}{C} = \frac{1\text{ unit}}{72\text{ seconds}} = \frac{3600\text{ seconds/hour}}{72\text{ seconds/unit}} = 50.0\text{ units/hour} T H = C 1 ​ = 72 seconds 1 unit ​ = 72 seconds/unit 3600 seconds/hour ​ = 50.0 units/hour

Little's Law Flow Time: W I P = T H × C T ⟹ C T = W I P T H WIP = TH \times CT \quad \implies \quad CT = \frac{WIP}{TH} W I P = T H × CT ⟹ CT = T H W I P ​ C T = 120 units 50 units/hour = 2.40 hours = 144.0 minutes CT = \frac{120\text{ units}}{50\text{ units/hour}} = 2.40\text{ hours} = 144.0\text{ minutes} CT = 50 units/hour 120 units ​ = 2.40 hours = 144.0 minutes

Engineering Conclusion : While the sum of station processing times is only 267 seconds 267\text{ seconds} 267 seconds ( 4.45 minutes 4.45\text{ minutes} 4.45 minutes ), excessive buffer inventory ( W I P = 120 WIP = 120 W I P = 120 ) expands average manufacturing lead time to 2.4 hours ( 144 minutes 144\text{ minutes} 144 minutes ).

7. NCEES Reference Handbook Tips & Realistic Exam Traps

Ceiling Function Rounding : Never use standard arithmetic rounding for N min ⁡ N_{\min} N m i n ​ . If T wc / C = 4.05 T_{\text{wc}} / C = 4.05 T wc ​ / C = 4.05 , the theoretical minimum is 5 stations, not 4. A 4-station configuration would be physically incapable of meeting the cycle time without exceeding 100% station utilization.

Net vs. Gross Operating Time : Takt time problems frequently state an 8-hour shift with scheduled lunch and break times. Always subtract scheduled non-working periods from the numerator. Unpaid lunch is never part of T a T_a T a ​ , and scheduled paid pauses must also be subtracted if production stops.

Efficiency Base Trap : When calculating balancing efficiency E = ∑ t i / ( N C ) E = \sum t_i / (N C) E = ∑ t i ​ / ( NC ) , always use the actual number of assigned workstations ( N actual N_{\text{actual}} N actual ​ ) and the actual governing cycle time ( C = max ⁡ S j C = \max S_j C = max S j ​ ), NOT the theoretical minimum N min ⁡ N_{\min} N m i n ​ or Takt time, unless explicitly instructed.

Precedence Violations in Heuristics : When executing RPW or Largest Candidate heuristics on an exam, never assign a task simply because it has a high weight or large duration. Verify that every immediate predecessor has already been allocated.