Queuing Theory AJ

LITTLE’S
QUEUING
FORMULA
Little’s Queuing
Formula
= average number of arrivals entering the system per unit
time
L = average number of customers present in the queuing
system
Lq = average number of customers waiting in line
Ls = average number of customers in service
W = average time a customer spends in the system
Wq = average time a customer spends in line
Ws = average time a customer spends in service
Little’s Queuing
ForFormula
any queuing system in which a steady-state
distribution exists, the following relations hold:
●L=W
● Lq =
● Ls =
Example: if = 46 clients arrive at a restaurant every hour,
on average, and if they spend W = 10 minutes before being
served, on average, then there will be L = 46×1/6 ≈ 7.7
clients waiting to be served at all times, on average.
THE M/M/1
QUEUING
SYSTEM
The M/M/1 Queuing
AnSystem
M/M/1 system has exponential interarrival times
with rate , exponential service times with rate µ, and
one server.
Let = / be the traffic intensity of the queuing
system.
Assuming ≤ 1, the probability of exactly customers in
the system is
(1 − ), = 0,1,2, …
The probability of exactly no customers in the system
is thus (1 − )
The M/M/1 Queuing
Average number in service:
System
Average number waiting in line:
Average number waiting in the system:
Average waiting time in service:
Average waiting time in the line:
Average waiting time in the system:
The M/M/1 Queuing
System
Intuitively, if ≥ 1, then it must be that ≥ , and if the
arrival rate is greater than the service rate, then the
state of the system will grow without end.
Notice that (as expected) as approaches 1, both W
and become very large.
For near zero, approaches zero, but for small , W
approaches 1/, the mean service time.
STATION
SINGLE-PUMP GAS
Suppose that all car
owners fill up when
their tanks are exactly
half full. At the
present time, an
average of 7.5
customers per hour
arrive at a single-
pump gas station. It
takes an average of 4
minutes to service a
car. Assume that inter-
arrival times and
service times are both
Single-Pump Gas Station
ByExample
assumption the single-pump gas station is a M/M/1 queueing
system with = 7.5 arrivals per hour and the capacity to serve =
60⁄4 = 15 vehicles per hour.
Then the
● traffic intensity is = 0.5;
● average number of customers waiting in this system is = 1;
● average waiting time in the system W = mins.
Suppose now that all
STATION
SINGLE-PUMP GAS car owners purchase
gas when their tanks
are exactly three-
quarters full due to a
gas shortage and
panic buying takes
place. Assume that the
average service time
has been reduced to 3
$ 1 minutes. How has
panic buying affected
and W?
Single-Pump Gas Station
these new assumptions, we have 𝜆 = 2(7.5)= 15 arrivals
Example
per hour and the capacity to serve 𝜇 = 18 cars per hour.
With
Then the
 traffic intensity is 𝜌 =
 average number of customers waiting in this system is 𝐿
= = 5;
 average waiting time in the system 𝑊 = = 0.33hour =
20mins.
Thus, panic buying has caused longer lines.
M/M/1 With Limited
In real cases, queues never become infinite, but are
Capacity
limited due to space, time or service operating policy.
Examples: parking of vehicles in a supermarket is
restricted to the spaces in the parking area; limited
seating arrangement in a restaurant.
The probability of exactly no customers in such a
system is
where 𝑁 is the maximum number allowable in the

system.
M/M/1 With Limited
probability of exactly 𝑛 customers in the system is
Capacity
The
𝑛=1,2,…,𝑁
𝑛 =𝑁 + 1, 𝑁 + 2, …
The average number waiting in the system is
M/M/1 With Limited
that 𝜆− 𝜆𝑝 arrivals per unit time actually enter
Capacity
Note
the system on average due to the capacity limit. With
this fact, we can show that:
always exists, because even if 𝜆 ≥ 𝜇, there is never

As a consequence of this restriction, a steady state
more than 𝑁 customers in the system.

Steady-State (Queue
Equilibrium
Barber Shop
A 1-man barber shop has a
total of 10 waiting seats.
Inter-arrival times are
exponentially distributed,
and an average of 20
prospective customers
arrive each hour at the
shop. The barber takes an
average of 12 minutes to
cut each customer’s hair
(haircut times are
exponentially distributed).
On average, how much
time does an arriving
Barber Shop Example
From the statement of the problem, 𝑁 = 10, 𝜆 = 20
customers per hour, and 𝜇 = 60/12 = 5 customers per
hour. Then the traffic intensity in the system is 𝜌 =
20/5 = 4, and we have
This shop is crowded, and the barber would be well
would that have on 𝐿 and 𝑊?

advised to hire at least one more barber– what effect
THE M/M/C
QUEUING
SYSTEM
The M/M/c Queuing
assumptions as 𝑀/𝑀/1 except that the system
System
now has 𝑐 servers able to serve from a single line of
Same
customers, like one could find in a bank.

If each server completes service at rate 𝜇, the system
rate is 𝑐𝜇. The traffic intensity is 𝜌 = cµ , and we again
assume that 𝜌 ≤ 1.
If 𝜌 ≥ 1, no steady state exists. In other words, if the
arrival rate 𝜆 is at least as large as the maximum
possible service rate cµ, the system "blows up” and
the queue never empties.
The M/M/c Queuing
It System
can be shown that the steady-state (long-run)
probability that all servers are busy is given by:
where 𝑝 is the probability that there is no customer in

the system (its formula is omitted for simplicity). We
thus have
Bank Tellers
A bank has two tellers.
An average of 80
customers per hour
arrive at the bank and
wait in a single line for
an idle teller. The
average time to serve a
customer is 1.2
minutes. What is the
expected number of
customers present in
the bank queue? What
is the expected length
Bank Tellers
We are dealing with an 𝑀/𝑀/2 model with 𝜆 =
80customers per hour and 𝜇 = 50 customers per hour,
whence 𝜌 =
From the table, we have 𝑃 (𝑛 ≥ 2) =0.71.
Then
THANK
YOU!

Queuing Theory AJ

Uploaded by

Copyright:

Available Formats

Queuing Theory AJ

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Queuing Theory AJ

Uploaded by

Copyright:

Available Formats

LITTLE’S

where 𝑁 is the maximum number allowable in the

always exists, because even if 𝜆 ≥ 𝜇, there is never

more than 𝑁 customers in the system.

This shop is crowded, and the barber would be well

would that have on 𝐿 and 𝑊?

customers, like one could find in a bank.

where 𝑝 is the probability that there is no customer in

You might also like