Escolar Documentos
Profissional Documentos
Cultura Documentos
=
n
qi
i
q
n
W
W
n
1
lim
=
=
n
i
i
n
W
W
n
Steady state average
delay in the queue
Steady state average
waiting time in the system
7/16/2014 Basics of Queueing Theory 14
M/M/c Queuing Formulae
( )
( )
( )
( )
( )
( )
( )
( )
( )
1
1
1
1
0
1
1
1
0
1
1
1 0
1
2
2
2
1
1
0
+
q
c
q
q
c
q
c
n
n c
w W
c c
p c
W
L L
c
p c
L
n
c
c
c
p
c M M M M
!
) (
!
) (
! !
) (
/ / / /
Askin, R. G. and C. R. Standridge,
Modeling and Analysis of
Manufacturing Systems, John Wiley &
Sons, New York, NY, 1993.
Queueing Networks
Consist of nodes, each of which is a G/G/c station, connected by
arcs representing possible entity travel between nodes
Can also have entity arrivals from outside the network, and entities can
exit from any node to outside the system
When an entity leaves a node, it can go out on any of the arcs
emanating from that node, with arc probabilities summing to 1
Assume:
All arrival processes from outside have
exponential interarrival times (a.k.a.
Poisson processes), and are independent
of each other
All service times are independent
exponential (so each node is an M/M/c)
All queue capacities are infinite
Utilization (a.k.a. traffic intensity)
locally at each node is < 1
Chapter 2 Basics of Queueing Theory 16
Called a Jackson network
with these assumptions;
much is known about it
Queueing Networks
7/16/2014 Basics of Queueing Theory 17
Kelton et al., 2011, p. 21
Queueing Networks (cont.)
Use all of this to analyze each node in a Jackson network as a
stand-alone M/M/c queue, using formulae given earlier
Just have to compute Poisson arrival input/output rates using
decomposition, superposition of Poisson processes
Let
SignIn
be the (Poisson) arrival rate into the Sign In station, assume
exponential service times throughout:
Chapter 2 Basics of Queueing Theory 18
Analyze each node independently as:
Sign In: M/M/2, arrival rate
SignIn
Registration: M/M/1, arrival rate 0.9
SignIn
Trauma Rooms: M/M/2, arrival rate 0.1
SignIn
Exam Rooms: M/M/4, arrival rate 0.9
SignIn
Treatment Rooms: M/M/2, arrival rate
(0.9)(0.6)
SignIn
+ 0.1
SignIn
= 0.64
SignIn
Queueing Network Example
7/16/2014 Basics of Queueing Theory 19
B
= 20/hr
ST
A
~ expo(1.875) min
A
C
ST
B
~ expo(4.0) min
ST
C
~ expo(6.667) min
60%
40%
Queueing Theory vs. Simulation
Queueing-theoretic results have the advantage of being exact,
i.e., no statistical uncertainty/variation
Simulation results have statistical uncertainty/variation, which needs to
be acknowledged and appropriately addressed
But queueing theory has its own shortcomings:
Strong assumptions that may be unrealistic, like exponential service
times (mode = 0?), making model validity questionable
Nearly always only for steady-state long-run behavior, so dont address
what happens in the short run
Not available for all inter-arrival/service distributions, or (more
importantly) for complex systems (Jackson network is simple, restrictive)
Despite output uncertainty, simulation has major advantages:
No restrictions on input distributions, model form, or complexity so
model validity is facilitated
Can address short-term time frames in fact, steady-state is harder for
simulation (long runs, initialization bias) than for queueing theory
Just have to be mindful of proper statistical design/analysis
Chapter 2 Basics of Queueing Theory 20