Queueing Theory

Queueing theory estimates waiting, congestion, and service performance in stochastic systems.

Key formulas & points

Skim these first — then read the full notes below.

  • λ arrival rate; μ service rate; ρ utilisation
  • M/M/c multiple servers — Erlang C table
  • Finite queue modifies effective arrival

Topic details

Introduction

Industrial applications include machine repair, inspection counters, tool crib, and service desks. Chase treats queue design as a trade-off between waiting cost and service capacity cost.

Key relations & formulas

Formulas (Indian textbook notation)

  • MM/1:L=λ(μλ);W=1(μλ);ρ=λμ\frac{M}{M}/1: L = \frac{\lambda}{(\mu-\lambda)}; W = \frac{1}{(\mu-\lambda)}; \rho = \frac{\lambda}{\mu}

Formulas (Indian textbook notation)

  • Lq=ρ2(1ρ);Wq=ρ(μλ)L_{q} = \frac{\rho^{2}}{(1-\rho)}; W_{q} = \frac{\rho}{(\mu-\lambda)}
Littleslaw:L=λWLittle's law: L = \lambda W
(stable system)

Notation and sign conventions

Relation 1 —
MM/1:L=λ/\frac{M}{M}/1: L = \lambda/

Formulas (Indian textbook notation)

  • MM/1:L=λ(μλ);W=1(μλ);ρ=λμ\frac{M}{M}/1: L = \frac{\lambda}{(\mu-\lambda)}; W = \frac{1}{(\mu-\lambda)}; \rho = \frac{\lambda}{\mu}
Write this relation with symbols exactly as in Operations Research — Hamdy Taha before substituting numbers. Examiners award partial marks for a correct setup even when arithmetic slips.
Relation 2 —
Lq=ρ2/L_{q} = \rho^{2}/

Formulas (Indian textbook notation)

  • Lq=ρ2(1ρ);Wq=ρ(μλ)L_{q} = \frac{\rho^{2}}{(1-\rho)}; W_{q} = \frac{\rho}{(\mu-\lambda)}
Write this relation with symbols exactly as in Operations Research — Hamdy Taha before substituting numbers. Examiners award partial marks for a correct setup even when arithmetic slips.
Relation 3 —
Littleslaw:L=λWLittle's law: L = \lambda W
Littleslaw:L=λWLittle's law: L = \lambda W
(stable system)
Write this relation with symbols exactly as in Operations Research — Hamdy Taha before substituting numbers. Examiners award partial marks for a correct setup even when arithmetic slips.

Concept in depth

For M/M/1, stability requires lambda < mu. Once utilisation nears 1, waiting explodes nonlinearly, which is a key managerial insight. Buffa and Mahajan-style exam explanations should explicitly define assumptions: Poisson arrivals, exponential service, FCFS discipline, infinite population/queue unless stated.

Assumptions and validity limits

State assumptions explicitly before using any relation for queueing theory — steady state, uniform properties, linear elastic material, ideal gas, incompressible flow, etc., as applicable.
Wrong assumptions invalidate the entire solution even when the formula is correct. In Operations Research viva and GATE descriptive questions, listing valid assumptions often earns separate marks.

Step-by-step problem approach

1. Read the question and list given data with SI units (common in Operations Research papers).
2. Draw a neat labelled diagram where applicable — examiners in Indian universities award diagram marks even when arithmetic slips.
3. Identify which relation from this topic applies to queueing theory.
4. Use equation 1:
MM/1:L=λ/\frac{M}{M}/1: L = \lambda/
.
5. Use equation 2:
Lq=ρ2/L_{q} = \rho^{2}/
.
6. Substitute values, compute, and verify units and sign (direction).
7. State conclusion in one line — e.g. safe/unsafe, stable/unstable, feasible/infeasible.

Applications & exam relevance

Queueing Theory appears in logistics and planning. In Indian industrial curricula this topic is tested because it connects theory to mathematical decision models.
GATE and semester exams often combine queueing theory with earlier units — revise prerequisites before attempting mixed problems.
Industry interview panels sometimes ask: "Where did you use queueing theory?" — answer with a lab, mini-project, or plant visit example if possible.

Common mistakes in exams

Students often apply formulas even when lambda >= mu, where steady-state does not exist. Another error is confusing L with Lq and W with Wq.

Quick revision checklist

Before attempting queueing theory problems, confirm you can:
1. λ arrival rate; μ service rate; ρ utilisation
2. M/M/c multiple servers — Erlang C table
3. Finite queue modifies effective arrival
Revise the solved examples in Operations Research — Hamdy Taha and one previous-year GATE or university paper for this unit.

Worked examples

Try the problem first — open the solution when you are ready to check.

M/M/1 waiting calculation

Problem

Arrival rate lambda = 8 customers/hour and service rate mu = 12 customers/hour. Compute rho, W and Wq.

Solution

rho = 8/12 = 0.667. W = 1/(12-8) = 0.25 hour = 15 min. Wq = rho/(mu-lambda) = 0.667/4 = 0.1667 hour = 10 min.

Conceptual check — Queueing Theory

Problem

In a Operations Research semester or GATE paper you are asked: "State the main assumption, the governing relation, and one practical consequence of queueing theory." What should a complete answer include?

📖 Standard books (India)

  • Operations ResearchHamdy Taha

    Read: Syllabus unit

    LP, transportation, and simulation