Study guide

15.10 Queuing Theory & Simple Queuing Models

Coal India Management Trainee CIL MT

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: CIL MT Exam Overview & Coal Sector Landscape

1.1 CIL MT Exam Pattern, Marking Scheme & Strategy 1.2 Coal India Limited: Corporate Structure, Maharatna Status & Subsidiaries 1.3 Indian Coal Mining Sector, Energy Mix & Environmental Regulations

2 Chapter 2: Paper-I General Awareness, Polity & Current Affairs

2.1 Indian Constitution, Governance & Statutory Bodies 2.2 Indian Economy, Union Budget & Economic Planning 2.3 Indian Geography, Mineral Belts & Environmental Ecology 2.4 Modern Indian History, Freedom Struggle & Cultural Heritage 2.5 General Science: Physics, Chemistry & Biology Fundamentals 2.6 Inventions, Discoveries & Scientific-Technological Development 2.7 Uses of Internet, Computer Awareness & Digital Governance 2.8 National & International Organisations 2.9 Awards, Honours & Sports 2.10 Books & Authors, Important Monuments & Places of India 2.11 Ports, Power Plants & Infrastructure of India 2.12 Climate Change, SDGs, National Parks & Wildlife Sanctuaries 2.13 Flagship Government Programmes & Current Affairs Method 2.14 World Physical, Social & Economic Geography

3 Chapter 3: Paper-I Reasoning & Logical Ability

3.1 Series Completion, Coding-Decoding & Semantic Analogies 3.2 Syllogisms, Logical Deduction & Venn Diagrams 3.3 Seating Arrangements, Linear/Circular Alignments & Puzzles 3.4 Direction Sense, Blood Relations & Order/Ranking 3.5 Alphabetical & Alphanumeric Series 3.6 Statement & Conclusions, Statement & Arguments 3.7 Clocks & Calendars 3.8 Cubes, Dice & Figure Counting 3.9 Mirror Images, Water Images, Embedded Figures & Non-Verbal Series 3.10 Decision Making & Data Analysis in Reasoning

4 Chapter 4: Paper-I Numerical Ability & Quantitative Aptitude

4.1 Arithmetic Foundations: Percentages, Profit & Loss, Ratio & Proportion 4.2 Averages, Simple/Compound Interest, Alligations & Mixtures 4.3 Time & Work, Pipes & Cisterns, Time, Speed & Distance 4.4 Algebra, Mensuration, Geometry & Data Interpretation (DI) 4.5 Number System, LCM, HCF & Decimal Fractions 4.6 Surds, Indices & Simplification 4.7 Problems on Ages 4.8 Boats & Streams and Problems on Trains 4.9 Permutations & Combinations 4.10 Probability for Quantitative Aptitude

5 Chapter 5: Paper-I General English & Verbal Ability

5.1 English Grammar, Error Spotting & Sentence Correction 5.2 Vocabulary Building: Synonyms, Antonyms, Idioms & Phrases 5.3 Reading Comprehension, Cloze Tests & Para Jumbles 5.4 Fill in the Blanks, Cloze Passages & Sentence Completion 5.5 Jumbled Sentences & Sentence Improvement

6 Chapter 6: Paper-II Engineering Mathematics

6.1 Matrix Algebra, Rank & Systems of Linear Equations 6.2 Eigenvalues, Eigenvectors & the Cayley-Hamilton Theorem 6.3 Limits, Continuity, Differentiability & Mean Value Theorems 6.4 Maxima-Minima, Indeterminate Forms & Taylor Series 6.5 Definite, Improper, Double & Triple Integrals 6.6 Partial Derivatives, Total Derivative & Multivariable Optimisation 6.7 First-Order Differential Equations: Linear & Non-Linear 6.8 Higher-Order Linear Differential Equations & Engineering Applications 6.9 Laplace Transforms & Transfer-Function Methods 6.10 Probability, Conditional Probability & Bayes' Theorem 6.11 Random Variables, Distributions & Descriptive Statistics 6.12 Numerical Methods: Root Finding, Integration & ODE Solvers

7 Chapter 7: Paper-II Engineering Mechanics & Statics-Dynamics

7.1 Force Systems, Coplanar Equilibrium & Lami's Theorem 7.2 Plane Trusses, Friction Mechanics & Screws/Wedges 7.3 Centroids, Center of Gravity & Moment of Inertia 7.4 Kinematics, Kinetics of Particles & Rigid Body Dynamics 7.5 Virtual Work & Lagrange's Equation 7.6 Rolling Friction, Belt-Pulley Drives, Brakes, Clutches & Vehicle Dynamics

8 Chapter 8: Paper-II Mechanics of Materials & Structural Integrity

8.1 Simple Stresses, Strains, Elastic Moduli & Thermal Stresses 8.2 Principal Stresses, Strain Energy & Mohr's Circle 8.3 Shear Force & Bending Moment Diagrams, Beam Bending & Shear Stresses 8.4 Torsion of Circular Shafts, Springs & Column Buckling 8.5 Thin Cylinders, Spheres & Thick-Walled Pressure Vessels 8.6 Deflection of Beams: Double Integration, Macaulay & Moment-Area 8.7 Shear Centre & Unsymmetrical Bending 8.8 Strain Gauges, Rosettes & Experimental Stress Analysis 8.9 Mechanical Testing: Universal Testing Machine, Hardness & Impact

9 Chapter 9: Paper-II Theory of Machines & Mechanical Vibrations

9.1 Simple Mechanisms, Kinematic Inversions & Velocity/Acceleration Diagrams 9.2 Cams & Followers, Toothed Gearing & Epicyclic Gear Trains 9.3 Flywheels, Centrifugal/Inertia Governors & Rotor Balancing 9.4 Free, Damped & Forced Single-Degree-of-Freedom Vibrations 9.5 Gyroscopic Couple & Gyroscopic Effects

10 Chapter 10: Paper-II Machine Design & Failure Theories

10.1 Static Failure Theories & Variable/Fatigue Loading 10.2 Design of Threaded Fasteners, Welded & Riveted Joints 10.3 Design of Shafts, Keys, Couplings & Rolling/Sliding Bearings 10.4 Design of Spur, Helical, Bevel & Worm Gears 10.5 Design of Helical, Leaf & Torsion Springs 10.6 Design of Brakes & Clutches: Energy, Lining Pressure & Heat

11 Chapter 11: Paper-II Fluid Mechanics & Hydraulic Machinery

11.1 Fluid Properties, Hydrostatic Forces & Buoyancy 11.2 Fluid Kinematics, Continuity & Bernoulli's Equation 11.3 Viscous Flow in Pipes, Boundary Layer & Minor Losses 11.4 Hydraulic Turbines, Centrifugal & Reciprocating Pumps 11.5 Dimensional Analysis, Similitude & Model Testing 11.6 Control-Volume Analysis: Continuity, Momentum & Energy

12 Chapter 12: Paper-II Thermodynamics, Thermal Cycles & Turbomachinery

12.1 Fundamental Concepts, First & Second Laws of Thermodynamics 12.2 Entropy, Availability, Exergy & Properties of Pure Substances 12.3 Air-Standard Gas Power Cycles: Otto, Diesel, Dual & Brayton 12.4 Vapour Power Cycles: Ideal, Reheat & Regenerative Rankine Cycles 12.5 Thermodynamic Relations: Maxwell, Clausius-Clapeyron & Joule-Thomson 12.6 Behaviour of Ideal & Real Gases and Equations of State 12.7 Air & Gas Compressors: Reciprocating, Rotary & Multi-Stage 12.8 Steam & Gas Turbines: Impulse, Reaction & Velocity Diagrams

13 Chapter 13: Paper-II Heat Transfer, Refrigeration & Air Conditioning

13.1 Steady & Unsteady Conduction, Extended Surfaces (Fins) 13.2 Forced/Natural Convection, Radiation & Heat Exchanger LMTD/NTU 13.3 Vapour Compression & Vapour Absorption Refrigeration Systems 13.4 Psychrometric Properties, Processes & Air Conditioning Systems 13.5 Gas Refrigeration, Heat Pump Cycles & Cryogenics

14 Chapter 14: Paper-II Materials Science, Metallurgy & Manufacturing Technology

14.1 Crystal Structures, Phase Diagrams & Iron-Iron Carbide Equilibrium 14.2 Heat Treatment Processes & Engineering Alloy Steels 14.3 Casting Processes, Metal Forming & Welding Metallurgy 14.4 Metal Cutting Mechanics, Tool Life & Machine Tools 14.5 Plastic Deformation, Yield Criteria & Load Estimation in Bulk Forming 14.6 Sheet Metal Forming: Shearing, Bending & Deep Drawing 14.7 Powder Metallurgy 14.8 Brazing, Soldering & Adhesive Bonding 14.9 Non-Traditional Machining: EDM, ECM, USM, AJM, LBM & EBM 14.10 Abrasive Machining, Grinding & Superfinishing 14.11 Principles of Work Holding, Jigs & Fixtures 14.12 Economics of Machining & Tool Life Optimisation

15 Chapter 15: Paper-II Metrology, Quality Control & Industrial Engineering / OR

15.1 Limits, Fits, Tolerances, Gauges & Surface Metrology 15.2 Production Planning, Forecasting & Inventory Control Models 15.3 Operations Research: Linear Programming & Transportation/Assignment 15.4 Project Management: CPM, PERT, Network Analysis & Crashing 15.5 Comparators & Interferometry 15.6 Coordinate Measuring Machines & Machine Tool Alignment Testing 15.7 Computer Integrated Manufacturing: CAD/CAM & Integration Tools 15.8 NC/CNC Machines & CNC Part Programming 15.9 Material Requirements Planning, Scheduling & Sequencing 15.10 Queuing Theory & Simple Queuing Models 15.11 Network Flow Models: Shortest Route, Maximal Flow & Spanning Tree

15.10 Queuing Theory & Simple Queuing Models

Key Takeaways Explain This Topic AI

Simple queuing models are named explicitly in the Operations Research bullet of the CIL Mechanical Paper-II syllabus.

Kendall's notation describes a queue as arrival distribution, service distribution, number of servers, system capacity, population and queue discipline, with M denoting the Markovian or exponential case.

Utilisation is the arrival rate divided by the product of the number of servers and the service rate, and the queue is stable only when it is less than one.

Queue length grows without bound as utilisation approaches one, which is why systems designed for full utilisation always congest.

Last updated: August 2026

Why Queues Form

A queue forms whenever demand for a service arrives faster than it can be served — but crucially, queues also form when average capacity exceeds average demand, purely because of variability in arrivals and service times. This is the central and counter-intuitive insight of queuing theory, and it explains why a workshop with nominally adequate capacity still has jobs waiting.

In a coal operation, queuing problems are everywhere: dumpers waiting at a shovel, wagons waiting at a loading silo, machines waiting for a fitter, and vehicles waiting at a weighbridge.

  • Kendall's Notation
  • A queuing system is described as A / B / c : ( K / N / D ) A/B/c\,:\,(K/N/D) A / B / c : ( K / N / D )
  • Position Meaning
  • A A A Arrival distribution
  • B B B Service time distribution
  • c c c Number of servers
  • K K K System capacity
  • N N N Population size
  • D D D Queue discipline

Common symbols for A A A and B B B :

  • Symbol Distribution
  • M Markovian — Poisson arrivals or exponential service times; memoryless
  • D Deterministic — constant
  • E k E_k E k ​ Erlang of order k k k
  • G General — any distribution

So M/M/1 means Poisson arrivals, exponential service, one server, infinite capacity and population, first come first served. M/M/c is the multi-server equivalent.

Queue disciplines: FCFS (first come first served), LCFS, SIRO (service in random order), and priority schemes.

The link between Poisson and exponential

If arrivals occur as a Poisson process with mean rate λ \lambda λ , then the time between successive arrivals is exponentially distributed with mean 1 / λ 1/\lambda 1/ λ . The two statements are equivalent descriptions of the same process, and the exponential distribution's memoryless property — the time already waited gives no information about the time still to wait — is what makes the mathematics tractable.

The M/M/1 Model

Let λ \lambda λ be the mean arrival rate and μ \mu μ the mean service rate of the single server. Define the traffic intensity or utilisation ρ = λ μ \rho = \frac{\lambda}{\mu} ρ = μ λ ​

The system is stable only if ρ < 1 \rho < 1 ρ < 1 . If ρ ≥ 1 \rho \geq 1 ρ ≥ 1 , arrivals outpace service and the queue grows without limit.

Standard results

  • Quantity Formula
  • Probability the system is empty P 0 = 1 − ρ P_0 = 1 - \rho P 0 ​ = 1 − ρ
  • Probability of exactly n n n in system P n = ( 1 − ρ ) ρ n P_n = (1-\rho)\rho^{n} P n ​ = ( 1 − ρ ) ρ n

Mean number in system L s L_s L s ​ ρ 1 − ρ = λ μ − λ \dfrac{\rho}{1-\rho} = \dfrac{\lambda}{\mu - \lambda} 1 − ρ ρ ​ = μ − λ λ ​

Mean number in queue L q L_q L q ​ ρ 2 1 − ρ = λ 2 μ ( μ − λ ) \dfrac{\rho^2}{1-\rho} = \dfrac{\lambda^2}{\mu(\mu-\lambda)} 1 − ρ ρ 2 ​ = μ ( μ − λ ) λ 2 ​

Mean time in system W s W_s W s ​ 1 μ − λ \dfrac{1}{\mu - \lambda} μ − λ 1 ​

Mean time in queue W q W_q W q ​ λ μ ( μ − λ ) = ρ W s \dfrac{\lambda}{\mu(\mu-\lambda)} = \rho\,W_s μ ( μ − λ ) λ ​ = ρ W s ​

Useful identities: L s = L q + ρ L_s = L_q + \rho L s ​ = L q ​ + ρ and W s = W q + 1 / μ W_s = W_q + 1/\mu W s ​ = W q ​ + 1/ μ . The difference between "in system" and "in queue" is exactly the one job being served.

Little's Law L = λ W \boxed{L = \lambda\,W} L = λ W ​

The average number in a system equals the arrival rate multiplied by the average time spent in it. Little's law is remarkably general — it holds for any queuing system regardless of the arrival or service distributions, the number of servers, or the discipline. It applies equally to L s L_s L s ​ with W s W_s W s ​ and to L q L_q L q ​ with W q W_q W q ​ .

Its practical use is that measuring any two of the three quantities gives the third. If a workshop has on average 12 jobs in progress and receives 3 jobs per day, the average throughput time is 4 days — no further data needed.

The Congestion Curve

The behaviour of L q L_q L q ​ as ρ \rho ρ rises is the most important qualitative result in the topic:

  • ρ \rho ρ L q L_q L q ​ (jobs waiting)
  • 0.50 0.50
  • 0.70 1.63
  • 0.80 3.20
  • 0.90 8.10
  • 0.95 18.05
  • 0.99 98.01

Queue length rises hyperbolically , not linearly. Going from 80% to 90% utilisation adds ten percentage points of utilisation but more than doubles the queue; going from 90% to 95% doubles it again.

The managerial implication is direct and often resisted: a facility planned for 95% or higher utilisation of a variable process will congest. Buffer capacity is not waste; it is what buys acceptable waiting times. This is the quantitative justification for keeping standby capacity in a maintenance workshop or an extra dumper in a shovel fleet.

Worked Example: Workshop Repairs

Breakdowns arrive at a mine workshop at an average of 4 per day, Poisson distributed. A single fitting bay repairs them at an average of 6 per day, exponentially distributed. ρ = 4 6 = 0.667 \rho = \frac{4}{6} = 0.667 ρ = 6 4 ​ = 0.667 L s = 4 6 − 4 = 2 machines in the system L_s = \frac{4}{6-4} = 2 \text{ machines in the system} L s ​ = 6 − 4 4 ​ = 2 machines in the system L q = 16 6 × 2 = 1.33 machines waiting L_q = \frac{16}{6\times2} = 1.33 \text{ machines waiting} L q ​ = 6 × 2 16 ​ = 1.33 machines waiting W s = 1 6 − 4 = 0.5 days = 12 hours W_s = \frac{1}{6-4} = 0.5 \text{ days} = 12 \text{ hours} W s ​ = 6 − 4 1 ​ = 0.5 days = 12 hours W q = 4 6 × 2 = 0.333 days = 8 hours W_q = \frac{4}{6\times 2} = 0.333 \text{ days} = 8 \text{ hours} W q ​ = 6 × 2 4 ​ = 0.333 days = 8 hours

Check by Little's law: L s = λ W s = 4 × 0.5 = 2 L_s = \lambda W_s = 4\times0.5 = 2 L s ​ = λ W s ​ = 4 × 0.5 = 2 . Consistent.

The probability the bay is idle is P 0 = 1 − 0.667 = 0.333 P_0 = 1 - 0.667 = 0.333 P 0 ​ = 1 − 0.667 = 0.333 , so the fitter is idle a third of the time — and yet machines still wait 8 hours on average. That combination of visible idleness and visible waiting is precisely what variability produces, and it is why intuitive capacity planning by average load alone fails.

The M/M/c Multi-Server Model

With c c c identical servers sharing one queue, utilisation becomes ρ = λ c μ \rho = \frac{\lambda}{c\,\mu} ρ = c μ λ ​

and stability again requires ρ < 1 \rho < 1 ρ < 1 . The probability of an empty system is P 0 = [ ∑ n = 0 c − 1 ( λ / μ ) n n ! + ( λ / μ ) c c ! ( 1 − ρ ) ] − 1 P_0 = \left[\sum_{n=0}^{c-1}\frac{(\lambda/\mu)^n}{n!} + \frac{(\lambda/\mu)^c}{c!\,(1-\rho)}\right]^{-1} P 0 ​ = [ n = 0 ∑ c − 1 ​ n ! ( λ / μ ) n ​ + c ! ( 1 − ρ ) ( λ / μ ) c ​ ] − 1

and the mean queue length is L q = P 0 ( λ / μ ) c ρ c ! ( 1 − ρ ) 2 L_q = P_0\,\frac{(\lambda/\mu)^c\,\rho}{c!\,(1-\rho)^2} L q ​ = P 0 ​ c ! ( 1 − ρ ) 2 ( λ / μ ) c ρ ​

with W q = L q / λ W_q = L_q/\lambda W q ​ = L q ​ / λ , W s = W q + 1 / μ W_s = W_q + 1/\mu W s ​ = W q ​ + 1/ μ and L s = λ W s L_s = \lambda W_s L s ​ = λ W s ​ .

One queue or several?

A practically important result: a single queue feeding c c c servers always outperforms c c c separate queues each feeding one server , even though the total capacity is identical. The single queue never leaves a server idle while someone waits elsewhere. This is why banks, airports and well-run workshops use a single feeding line rather than one line per counter.

Other Models in Brief

  • Model Feature
  • M/M/1/K Finite system capacity K K K ; arrivals are turned away when full, so the system is always stable

M/M/1/N (finite population) The machine repair model ; as machines fail, fewer remain to fail, so the arrival rate depends on the state

M/D/1 Constant service time; gives exactly half the queue length of M/M/1 at the same utilisation

M/G/1 General service; the Pollaczek-Khinchine formula shows L q L_q L q ​ rises with the variance of service time

The M/D/1 result deserves emphasis because of what it implies for practice: simply reducing variability in service times, with no increase in capacity at all, halves the queue. Standardising repair procedures, pre-kitting spares and using standard work packages are therefore direct queue-reduction measures, not merely tidiness.

Economic Analysis

The purpose of the analysis is normally to choose a service capacity. The total cost per unit time is C total = C s c + C w L s C_{\text{total}} = C_s\,c + C_w\,L_s C total ​ = C s ​ c + C w ​ L s ​

where C s C_s C s ​ is the cost of providing one server and C w C_w C w ​ the cost of one unit waiting. Service cost rises linearly with c c c while waiting cost falls hyperbolically, so the total has a clear minimum — evaluated by computing the total for c = 1 , 2 , 3 … c = 1, 2, 3\ldots c = 1 , 2 , 3 … and selecting the lowest.

In a mine, C w C_w C w ​ can be very large: a haul truck waiting is not merely an idle asset but lost production from the whole shovel-truck circuit. That high waiting cost is what justifies apparently generous workshop and standby capacity, and quantifying it is exactly what this model is for.