Dave’s

Car Wash

Enter Exit

Comments?

02/11/2025 1
 Real World Queuing Systems

• Commercial Queuing Systems : ATM

• Transportation service systems: Traffic Signal

• Business-internal service systems: Conveyor Belts

• Social service systems: Judicial Process

02/11/2025 2
 Learning Outcomes

• To solve a real time queuing problem

02/11/2025 3
 Components of Queuing Process

Input Source The Queuing System Output

Served
Calling Jobs Service Jobs
Queue Mechanism
Population
leave the
system

Arrival Queue
Process Discipline
Service
Queue
Process
Configuration
02/11/2025 4
 Case study: Restaurant

Number of cashiers 1 2 3 4 5 6 7
Average waiting time (min) 16.2 10.3 6.9 4.8 2.9 1.9 1.3
Idleness % of cashier 0 8 12 18 29 36 42

a) What is the Percentage utilization(efficency) for 5

cashiers?
b) The manager wants to keep the average waiting time
around 3 minutes and simultaneously maintain the efficiency
of the facility at 90% approximately. Can the two goals be
achieved ? Explain.

02/11/2025 5
 Costs of a Queue

cost Total Cost

$
Service Costs

Waiting Costs

Level of Service
02/11/2025 6
02/11/2025 7
 Purpose of Queuing Models
Queuing models are used to:

 Describe the behavior of queuing systems

 Determine the level of service to provide

 Evaluate alternate configurations for providing

service

02/11/2025 8
 Kendall Notation 1/2/3(/4/5/6)

Six parameters in shorthand

1. Arrival Distribution
2. Service Distribution
3. Number of servers
4. Total Capacity (infinite if not specified)
5. Population Size (infinite)
6. Service Discipline (FCFS/FIFO)

02/11/2025 9
 Terminology
• λ = average number of customers that arrive per unit
of time (also called the "arrival rate" of
the system).
• µ = average number of customers that can be served
by a single channel per unit of time (also called
the "service rate" of a channel).

• C= Number of serving channels

• ρ = λ/ µ = average utilization of the facility

02/11/2025 10
 Performance Measures

• Wq = Expected/ Average waiting time in the queue

• Ws = Expected/Average waiting time in the system
• Lq = Expected/Average no people in the queue.
• Ls = Expected/Average no people in the system.
• P0 = Probability of idle service facility
•  = System utilization
• Pn = Probability of n units in system,

02/11/2025 11
 (M/M/1: ∞/ ∞/ FIFO) Model
Characteristics
1. Type: Single-channel, single-phase system
2. Input source: Infinite; no balks, no reneging
3. Arrival distribution: Poisson
4. Queue: Unlimited; single line
5. Queue discipline: FIFO (FCFS)
6. Service distribution: Negative exponential
7. Relationship: Independent service & arrival
8. Service rate > arrival rate
02/11/2025 12
 M/M/1 Queue Model

02/11/2025 13
 M/M/1 Queue Model

02/11/2025 14
Example
Customer arrive at a clinic at the rate of 8/hr (Poisson
arrival) and the doctor can serve at the rate of 9/hr
(Exponential).

a) What is the probability that a customer does not join

the queue and walks into the doctors room?

b) What is the probability that there is no queue?

c) What is the expected number in the system?

02/11/2025 15
Single Server Infinite Queue Length Model (M/M/1:
∞/∞/FIFO)
M – Poisson arrivals (Markovian)
M – Exponential service (Markovian)
C – No of servers
∞ - Infinite queue Length
∞ - Infinite population
FIFO – Queue discipline

02/11/2025 16
• The memory less property ensures that during a small
interval h a maximum of only one event takes place.
• The arrivals follow a Poisson distribution with mean λ
• The services follow a Exponential with mean µ
• Let - probability that there are n people in the system at time t
• Let - probability that there are n people in the system at time t
+h
= Probability that there are n people at time t and there are
is no arrival or service completed during h + Probability that
there are n-1 people at time t and there are one arrival and
no service during h + Probability that there are n+1 people at
time t and there are no arrival and one service during h
• This equation assumes that only one event (either an arrival or
service) can happen during a small interval h and both cannot
happen during small interval h
02/11/2025 17
Derivation for
• λh – Probability one arrival happening
• µh - Probability one service completed
• (1 - λh) – Probability no arrival happening during h
• (1 - µh) – Probability no service happening during h

Memory less property is not a state dependent

= * Probability no arrival and no service + *
Probability no arrival and one service + * Probability
one arrival and no service
= (1 - λh) (1 - µh) + (1 - λh) µh + λh (1 - µh)

02/11/2025 18
Simplify and leave higher order terms
= (1 – λh - µh) + µh
+ λh

At steady state condition, rate of change of w.r.t h = 0

- ) / h = - ( λ+ µ) + µ
+ λ

= - ( λ+ µ) + µ + λ

( λ+ µ) = µ + λ (1)

02/11/2025 19
Derivation for
= (1 – λh) µh + (1 – λh)*1

(1 – µh) is taken as “1” because it is not possible to do any

service when the number of customer is zero at time t

-)/h = µ - λ
0= µ - λ

µ = λ (2)

Put n = 1 in equation (1)

02/11/2025
= ρn P0 20
Sum of steady state probabilities = 1
P0 + P1 + …. + ∞ = 1

P0 + ρP0 + …. + ∞ = 1

P0 [1+ ρ+ ρ2+…. + ∞] = 1

Infinite geometric series, first term = a, second term = r,

when r < 1, then it is [a/1-r],

P0 [1/1- ρ] = 1

02/11/2025
P0 =1- ρ (ρ should be < 1) 21
Derivation of Performance measures
Ls = Expected no people in the system
• Ls =
Ls = [ρ /1- ρ]
Lq = Expected no people in the Queue
Lq = Ls - ρ
Little’s law:
It captures length of any system and time associated with
any system
Ls = λWs
Lq = λWq

02/11/2025 22
• Reliance fresh at kunnamangalam is in operation from 2010
onwards. Ate present it has three cash collection points. Manager
decides the number of collection points based on the customers in
line as per the given schedule below:

Customers arrive in the counters area according to a Poisson

distribution with a mean rate of 10 customers per hour. The average
check-out time per customer is exponential with mean 12minutes.
Determine the steady-state probability P10 customers in the check-out
area and expected number of idle counters.
02/11/2025 23
 THANK YOU

02/11/2025 24