In a local post office, a particular service is operated by one person. The arrival pattern of customers on a particular day follows a Poisson distribution with a mean arrival rate of 10 people per hour. Customers are served on a First-Come, First-Served (FCFS) basis and the service time is estimated to be exponentially distributed with an average time of 4 minutes. Determine :
(I) Probability (there is no queue)
(II) The average size of the queue
(III) The expected waiting time in the queue
(IV) Probability (a customer will spend less than 12 minutes in the queue)
10 marks · directive: Determine
The core of a good answer
This is an M/M/1 queue with λ = 10 per hour, μ = 15 per hour and ρ = 2/3: (I) no one is waiting when there are at most one customer in the system, P(N ≤ 1) = 1 − ρ² = 5/9 ≈ 0·556 (the system is completely empty with probability P₀ = 1/3); (II) Lq = ρ²/(1 − ρ) = 4/3 ≈ 1·33 customers; (III) Wq = λ/[μ(μ − λ)] = 2/15 hour = 8 minutes; (IV) P(Wq < 12 min) = 1 − ρe^(−(μ − λ)t) = 1 − (2/3)e^(−1) ≈ 0·755.
An outline written by upsc.help, not an official UPSC answer; every fact checked by a separate review. How we work
What the question asks
Identify the model (Poisson arrivals, exponential service, one server, FCFS, infinite capacity), compute ρ, then apply the standard steady-state formulas. Be explicit about the interpretation of 'no queue' and use the waiting-time distribution in the queue (which has an atom at zero) for part (IV).
Answer outline
Introduction
λ = 10 per hour; mean service time 4 minutes, so μ = 60/4 = 15 per hour. ρ = λ/μ = 2/3 < 1, so a steady state exists. Pₙ = (1 − ρ)ρⁿ.
Step 1: (I) Probability of no queue
- A queue (people waiting, excluding the one in service) exists only if N ≥ 2.
- P(no queue) = P₀ + P₁ = (1 − ρ)(1 + ρ) = 1 − ρ² = 1 − 4/9 = 5/9 = 0·556.
- If 'no queue' is read as an idle server: P₀ = 1 − ρ = 1/3 = 0·333; state the reading used.
Step 2: (II) Average queue size
- Lq = ρ²/(1 − ρ) = (4/9)/(1/3) = 4/3 = 1·33 customers.
- Related: Ls = ρ/(1 − ρ) = 2 customers in the system; average length of a non-empty queue = 1/(1 − ρ) = 3.
Step 3: (III) Expected waiting time in the queue
- Wq = Lq/λ = λ/[μ(μ − λ)] = 10/(15 × 5) = 2/15 hour = 8 minutes.
- Time in system Ws = 1/(μ − λ) = 1/5 hour = 12 minutes (Little's law check: Ls = λWs = 10 × 0·2 = 2).
Step 4: (IV) P(wait in queue < 12 minutes)
- Distribution of Wq: P(Wq = 0) = 1 − ρ; for t > 0, P(Wq > t) = ρe^(−(μ − λ)t).
- t = 12 min = 0·2 h, (μ − λ)t = 5 × 0·2 = 1.
- P(Wq < 0·2) = 1 − (2/3)e^(−1) = 1 − 0·2453 = 0·7547.
Conclusion
(I) 0·556 (P₀ = 0·333 if read as an empty system); (II) 1·33 customers; (III) 8 minutes; (IV) about 0·755. All values recomputed in Python.
Examples and data to cite
- M/M/1 models are used for single-window counters such as post offices, ATMs and toll booths.
- Little's law L = λW links queue length and waiting time in a stable queue (here 2 = 10 × 0·2 h).
Facts to remember
- M/M/1: Pₙ = (1 − ρ)ρⁿ, ρ = λ/μ < 1.
- Lq = ρ²/(1 − ρ); Ls = ρ/(1 − ρ).
- Wq = λ/[μ(μ − λ)]; Ws = 1/(μ − λ).
- P(Wq > t) = ρe^(−(μ − λ)t), t > 0.
- Little's law: Lq = λWq.