Professional Documents
Culture Documents
Chapter 6
Chapter 6
Queueing Models
Banks, Carson, Nelson & Nicol
Discrete-Event System Simulation
Purpose
Outline
Calling Population
[Characteristics of Queueing System]
System Capacity
[Characteristics of Queueing System]
Limited capacity, e.g., an automatic car wash only has room for
10 cars to wait in line to enter the mechanism.
Unlimited capacity, e.g., concert ticket sales with no limit on the
number of people allowed to wait to purchase tickets.
Arrival Process
[Characteristics of Queueing System]
Arrival Process
[Characteristics of Queueing System]
Balk: leave when they see that the line is too long,
Renege: leave after being in the line when its moving too slowly,
Jockey: move from one line to a shorter line.
First-in-first-out (FIFO)
Last-in-first-out (LIFO)
Service in random order (SIRO)
Shortest processing time first (SPT)
Service according to priority (PR).
Queueing Notation
[Characteristics of Queueing System]
Queueing Notation
[Characteristics of Queueing System]
Pn:
Pn(t):
:
e:
:
:
An:
Sn:
Wn:
W n Q:
L(t):
LQ(t):
L:
LQ:
w:
w Q:
Let Ti denote the total time during [0,T] in which the system
contained exactly i customers, the time-weighted-average number
in a system is defined by:
1
L =
T
Ti
i =0
i =0
iT = i T
iT
i =0
1
T
L(t )dt
0
1
L =
T
L(t )dt L
0
as T
1
1 T
LQ =
iTiQ =
LQ (t )dt LQ as T
T i =0
T 0
if L(t) = 0
0,
LQ (t ) =
L(t ) 1, if L(t) 1
0(15) + 1(4) + 2(1)
LQ =
= 0.3 customers
20
i =1
where W1, W2, , WN are the individual times that each of the N
customers spend in the system during [0,T].
w as N
For stable systems: w
If the system under consideration is the queue alone:
1 N
w Q = Wi Q wQ as N
N i =1
G/G/1/N/K example (cont.): the average system time is
w =
L = w
Average
System time
Arrival rate
L = w as T and N
Server Utilization
[Characteristics of Queueing System]
Server Utilization
[Characteristics of Queueing System]
1
L s =
T
T T
(L(t ) L (t ))dt = T
T
Server Utilization
[Characteristics of Queueing System]
and
= E ( s ) =
<1
Server Utilization
[Characteristics of Queueing System]
= s =
, where < c for stable systems
c
c
In
System incurs a cost for each customer in the queue, say at a rate
of $10 per hour per customer.
The average cost per customer is:
Q
N
= $10 * w Q
Wj is the time
customer j spends
in queue
N
j =1
$10 *W jQ
customer $10 * w Q
= $10 * w Q = $10 * LQ / hour
hour customer
system is:
L=
nP
n =0
Apply Littles equation to the whole system and to the queue alone:
w=
, wQ = w
LQ = wQ
M/G/1 Queues
2 (1 + 2 2 )
2 (1 + 2 2 )
, LQ =
2(1 )
2(1 )
(1 / 2 + 2 )
(1 / 2 + 2 )
, wQ =
2(1 )
2(1 )
M/G/1 Queues
2
2(1 )
2 2
2(1 )
M/G/1 Queues
The proportion of arrivals who find Able idle and thus experience no delay is P0
= 1- = 1/5 = 20%.
(1 / 30) 2 [25 2 + 4]
= 2.097 customers
2(1 5 / 6)
The proportion of arrivals who find Baker idle and thus experience no delay is
P0 = 1- = 1/6 = 16.7%.
M/M/1 Queues
Pn = (1 ) n
= / ,
2
2
=
1
( ) 1
1
1
=
, wQ =
=
w=
(1 )
( ) (1 )
L=
, LQ =
M/M/1 Queues
5.0
6.0
7.2
8.64
10.0
0.500
0.600
0.720
0.864
1.000
1.00
1.50
2.57
6.35
0.20
0.25
0.36
0.73
For almost all queues, if lines are too long, they can be reduced
by decreasing server utilization () or by decreasing the service
time variability (2).
A measure of the variability of a distribution, coefficient of
variation (cv):
V (X )
(cv) 2 =
[E ( X )]2
The larger cv is, the more variable is the distribution relative to its
expected value
2 (1 + 2 2 )
2(1 )
2 1 + (cv) 2
=
1
2
LQ for M/M/1
queue
Multiserver Queue
c 1 ( / ) n c 1 c
P0 =
+
!
!
n
c
c
n = 0
L = c +
w=
(c ) c +1 P0
c(c!)(1 )
= c +
P ( L ( ) c )
1
Multiserver Queue
The time between the end of one service visit and the next call for
service is exponentially distributed, (mean = 1/).
Service times are also exponentially distributed.
c parallel servers and system capacity is K.
(
K
n
)!c!c n c
n = 0 n
n =c
K n
P0 ,
n
Pn =
K!
( K n)!c!c n c
L=
nP ,
n
n = 0,1,..., c 1
n
w = L / e ,
n = c, c + 1,...K
= e / c
n =0
where e is the long run effective arrival rate of customers to queue (or entering/e
B17xiting service)
e =
( K n) P
n =0
Slide 38
B17
typo
Brian; 2005/01/09
2
n
20
n =0 n 20 n = 2 (10 n)!2!2
= 0.065
L=
nP
= 3.17 machines
n =0
Networks of Queues
Networks of Queues
j = aj +
p
i
ij
all i
Arrival rate
from outside
the network
all i
Network of Queues
Summary