Professional Documents
Culture Documents
Queuing Theory
Queuing Theory
Queuing Theory
Managers use queuing models to be more efficient in providing customer service. Models measure average waiting times and average length of waiting lines.
Historical Roots
Agner Krarup Erlang, a Danish engineer who worked for the Copenhagen Telephone Exchange, published the first paper on queueing theory in 1909. David G. Kendall introduced an A/B/C queueing notation in 1953.
Arrival Stream
Customers In queue
Service Facility
Customers In queue
Service Facility
Customers In queue
Service Facilities
Little's Theorem
Little's theorem: L = / The average number of customers (N) can be determined from the following equation: Here lambda () is the average customer arrival rate and mu () is the average service time for a customer.
= Pn =
( )
P0
1, 2, 3,n =
Queuing Formulas
(Basic Model)
Average # of Customers in the system L=
-
W = L
Lq
2 = ( - )
Wq
= = ( - )
Queuing Formulas
(Basic Model)
= 25 Pts per hour
-
W =
25 30 - 25
= 5 customers 1 = 30 - 25 5
hour
Lq =
( - )
Lq
(25)2
30 (30 - 25)
25
6
= 4
1 6 customers
25
Wq =
( - )
25 30
30 (30 - 25)
1 6
hour
5 6
( ) ( )
1 2
25 P0 = 30 (.1667) = .1389 P0 =
( )
P2 =
( )
25 2 30 (.1667) = .1158
This formula provides the probability that n (0, 1, 2, 3, ) patients will be in the blood drawing room. If you add the individual probabilities for values of n cumulatively you would find 54 in the number of patients where all probabilities of n total 1.
n=0
( /)s 1 S! 1 - /S
Pn =
If 0 < n < S
If n > S
A 2 service channel queuing system for blood draws. An average of 50 patients arrive for a blood draw each hour. Two full-time phlebotomists can take one patient each every two minutes, thus 60 draws per hour can be done.
P0
0 ( / ) = 1 0!
[ (50 /60) 1 [ 0!
[
1+
+
0
( /)1 1!
1 ( /)2 1 - /2 2!
)]
)]
= 1
.833
(.833)2 2!
( 1 - 1.416 )]
Queuing Formulas
S = 2 service channels Average # of Patients waiting:
W = Wq +
L = Lq +
Queuing Formulas
S = 2 service channels Average # of Patients waiting:
Wq =
1 W = Wq + = .0035 + 1/60 = .0035+.016 = .0195 = .0195 hour = 1.17 minutes = .175 + 50/60 = .175 + .833 = 1.008 pts
L = Lq +
P0
0 ( / ) = 1 0!
[ (.6 /.5) 1 [ 0!
[
1+
( /)1 1!
1 ( /)2 1 - /2 2!
)]
( 1 -1.6/2(.5) )] )]
= 1
1.2
(1.2)2 2!
1 1 - .6
Queuing Formulas
S = 2 service channels Average # of Jobs waiting:
W = Wq +
= 1.13 +
.5
= 3.13 minutes
L = Lq +
= .68 +
.6 .5
= 1.88 jobs
( - )
Lq
.36 .4
.9 = .6
Wq =
W =
( - )
1 =
2.5 60
= $15.00
The new model might rent for a little more than the older model, but would still be cheaper than two 2006 models.
P0 =
1 - / 1 - ( /)M + 1
(M + 1)( / )M+1 1 - (
Average # of patients in the system Average length of waiting line Average patient waiting times
L=
1 - /
/)M+1
Summary
What is queue? Queue disicplines
FIFO LIFO SIRO
A waiting line.
Queuing models
Single server Single stage Multiple server Single stage Single server Multiple stage Multiple server Multiple stage