Study guide

9.2 Worker–Machine (Man–Machine) Charts, Multiple Activity Analysis & Synchronous Servicing

PE Industrial and Systems Exam

Track your progress as you read

Finished sections get a check mark.

1 Exam Overview, Strategy & Systems Foundations

1.1 PE Industrial Exam Format, Official Specification & Reference Handbook Strategy 1.2 System Analysis Tools, Process Definition, Requirements Engineering & QFD 1.3 Performance Measures: Output, Productivity, OEE, Cost & Environmental Sustainability 1.4 Process Types (Discrete, Continuous, Manufacturing, Service) & Value Analysis/Engineering

2 Optimization, Queueing, Simulation, Networks & Markov Chains

2.1 Linear Programming Formulation, Graphical Solutions & Sensitivity Analysis 2.2 Queueing Theory Models (M/M/1, M/M/s) & Little's Law Applications 2.3 Discrete-Event Simulation, Random Variates & Model Validation 2.4 Graph Theory & Network Models: Shortest Path, Minimal Spanning Tree & Maximum Flow 2.5 Markov Chains: Transition Matrices, Steady-State Probabilities & Absorbing States 2.6 Decision Trees, Expected Value & Bottleneck Analysis (Theory of Constraints)

3 Project Management & Planning

3.1 Project Scheduling with CPM and PERT: Critical Path, Float, Probability & Crashing 3.2 Project Planning & Control: Scope and WBS, Gantt Charts, Critical Chain (CCPM), Risk & Earned Value

4 Facility Layout, Space, Capacity & Material Handling

4.1 Systematic Layout Planning (SLP) & Activity Relationship (REL) Analysis 4.2 Workstation Design, Aisle Sizing & Space Requirements Planning 4.3 Capacity Analysis: Machine Requirements, Scrap Allowances & Personnel Requirements 4.4 Material Handling Equipment Selection, Unit Loads & Handling Principles

5 Site Location, Warehousing & Facility Economics

5.1 Facility Location Models: Center of Gravity & Minisum / Minimax Distance 5.2 Warehousing Systems, Storage Assignment & Order Picking Operations 5.3 Facility Life-Cycle Economics, Replacement Analysis & Rearrangement Costs

6 Demand Forecasting, Production Planning, MRP & JIT

6.1 Demand Forecasting Methods: Moving Averages, Exponential Smoothing & Error Metrics 6.2 Aggregate Planning Strategies & Master Production Scheduling (MPS) 6.3 Material Requirements Planning (MRP), Bill of Materials & Capacity Planning 6.4 Just-in-Time & Lean Production Planning: Pull Systems, Kanban Sizing, Heijunka & SMED

7 Inventory Systems, Scheduling, Logistics & Transportation Modes

7.1 Deterministic Inventory Control: Classical EOQ, EPQ & Quantity Discounts 7.2 Stochastic Inventory Management: Safety Stock, Continuous / Periodic Review & Newsvendor 7.3 Production Sequencing, Dispatching Rules & Johnson's Algorithm 7.4 Supply Chain Logistics, Transportation Simplex & Distribution Network Design 7.5 Transportation Modes, Freight Economics & the Transshipment Model

8 Engineering Economics, Break-Even Analysis & Costing Systems

8.1 Equivalence, Cash Flow Analysis & Discounted Cash Flow Metrics (PW, FW, EAC) 8.2 Rate of Return Analysis (IRR, Incremental IRR) & Benefit-Cost (B/C) Ratios 8.3 Asset Depreciation (MACRS, Straight-Line), Tax Effects & Replacement Decisions 8.4 Break-Even Analysis, Technical Capability Assessment & Costing Systems (Traditional, ABC & Standard Costs)

9 Methods Engineering, Work Measurement, Learning Curves, Line Balancing & Process Planning

9.1 Methods Analysis, Process Charting & Motion Study (Therbligs, 5S) 9.2 Worker–Machine (Man–Machine) Charts, Multiple Activity Analysis & Synchronous Servicing 9.3 Time Study Fundamentals, Performance Rating & Allowance Factors 9.4 Predetermined Motion Time Systems (PMTS, MTM, MOST) & Work Sampling 9.5 Learning Curves: Unit and Cumulative-Average Models, Learning Rates & Applications 9.6 Assembly Line Balancing, Precedence Constraints & Efficiency Heuristics 9.7 Manufacturing & Service Process Planning: Operation Selection, Sequencing, Route Sheets, Fixturing & Mistake Proofing

10 Ergonomics, Human Capacity, Occupational Safety & DART Rates

10.1 Anthropometry, Percentile Design, Workstation Ergonomics & Link Analysis 10.2 Industrial Biomechanics, the NIOSH Lifting Equation & Lifting Aids 10.3 Limits of Human Capacity & Risk-Factor Tools: Work Physiology, Strength, Range of Motion, Vision, RULA & Slip Resistance 10.4 Environmental Ergonomics (Noise, Heat, Illumination), Human-Machine Systems & OSHA Safety 10.5 Safety Codes, Standards & Voluntary Guidelines (OSHA, ANSI, NIOSH, MIL-STD) and DART Rate Calculations

11 Statistical Process Control & Process Capability

11.1 Statistical Process Control for Variables (X-bar/R and X-bar/s Charts) 11.2 Statistical Process Control for Attributes (p, np, c, and u Charts) 11.3 Process Capability Indices (Cp, Cpk, Cpm, Pp, Ppk) & Sigma Levels

12 Design of Experiments, Acceptance Sampling & Quality Systems

12.1 Design of Experiments: 2^k Factorials, ANOVA & Taguchi Robust Design 12.2 Acceptance Sampling: OC Curves, AQL, LTPD, AOQL, Z1.4/MIL-STD-105E & Dodge-Romig 12.3 Quality Systems (Deming, TQM, ISO 9000, Benchmarking), Root Cause Analysis & DMAIC

13 Reliability Engineering & Maintenance Systems

13.1 Reliability Modeling, Failure Rates (lambda) & Life Distributions (Exponential, Weibull) 13.2 System Reliability Architecture: Series, Parallel, k-out-of-n & Redundancy 13.3 Equipment Maintenance Engineering, Availability (A), MTBF/MTTR & RCM

9.2 Worker–Machine (Man–Machine) Charts, Multiple Activity Analysis & Synchronous Servicing

Key Takeaways Explain This Topic AI

A worker–machine (man–machine) chart plots the worker and each machine on a common time scale, showing concurrent, independent, and idle time in one cycle.

For synchronous servicing, the ideal number of machines per operator is n' = (l + m) ÷ (l + w), where l is load/unload time, m is automatic machine time, and w is the worker's walk and other independent time per machine.

If n ≤ n', the cycle time is l + m and the worker has idle time; if n > n', the cycle time is n(l + w) and the machines wait for the worker.

Cost per unit is (K1 + n × K2) × cycle time ÷ n, where K1 is the operator cost rate and K2 is the machine cost rate; compare the integers on each side of n'.

When machines stop at random rather than on a fixed cycle, machine interference must be estimated with probability models or simulation rather than the synchronous formula.

Last updated: October 2026

9.2 Worker–Machine Charts & Synchronous Servicing

The specification lists man–machine charts with therbligs and motion study as methods for analysis and improvement. Process charts follow one subject, such as a part or a worker. A multiple activity chart puts several subjects side by side on one time scale, so you can see who waits for whom.

1. Building a Worker–Machine Chart

Draw one vertical column per subject (the worker and each machine), with time running down the page. Each block is shaded by type:

Combined (concurrent) work: the worker and machine are both engaged, such as loading or unloading.

Independent work: the worker inspects, packs, or walks while the machine runs automatically, or the machine runs while the worker is elsewhere.

Idle: waiting for the other party.

At the bottom, summarize the cycle time, the working and idle time of each subject, and the utilization (working time ÷ cycle time).

Example: one operator, one CNC lathe. Loading takes 1.0 min (worker and machine together), the automatic cut takes 4.0 min, and the operator spends 0.5 min deburring the previous part. Time (min) OPERATOR LATHE

  • 0.0 - 1.0 Load / unload (with M) Being loaded
  • 1.0 - 1.5 Deburr previous part Cutting (automatic)
  • 1.5 - 5.0 IDLE Cutting (automatic)
  • Cycle = 5.0 min | Operator busy 1.5 min (30%) | Lathe busy 5.0 min (100%)

The operator is idle 70% of the cycle. That idle time is the opportunity to have one person tend several machines.

2. Synchronous Servicing

Synchronous servicing applies when machines run identical, regular cycles and the worker visits them in a fixed order. Define:

  • l l l = loading and unloading time per machine (worker and machine both occupied)
  • m m m = automatic machine run time
  • w w w = worker's independent time per machine (walking to the next machine, inspecting, packing)

The ideal number of machines per operator, where neither worker nor machines wait, is:

n ′ = l + m l + w n' = \frac{l + m}{l + w} n ′ = l + w l + m ​

Usually n ′ n' n ′ is not an integer, so compare the integers on either side:

Case Cycle time T c T_c T c ​ Who waits

n ≤ n ′ n \le n' n ≤ n ′ (fewer machines) T c = l + m T_c = l + m T c ​ = l + m The worker is idle T c − n ( l + w ) T_c - n(l + w) T c ​ − n ( l + w ) per cycle

n > n ′ n > n' n > n ′ (more machines) T c = n ( l + w ) T_c = n(l + w) T c ​ = n ( l + w ) Each machine is idle T c − ( l + m ) T_c - (l + m) T c ​ − ( l + m ) per cycle

Each cycle produces n n n units. With operator cost rate K 1 K_1 K 1 ​ and machine cost rate K 2 K_2 K 2 ​ (per minute), the cost per unit is:

  • T E C n = ( K 1 + n K 2 ) T c n TEC_n = \frac{(K_1 + n K_2)\, T_c}{n} TE C n ​ = n ( K 1 ​ + n K 2 ​ ) T c ​ ​
  • Worked Example

Using the lathe data, l = 1.0 l = 1.0 l = 1.0 , m = 4.0 m = 4.0 m = 4.0 , and w = 0.5 w = 0.5 w = 0.5 min:

n ′ = 1.0 + 4.0 1.0 + 0.5 = 3.33 n' = \frac{1.0 + 4.0}{1.0 + 0.5} = 3.33 n ′ = 1.0 + 0.5 1.0 + 4.0 ​ = 3.33

Labor costs $30/hr ($0.50/min) and each machine costs $60/hr ($1.00/min).

n n n Cycle time Units per cycle Cost per unit

3 l + m = 5.0 l + m = 5.0 l + m = 5.0 min 3 ( 0.50 + 3.00 ) ( 5.0 ) / 3 = $ 5.83 (0.50 + 3.00)(5.0)/3 = \text{\textdollar}5.83 ( 0.50 + 3.00 ) ( 5.0 ) /3 = $ 5.83

4 4 ( 1.5 ) = 6.0 4(1.5) = 6.0 4 ( 1.5 ) = 6.0 min 4 ( 0.50 + 4.00 ) ( 6.0 ) / 4 = $ 6.75 (0.50 + 4.00)(6.0)/4 = \text{\textdollar}6.75 ( 0.50 + 4.00 ) ( 6.0 ) /4 = $ 6.75

Assign 3 machines. The worker is idle 5.0 − 3 ( 1.5 ) = 0.5 5.0 - 3(1.5) = 0.5 5.0 − 3 ( 1.5 ) = 0.5 min per cycle, but that costs less than leaving four expensive machines idle 1 min each cycle. When machine time is cheap relative to labor, the answer often shifts to the higher integer, so always compute both.

Tip

Throughput also matters. With 3 machines the cell makes 3 parts per 5.0 min (36 per hour); with 4 it makes 4 per 6.0 min (40 per hour). If demand requires 40 per hour, the cost comparison must include the cost of the extra capacity found another way.

3. Random Servicing and Machine Interference

When machines stop at random (jams, tool breaks, random material runouts), several may need the operator at the same moment. A machine that waits while the operator serves another is suffering machine interference .

A simple binomial model treats each machine as independently down with probability p p p at a random instant. The chance that k k k of n n n machines are down is ( n k ) p k ( 1 − p ) n − k \binom{n}{k} p^k (1-p)^{n-k} ( k n ​ ) p k ( 1 − p ) n − k , and the expected number waiting beyond the one being served estimates interference.

Finite-source queueing models (the calling population equals the number of machines) and simulation give more exact answers.

Example: Four machines are each down 10% of the time at random. P ( 2 or more down ) = 1 − 0.9 4 − 4 ( 0.1 ) ( 0.9 ) 3 = 1 − 0.6561 − 0.2916 = 0.052 P(\text{2 or more down}) = 1 - 0.9^4 - 4(0.1)(0.9)^3 = 1 - 0.6561 - 0.2916 = 0.052 P ( 2 or more down ) = 1 − 0. 9 4 − 4 ( 0.1 ) ( 0.9 ) 3 = 1 − 0.6561 − 0.2916 = 0.052 . About 5% of the time a stopped machine waits for the operator, which is usually acceptable.

4. Related Multiple Activity Charts

Left-hand/right-hand (operator) charts compare the two hands of one worker; see therblig analysis in the methods section.

Gang (crew) charts show several workers and machines, such as a crew loading a press or a pit crew, to balance their work.

Service versions apply the same logic to people and equipment in services: one technician running several analyzers in a laboratory, or one agent handling several chat sessions.

  • Improvement idea Effect on the chart
  • Quick-load fixtures Shorter l l l raises n ′ n' n ′ and shortens the cycle
  • Place machines in a U-cell Shorter walk time w w w raises n ′ n' n ′
  • Automatic unload and part chutes Turns combined work into machine-only work
  • Inspect while the machine runs Moves inspection into the worker's waiting time