Professional Documents
Culture Documents
S12
S12
S12
Example 2. Pizza parlor. Requests for pizza delivery are received. Pizza
parlor sends out truck to deliver pizzas.
Example 3. Naval shipyard. Ships at sea break down and are sent to
shipyard for repairs. Ships are repaired and return to sea.
All objects that wait in lines to be served, loaded, checked out, or unloaded
is called as arrivals, or customers.
We assume that no more than one arrival can occur at a given instant. For a
case like a restaurant, this is a very unrealistic assumption. If more than one
arrival can occur at a given instant, we say that bulk arrivals are allowed.
The individuals or machines that perform the service for which the arrivals
are waiting are reffered to as servers.
The place where the service takes place is the service facility.
The Queue Discipline describes the method used to determine the order
in which customers are served.
The most common queue discipline is the FCFS discipline (FIFO) – first
come, first served.
Queuing Problems
The simplest queuing system is the single – channel system with constant
arrival and service.
When the arrival rate is greater than service rate, a waiting line will form.
When the arrival and service rates are constant and the arrival rate is greater,
the waiting line will continue to increase in length until either:
(1) the service rate increases (perhaps by the addition of another server),
or
(2) the arrival rate decreases (as customers, seeing the long line, turn
away)
f (t ) = λ e − λt , t ≥ 0.
We define λ to be the arrival rate, which will have units of arrivals per
hours.
Can be show that the average or mean interarrival time E (A) and variance is
given by
1
E ( A) =
λ
1
Var ( A) =
λ2
P ( A > t + h / A ≥ t ) = P ( A > h)
It can be proved that no other density function can satisfy this relation.
The no-memory property of the exponential distribution is important
because it implies that if we want to know the probability distribution of the
time until the next arrival, then it does not matter how long it has been since
the last arrival.
e −λ λn
P ( N = n) = (n=0,1,2, . . .)
n!
R ( Rt ) k −1 e − Rt
f (t ) = t≥0
(k − 1)!
k k
ET = , VarT =
R R2
The Kendall-Lee Notation for Queuing Systems
1/2/3/4/5/6
The first characteristic specifies the nature of the arrival process. The
following standard abbreviations are used:
λ
ρ= = traffic intensity
sµ
The M / M / 1/ GD / ∞ / ∞ Model
π j = ρ j (1 − ρ ) j = 0,1, 2, . . .
λ
L=
µ −λ
λ2
Lq =
µ (µ − λ )
Ls = ρ
L = λW
1
W =
µ −λ
λ
Wq =
µ (µ − λ)
1
Ws =
µ
Example.
An average of 10 cars per hour arrive at a single – server drive-in teller.
Assume the average service time for each customer is 4 minutes, and both
interarrival times and service times are exponential. Questions:
1. What is the probability that the teller is idle?
2. What is the average number of cars waiting in line for the teller? (A
car that is being served is not considered to be waiting in line).
3. What is the average amount of time a drive-in customer spends in the
bank parking lot (including time in service)?
4. On the average, how many customers per hour will be served by the
teller?
Solution
By assumption, we are dealing with an M / M / 1/ GD / ∞ / ∞ queuing system
10 2
which λ = 10 cars per hour and µ = 15 cars per hour. Thus, ρ = = .
15 3
2 1
1. π 0 = 1 − ρ = 1 − = . Thus, the teller will be idle an average of one-third
3 3
of the time.
ρ2 4
2. We seek Lq . Lq = = customers.
1− ρ 3
L ρ
3. We seek W. W = . L= = 2 customers.
λ 1− ρ
2 1
Thus, W = = hour =12 min utes.
10 5
4. If the teller were always busy, he would serve an average of µ = 15
customers per hour. From part (1), we know that teller is onlybusy two-
thirds of the time. Thus, during each hour, the teller will serve an average of
2
(15) = 10 customers. This must be the case, because in the steady state, 10
3
customers are arriving each hour, so each hour, 10 customers must leave the
system.
The M / M /1/ GD / c / ∞ Model
If λ ≠ µ ,
1− ρ
π0 =
1 − ρ c +1
π j = ρ j π0 j = 1, 2, 3, . . ., c
πj =0 j = c, c + 1, c + 2, . . .
ρ [1 − (c + 1) ρ c + c ρ c +1 ]
L=
(1 − ρ c +1 )(1 − ρ )
If λ = µ
1
πj = j = 0,1, 2, . . ., c
c +1
c
L=
2
For all values of λ and µ
Ls = 1 − π 0
Lq = L − Ls
L
W=
λ (1 − π c )
1 On the average , how many haircuts per hour will the barber
complete ?
2 On the average, how much time will be spent in the shop by a
customer who enters?
Solution 1 A fraction π10 of all arrivals will find the shop is full. Thus,
an average of λ (1-π10) will enter the shop each hour. All
entering customers will receive a haircut , so the barber will
give an average of λ (1-π10) haircuts per hour. From our
problem c=10, λ=20 customers per hour, and µ=5 customers
20
per hour. Then ρ = = 4, and (34) yields
5
1− 4
π0 =
1 − 411
and
1− 4 − 3(410 )
π 10 = 4 = = .75
10
1 − 411 1 − 411
3
Thus , an average of 20(1 − ) = 5 customers per hour will
4
receive haircuts. This means that an average of 20-5=15
prospective customers per hour will not enter the shop.
2 To determine W , we use (35) and (37). From (35),
L =
[
4 1 − 11 ( 4 10 ) + 10 ( 4
11
)
] = 9 , 67 customers
(1 − 4 11 )( 1 − 4 )
λ
ρ=
µ
L = expected number of broken machines
Lq =expected number of machines waiting for service
W = average time a machine spends broken
Wq = average time a machine spends waiting for service
πj = steady-state probability that j machines are broken
λ = rate at which machine breaks down
µ = rate at which machine is repaired
π j = C Kj ρ j π 0 j = 0,1, 2, . . ., R
C Kj ρ j j!π 0
πj = j = R + 1, R + 2, . . ., K
R! R j − R
K
L= jπ j
j =0
Lq = ( j − R) π j
λ = λ ( K − L)
L
W =
λ
Lq
Wq =
λ
Example The Police Department has 5 patrol cars. A patrol car breaks
down and requires service once every 30 days. The police department has
two repair workers, each of whom takes an average of 3 days to repair a
car. Breakdown times and repair times are exponential.
1
π1 = C π 0 = 0.5π 0
1
5
10
2
1
π2 = C π 0 = 0.1π 0
2
5
10
3
1 3!
π 3 = C53 π 0 = 0.015π 0
10 2!2
4
1 4!
π4 = C π 0 = 0.0015π 0
4
5
2!2 2
10
5
1 5!
π5 = C π 0 = 0.000075π 0
5
5
2!23
10
π 0 = 0.619
π 1 = 0.310
π 2 = 0.062
Now we yields
π 3 = 0.009
π 4 = 0.001
π5 = 0
1. The expected number of cars in good condition is K − L , which is
given by
5
K− j π j = 5 − (0 ⋅ 0.619 + 1 ⋅ 0.310 + 2 ⋅ 0.062 + 3 ⋅ 0.009 + 4 ⋅ 0.001 + 5 ⋅ 0 = 4.535 cars
j =o
in good conditions
L
2. We seek W = . λ= λ (5 − j )π j = 0.151 car per day
λ
4.535
or λ = λ ( K − L) = = 0.151 car per day.
30
0.465
Since L = 0.465 car, we find that W = = 3.08 days.
0.151
3. The fraction of the time that a particular repair worker will be idle is
π 0 + 0.5π 1 = 0.774
If there were three repair people, the fraction of the time that a particular
server would be idle would be
2 1
π0 + π1 + π2
3 3