Study guide
2.2 Queueing Theory Models (M/M/1, M/M/s) & Little's Law Applications
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
2.2 Queueing Theory Models (M/M/1, M/M/s) & Little's Law Applications
Key Takeaways Explain This Topic AI
Kendall's notation A/B/c/K/m/Z provides the standard taxonomy for queueing systems, where M denotes Markovian (Poisson arrivals or exponential service times).
System stability strictly requires server utilization rho < 1; as utilization approaches 100%, queue length and waiting time escalate asymptotically.
Little's Law (L = lambda * W and Lq = lambda * Wq) is a distribution-free conservation law applicable to any stable queueing system in steady state.
In single-server M/M/1 systems, expected waiting time in queue is Wq = lambda / (mu * (mu - lambda)), directly coupling throughput congestion to service variability.
Pooling parallel servers into a shared M/M/s queue drastically reduces average waiting time and buffer requirements compared to isolated single-server queues.
Last updated: October 2026
2.2 Queueing Theory Models (M/M/1, M/M/s) & Little's Law Applications
Queueing theory is the mathematical study of waiting lines, congestion, and service delays in stochastic operational environments. In industrial and systems engineering, queueing models evaluate manufacturing assembly cells, automated guided vehicle (AGV) dispatching, telecommunication networks, warehouse receiving docks, and healthcare delivery systems to balance the cost of providing service capacity against the cost of customer waiting or work-in-process (WIP) holding.
Architecture of Queueing Systems & Kendall's Notation
Every queueing system consists of five physical components: an arrival process from an input population, a waiting line (queue buffer), a service mechanism (servers), a service discipline, and customer departure.
To standardize queueing models, British statistician David G. Kendall developed Kendall's Notation , expressed as:
A / B / c / K / m / Z A / B / c / K / m / Z A / B / c / K / m / Z
Where:
A A A (Arrival Process): Probability distribution of interarrival times.
- M M M : Markovian / Exponential (memoryless, Poisson arrival process)
- D D D : Deterministic (constant interarrival times)
- E k E_k E k : Erlang- k k k distribution
- G G G : General continuous probability distribution
B B B (Service Time Distribution): Probability distribution of service durations.
- M M M : Exponential service times
- D D D : Deterministic / constant service times
- G G G : General service time distribution
c c c (Number of Parallel Servers): Integer count ( s s s or c ≥ 1 c \ge 1 c ≥ 1 ) of identical, independent service channels operating in parallel.
K K K (System Capacity): Maximum permissible number of customers in the system simultaneously (in queue plus in service). When omitted, default is ∞ \infty ∞ .
m m m (Calling Population Size): Size of the customer source pool. When omitted, default is ∞ \infty ∞ .
Z Z Z (Queue Discipline): The priority order for service admission. Common disciplines include:
FIFO (First-In, First-Out): Standard industrial queue discipline.
LIFO (Last-In, First-Out): Found in inventory stackers or bucket elevators.
SIRO (Service In Random Order): Used in communication packet routing.
PRI (Priority Service): Preemptive or non-preemptive urgent dispatch.
When the last three parameters are omitted (e.g., M / M / 1 M/M/1 M / M /1 or M / M / s M/M/s M / M / s ), the system implies an infinite queue capacity ( K = ∞ K = \infty K = ∞ ), an infinite calling population ( m = ∞ m = \infty m = ∞ ), and a FIFO discipline.
Stochastic Foundations: Poisson Processes & Exponential Distributions
Most classical queueing formulations assume Markovian ( M M M ) dynamics governed by the memoryless property.
1. The Poisson Arrival Process
Let λ \lambda λ denote the mean arrival rate (customers/hour, parts/minute). The probability that exactly n n n arrivals occur within an observation time window t t t is given by the Poisson distribution:
P ( N ( t ) = n ) = ( λ t ) n e − λ t n ! for n = 0 , 1 , 2 , … P(N(t) = n) = \frac{(\lambda t)^n e^{-\lambda t}}{n!} \quad \text{for } n = 0, 1, 2, \dots P ( N ( t ) = n ) = n ! ( λ t ) n e − λ t for n = 0 , 1 , 2 , …
- Expected arrivals in interval t t t : E [ N ( t ) ] = λ t E[N(t)] = \lambda t E [ N ( t )] = λ t
- Variance of arrivals: Var ( N ( t ) ) = λ t \text{Var}(N(t)) = \lambda t Var ( N ( t )) = λ t
If the arrival counting process is Poisson, the interarrival times ( T a T_a T a ) between successive arrivals are independently and identically distributed (i.i.d.) according to an exponential distribution with parameter λ \lambda λ :
f ( t ) = λ e − λ t ( t ≥ 0 ) , F ( t ) = 1 − e − λ t f(t) = \lambda e^{-\lambda t} \quad (t \ge 0), \quad F(t) = 1 - e^{-\lambda t} f ( t ) = λ e − λ t ( t ≥ 0 ) , F ( t ) = 1 − e − λ t E [ T a ] = 1 λ , Var ( T a ) = 1 λ 2 E[T_a] = \frac{1}{\lambda}, \quad \text{Var}(T_a) = \frac{1}{\lambda^2} E [ T a ] = λ 1 , Var ( T a ) = λ 2 1
2. Exponential Service Times
Let μ \mu μ represent the mean service rate of a single server (parts processed per unit time when continuously busy). The mean service duration per customer is 1 / μ 1/\mu 1/ μ . The service duration T s T_s T s follows:
f ( t ) = μ e − μ t ( t ≥ 0 ) , F ( t ) = 1 − e − μ t f(t) = \mu e^{-\mu t} \quad (t \ge 0), \quad F(t) = 1 - e^{-\mu t} f ( t ) = μ e − μ t ( t ≥ 0 ) , F ( t ) = 1 − e − μ t
3. The Memoryless (Markovian) Property
The exponential distribution is the only continuous distribution possessing the memoryless property :
P ( T > t + s ∣ T > s ) = P ( T > t ) P(T > t + s \mid T > s) = P(T > t) P ( T > t + s ∣ T > s ) = P ( T > t )
Physical Meaning: The remaining time until an arrival or service completion does not depend on how much time has already elapsed. In an assembly station with exponential service times, if a job has already been in processing for 10 minutes, the probability that it requires an additional 5 minutes is identical to the probability that a freshly arrived job takes 5 minutes.
- Universal Conservation Laws: Little's Law & Traffic Intensity
- Traffic Intensity (Utilization Factor ρ \rho ρ )
The traffic intensity measures the operational load placed on the service facility:
- Single-Server System ( c = 1 c = 1 c = 1 ): ρ = λ μ \rho = \frac{\lambda}{\mu} ρ = μ λ
- Multi-Server System ( c = s c = s c = s servers): ρ = λ s μ \rho = \frac{\lambda}{s\mu} ρ = s μ λ
Stability Criterion (Ergodicity): For any infinite-capacity queue to reach a steady-state equilibrium, the service facility must be capable of processing work faster than the arrival rate:
ρ < 1 ⟹ λ < s μ \rho < 1 \implies \lambda < s\mu ρ < 1 ⟹ λ < s μ
If ρ ≥ 1 \rho \ge 1 ρ ≥ 1 , the queue length grows toward infinity over time ( L q → ∞ L_q \to \infty L q → ∞ ), resulting in system instability.
Little's Law
Formulated rigorously by John D. C. Little in 1961, Little's Law is a distribution-free fundamental theorem that relates the average inventory in a system to the throughput rate and the average flow time:
L = λ W L = \lambda W L = λW L q = λ W q L_q = \lambda W_q L q = λ W q
Where:
L L L : Average number of customers/units in the entire system (queue + service).
L q L_q L q : Average number of customers/units waiting in the queue.
W W W : Average time a customer spends in the entire system (sojourn time).
W q W_q W q : Average time a customer spends waiting in the queue.
λ \lambda λ : Average arrival rate of entering customers.
Fundamental Additive Decompositions
Total time in the system is the sum of waiting time in queue and processing time in service:
W = W q + 1 μ W = W_q + \frac{1}{\mu} W = W q + μ 1
Multiplying throughout by λ \lambda λ yields the relationship between system and queue inventory:
L = L q + λ μ = L q + ρ ( for s = 1 ) L = L_q + \frac{\lambda}{\mu} = L_q + \rho \quad (\text{for } s = 1) L = L q + μ λ = L q + ρ ( for s = 1 ) L = L q + λ μ = L q + s ρ ( for s ≥ 1 ) L = L_q + \frac{\lambda}{\mu} = L_q + s\rho \quad (\text{for } s \ge 1) L = L q + μ λ = L q + s ρ ( for s ≥ 1 )
Little's Law applies universally regardless of arrival distribution, service distribution, or queue discipline, provided the system is stationary and stable.
Single-Server Queueing Model ( M / M / 1 M/M/1 M / M /1 )
The M / M / 1 M/M/1 M / M /1 queue represents a single server fed by a Poisson arrival process with rate λ \lambda λ and exponential service times with rate μ \mu μ .
State Probabilities
Using continuous-time Markov chain birth-death transition equations, the steady-state balance equations require: λ P n = μ P n + 1 ⟹ P n + 1 = ρ P n \lambda P_n = \mu P_{n+1} \implies P_{n+1} = \rho P_n λ P n = μ P n + 1 ⟹ P n + 1 = ρ P n
Summing all probabilities to unity ( ∑ n = 0 ∞ P n = 1 \sum_{n=0}^\infty P_n = 1 ∑ n = 0 ∞ P n = 1 ) yields the geometric distribution:
P 0 = 1 − ρ ( Probability the system is completely empty / idle ) P_0 = 1 - \rho \quad (\text{Probability the system is completely empty / idle}) P 0 = 1 − ρ ( Probability the system is completely empty / idle ) P n = ( 1 − ρ ) ρ n ( Probability exactly n customers are in the system ) P_n = (1 - \rho)\rho^n \quad (\text{Probability exactly } n \text{ customers are in the system}) P n = ( 1 − ρ ) ρ n ( Probability exactly n customers are in the system )
Probability of System Congestion ( N ≥ k N \ge k N ≥ k )
The probability that the number of entities in the system is at least k k k is:
P ( N ≥ k ) = ∑ n = k ∞ ( 1 − ρ ) ρ n = ρ k P(N \ge k) = \sum_{n=k}^\infty (1 - \rho)\rho^n = \rho^k P ( N ≥ k ) = ∑ n = k ∞ ( 1 − ρ ) ρ n = ρ k
Performance Metric Closed-Form Equations
Average number in system ( L L L ): L = ∑ n = 0 ∞ n P n = ρ 1 − ρ = λ μ − λ L = \sum_{n=0}^\infty n P_n = \frac{\rho}{1 - \rho} = \frac{\lambda}{\mu - \lambda} L = ∑ n = 0 ∞ n P n = 1 − ρ ρ = μ − λ λ
Average number in queue ( L q L_q L q ): L q = L − ρ = λ μ − λ − λ μ = λ 2 μ ( μ − λ ) L_q = L - \rho = \frac{\lambda}{\mu - \lambda} - \frac{\lambda}{\mu} = \frac{\lambda^2}{\mu(\mu - \lambda)} L q = L − ρ = μ − λ λ − μ λ = μ ( μ − λ ) λ 2
Average time in system ( W W W ): W = L λ = 1 μ − λ W = \frac{L}{\lambda} = \frac{1}{\mu - \lambda} W = λ L = μ − λ 1
Average time in queue ( W q W_q W q ): W q = L q λ = λ μ ( μ − λ ) W_q = \frac{L_q}{\lambda} = \frac{\lambda}{\mu(\mu - \lambda)} W q = λ L q = μ ( μ − λ ) λ
The "Hockey-Stick" Congestion Curve
Because the denominator contains ( μ − λ ) = μ ( 1 − ρ ) (\mu - \lambda) = \mu(1 - \rho) ( μ − λ ) = μ ( 1 − ρ ) , as utilization ρ → 1.0 \rho \to 1.0 ρ → 1.0 , the waiting time curve escalates non-linearly. At ρ = 0.50 \rho = 0.50 ρ = 0.50 , L = 1.0 L = 1.0 L = 1.0 ; at ρ = 0.80 \rho = 0.80 ρ = 0.80 , L = 4.0 L = 4.0 L = 4.0 ; at ρ = 0.95 \rho = 0.95 ρ = 0.95 , L = 19.0 L = 19.0 L = 19.0 . Industrial systems designed to operate at near 100% utilization experience extreme queue inflation whenever stochastic variability is present.
Multi-Server Queueing Model ( M / M / s M/M/s M / M / s )
The M / M / s M/M/s M / M / s model features a single waiting queue feeding s s s parallel, identical servers, each processing at rate μ \mu μ . Total service capacity is s μ s\mu s μ .
Transition Dynamics
The aggregate service rate depends on the number of entities in the system n n n : μ n = { n μ if 0 ≤ n < s s μ if n ≥ s \mu_n = \begin{cases} n\mu & \text{if } 0 \le n < s \\ s\mu & \text{if } n \ge s \end{cases} μ n = { n μ s μ if 0 ≤ n < s if n ≥ s
Probability of an Empty System ( P 0 P_0 P 0 )
P 0 = [ ∑ n = 0 s − 1 ( λ / μ ) n n ! + ( λ / μ ) s s ! ( 1 − λ s μ ) ] − 1 P_0 = \left[ \sum_{n=0}^{s-1} \frac{(\lambda / \mu)^n}{n!} + \frac{(\lambda / \mu)^s}{s! \left(1 - \frac{\lambda}{s\mu}\right)} \right]^{-1} P 0 = [ ∑ n = 0 s − 1 n ! ( λ / μ ) n + s ! ( 1 − s μ λ ) ( λ / μ ) s ] − 1
Erlang C Formula (Probability of Waiting)
The probability that an arriving customer finds all s s s servers occupied and must wait in the queue is given by the Erlang C formula ( C ( s , λ / μ ) C(s, \lambda/\mu) C ( s , λ / μ ) ):
P ( wait ) = ( λ / μ ) s s ! ( 1 − ρ ) ∑ n = 0 s − 1 ( λ / μ ) n n ! + ( λ / μ ) s s ! ( 1 − ρ ) = P 0 ⋅ ( λ / μ ) s s ! ( 1 − ρ ) P(\text{wait}) = \frac{\frac{(\lambda / \mu)^s}{s!(1 - \rho)}}{ \sum_{n=0}^{s-1} \frac{(\lambda / \mu)^n}{n!} + \frac{(\lambda / \mu)^s}{s!(1 - \rho)} } = P_0 \cdot \frac{(\lambda / \mu)^s}{s!(1 - \rho)} P ( wait ) = ∑ n = 0 s − 1 n ! ( λ / μ ) n + s ! ( 1 − ρ ) ( λ / μ ) s s ! ( 1 − ρ ) ( λ / μ ) s = P 0 ⋅ s ! ( 1 − ρ ) ( λ / μ ) s
Multi-Server Operational Metrics
Average queue length ( L q L_q L q ): L q = P 0 ( λ / μ ) s ρ s ! ( 1 − ρ ) 2 = P ( wait ) ⋅ ρ 1 − ρ L_q = \frac{P_0 (\lambda / \mu)^s \rho}{s!(1 - \rho)^2} = \frac{P(\text{wait}) \cdot \rho}{1 - \rho} L q = s ! ( 1 − ρ ) 2 P 0 ( λ / μ ) s ρ = 1 − ρ P ( wait ) ⋅ ρ
Average time in queue ( W q W_q W q ): W q = L q λ W_q = \frac{L_q}{\lambda} W q = λ L q
Average time in system ( W W W ): W = W q + 1 μ W = W_q + \frac{1}{\mu} W = W q + μ 1
Average number in system ( L L L ): L = L q + λ μ = λ W L = L_q + \frac{\lambda}{\mu} = \lambda W L = L q + μ λ = λW
Engineering Comparative Analysis: Single Fast Server vs. Server Pooling
Consider an industrial inspection facility handling an arrival rate of λ = 16 \lambda = 16 λ = 16 assemblies per hour. Management must decide between three design configurations:
Configuration A (Single Fast Server): One advanced automated cell with μ = 20 \mu = 20 μ = 20 parts/hour ( M / M / 1 M/M/1 M / M /1 ).
Configuration B (Pooled Parallel Servers): Two standard inspection cells pooled with a shared queue, each operating at μ = 10 \mu = 10 μ = 10 parts/hour ( M / M / 2 M/M/2 M / M /2 ).
Configuration C (Unpooled Dedicated Servers): Two separate lines, each with its own dedicated queue, splitting arrivals evenly so λ = 8 \lambda = 8 λ = 8 parts/hour and μ = 10 \mu = 10 μ = 10 parts/hour ( 2 × M / M / 1 2 \times M/M/1 2 × M / M /1 ).
- Quantitative Calculation Comparison
- Configuration A: M / M / 1 M/M/1 M / M /1 with λ = 16 , μ = 20 \lambda = 16, \mu = 20 λ = 16 , μ = 20
- Utilization: ρ = 16 20 = 0.80 \rho = \frac{16}{20} = 0.80 ρ = 20 16 = 0.80
- L = 16 20 − 16 = 4.00 L = \frac{16}{20 - 16} = 4.00 L = 20 − 16 16 = 4.00 assemblies
L q = L − ρ = 4.00 − 0.80 = 3.20 L_q = L - \rho = 4.00 - 0.80 = 3.20 L q = L − ρ = 4.00 − 0.80 = 3.20 assemblies
W = 1 20 − 16 = 0.25 W = \frac{1}{20 - 16} = 0.25 W = 20 − 16 1 = 0.25 hours = 15.00 = 15.00 = 15.00 minutes
W q = 3.20 16 = 0.20 W_q = \frac{3.20}{16} = 0.20 W q = 16 3.20 = 0.20 hours = 12.00 = 12.00 = 12.00 minutes
Configuration B: M / M / 2 M/M/2 M / M /2 with λ = 16 , μ = 10 , s = 2 \lambda = 16, \mu = 10, s = 2 λ = 16 , μ = 10 , s = 2
Ratio λ μ = 16 10 = 1.60 \frac{\lambda}{\mu} = \frac{16}{10} = 1.60 μ λ = 10 16 = 1.60 ; Utilization ρ = 1.60 2 = 0.80 \rho = \frac{1.60}{2} = 0.80 ρ = 2 1.60 = 0.80
Calculate P 0 P_0 P 0 : P 0 = [ 1.6 0 0 ! + 1.6 1 1 ! + 1.6 2 2 ! ( 1 − 0.80 ) ] − 1 = [ 1 + 1.6 + 2.56 2 ( 0.20 ) ] − 1 = [ 2.6 + 6.4 ] − 1 = 1 9 ≈ 0.1111 P_0 = \left[ \frac{1.6^0}{0!} + \frac{1.6^1}{1!} + \frac{1.6^2}{2!(1 - 0.80)} \right]^{-1} = \left[ 1 + 1.6 + \frac{2.56}{2(0.20)} \right]^{-1} = [2.6 + 6.4]^{-1} = \frac{1}{9} \approx 0.1111 P 0 = [ 0 ! 1. 6 0 + 1 ! 1. 6 1 + 2 ! ( 1 − 0.80 ) 1. 6 2 ] − 1 = [ 1 + 1.6 + 2 ( 0.20 ) 2.56 ] − 1 = [ 2.6 + 6.4 ] − 1 = 9 1 ≈ 0.1111
Calculate P ( wait ) P(\text{wait}) P ( wait ) : P ( wait ) = P 0 ⋅ 1.6 2 2 ! ( 1 − 0.80 ) = 1 9 ⋅ 6.40 = 0.7111 P(\text{wait}) = P_0 \cdot \frac{1.6^2}{2!(1 - 0.80)} = \frac{1}{9} \cdot 6.40 = 0.7111 P ( wait ) = P 0 ⋅ 2 ! ( 1 − 0.80 ) 1. 6 2 = 9 1 ⋅ 6.40 = 0.7111
Calculate L q L_q L q : L q = P ( wait ) ⋅ ρ 1 − ρ = 0.7111 ⋅ 0.80 0.20 = 2.844 assemblies L_q = \frac{P(\text{wait}) \cdot \rho}{1 - \rho} = \frac{0.7111 \cdot 0.80}{0.20} = 2.844 \text{ assemblies} L q = 1 − ρ P ( wait ) ⋅ ρ = 0.20 0.7111 ⋅ 0.80 = 2.844 assemblies
Calculate W q W_q W q : W q = L q λ = 2.844 16 = 0.1778 hours = 10.67 minutes W_q = \frac{L_q}{\lambda} = \frac{2.844}{16} = 0.1778 \text{ hours} = 10.67 \text{ minutes} W q = λ L q = 16 2.844 = 0.1778 hours = 10.67 minutes
Calculate W W W : W = W q + 1 μ = 0.1778 + 0.1000 = 0.2778 hours = 16.67 minutes W = W_q + \frac{1}{\mu} = 0.1778 + 0.1000 = 0.2778 \text{ hours} = 16.67 \text{ minutes} W = W q + μ 1 = 0.1778 + 0.1000 = 0.2778 hours = 16.67 minutes
Calculate L L L : L = L q + λ μ = 2.844 + 1.600 = 4.444 assemblies L = L_q + \frac{\lambda}{\mu} = 2.844 + 1.600 = 4.444 \text{ assemblies} L = L q + μ λ = 2.844 + 1.600 = 4.444 assemblies
Configuration C: Unpooled 2 × ( M / M / 1 ) 2 \times (M/M/1) 2 × ( M / M /1 ) with λ = 8 , μ = 10 \lambda = 8, \mu = 10 λ = 8 , μ = 10
Utilization: ρ = 8 10 = 0.80 \rho = \frac{8}{10} = 0.80 ρ = 10 8 = 0.80
L = 8 10 − 8 = 4.00 L = \frac{8}{10 - 8} = 4.00 L = 10 − 8 8 = 4.00 assemblies per line (Total across 2 lines = 8.00 = 8.00 = 8.00 )
L q = 8 2 10 ( 10 − 8 ) = 64 20 = 3.20 L_q = \frac{8^2}{10(10 - 8)} = \frac{64}{20} = 3.20 L q = 10 ( 10 − 8 ) 8 2 = 20 64 = 3.20 assemblies per line (Total across 2 lines = 6.40 = 6.40 = 6.40 )
W = 1 10 − 8 = 0.50 W = \frac{1}{10 - 8} = 0.50 W = 10 − 8 1 = 0.50 hours = 30.00 = 30.00 = 30.00 minutes
W q = 8 10 ( 2 ) = 0.40 W_q = \frac{8}{10(2)} = 0.40 W q = 10 ( 2 ) 8 = 0.40 hours = 24.00 = 24.00 = 24.00 minutes
System Comparison Summary Table
Operational Metric Config A: M / M / 1 M/M/1 M / M /1 (Fast) Config B: M / M / 2 M/M/2 M / M /2 (Pooled) Config C: 2 × M / M / 1 2 \times M/M/1 2 × M / M /1 (Unpooled)
- Arrival Rate ( λ \lambda λ ) 16 parts/hr 16 parts/hr 2 × 8 2 \times 8 2 × 8 parts/hr
- Service Rate per Server ( μ \mu μ ) 20 parts/hr 10 parts/hr 10 parts/hr
- Total Service Capacity ( s μ s\mu s μ ) 20 parts/hr 20 parts/hr 20 parts/hr
- System Utilization ( ρ \rho ρ ) 80.0% 80.0% 80.0%
- Prob. of Queuing P ( wait ) P(\text{wait}) P ( wait ) 80.0% 71.1% 80.0%
- Mean Queue Waiting Time ( W q W_q W q ) 12.00 min 10.67 min 24.00 min
- Mean Service Time ( 1 / μ 1/\mu 1/ μ ) 3.00 min 6.00 min 6.00 min
- Mean System Sojourn Time ( W W W ) 15.00 min 16.67 min 30.00 min
- Mean Queue Length ( L q L_q L q ) 3.20 parts 2.84 parts 6.40 parts (total)
- Mean System WIP ( L L L ) 4.00 parts 4.44 parts 8.00 parts (total)
- Key Industrial Insights
The Pooling Principle: Moving from unpooled queues (Config C) to a shared pooled queue (Config B) with identical total capacity reduces average queue wait time ( W q W_q W q ) from 24.0 minutes to 10.67 minutes—a 55.5% reduction in waiting time with zero additional investment in machinery.
Fast Single Server Trade-Off: Configuration A achieves the shortest overall system time ( W = 15.0 W = 15.0 W = 15.0 minutes) because its service time is half as long (3 min vs 6 min), but Configuration B provides lower queue waiting time ( W q = 10.67 W_q = 10.67 W q = 10.67 min) and provides redundancy (if one server fails, the facility continues operating at 50% capacity, whereas Config A experiences complete line shutdown).