Module D Student Notes
Module D Student Notes
Module D Student Notes
D Waiting Lines
A. Why Waiting Lines Form
1. Define “customers” in waiting lines.
2. Examples:
• Single-channel, multiple-phase
• Multiple-channel, single-phase
• Multiple-channel, multiple-phase
• Mixed arrangement
Service Service
facility 1 facility 2
Service Service
facility 3 facility 4
3. Priority rule
a.
b.
c.
2
Waiting Lines
D. Probability Distributions
1. Arrival distribution
2. Customer arrivals can often be described by the Poisson distribution with mean = λT
and variance also = λT
a. Arrival rate:
b. Interarrival times
Pn =
(λ T )n − λ T
e for n = 0,1,2,…
n!
Where
Pn = Probability of n arrivals in T time periods
λ= Average numbers of customer arrivals per period
e= 2.7183
3. Service time distribution can be described by an exponential distribution with mean
= 1/µ and variance = (1/µ )2
a. Service time:
P (t ≤ T ) = 1 − e − µT
Where
µ= Average number of customers completing service per period
t= Service time of the customer
T= Target service time
b. The exponential distribution assumes that each service time is independent of
those that preceded it.
b.
c.
d.
e.
3
Waiting Lines
2. Single-server model
a. assumptions
Number of servers:
Number of phases:
Customer population (input source):
Arrival distribution:
Service distribution:
Priority rule:
Waiting line:
b. Formulas
λ
ρ= Average utilization of system =
µ
Pn = Probability that n customers are in the system = (1 − ρ )ρ n
λ
L= Average number of customers in the service system =
µ −λ
Lq = Average number of customers in the waiting line = ρL
1
W = Average time spent in the system, including service =
µ −λ
Wq = Average waiting time in line = ρW
4
Waiting Lines
1
W = = 0.17 hr (or 10 minutes)
(µ − λ )
0.17(µ − λ ) = 1 , where λ = 20 customers arrival rate per hour
µ=
3. Multiple-server model
b. Formulas
λ
ρ= Average utilization of system =
sµ
−1
s −1 (λ µ )n (λ µ )s 1
P0 = Probability that zero customers are in the system = ∑ +
n = 0 n ! s! 1 − ρ
(λ µ )n
P0 0 < n < s
n!
Pn = Probability that n customers are in the system =
(λ µ ) P n ≥ s
n
s! s n − s 0
P0 (λ µ ) ρ
s
Lq = Average number of customers in the waiting line =
s!(1 − ρ )
2
Lq
Wq = Average waiting time of customers in line =
λ
1
W= Average time spent in the system, including service = Wq +
µ
L= Average number of customers in the service system = λW
5
Waiting Lines
1. Average utilization λ
ρ= =
of system sµ
2. 1
P0 = =
λ
S
Probability that
zero customers 1 + λ + µ 1
µ
1 − ρ
are in the system s
3. Average number P0 (λ µ ) ρ
s
of customers in Lq = =
s!(1 − ρ )
2
the waiting line
4. Average waiting Lq
time of customers Wq = = hrs (or ______ minutes)
in line λ
4. Little’s Law
5. Finite-source model
a. Assumptions
b. Formulas
−1
N N! λ
n
6
Waiting Lines
P0 = ∑
Probability that zero n =0 ( N − n )! µ
1. customers are in the
1
system = =
8! 8! 8! 8
8! (0.08) + 7! (0.08) + ⋯ = 0 (0.08)
0 1
Average utilization of ρ = 1 − P0 =
2.
the server
Average number of µ
3. customers in the service L=N− (1 − P0 ) =
system λ