10 - times. 6 Notation A : Number of time units between...

Info iconThis preview shows pages 1–13. Sign up to view the full content.

View Full Document Right Arrow Icon
Chapter 10 Queuing Theory and Analysis
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 Queuing Theory and Analysis Queuing system Monte Carlo analysis of queuing Single-channel queuing models
Background image of page 2
3 Queuing system Arrivals Waiting line Server(s)
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 The Monte Carlo analysis A discrete-event simulation of the queue. Arrivals are randomly generated from a known distribution. Service times are also randomly generated from a known distribution. Can use software to analyze a made- up system.
Background image of page 4
5 Results from the analysis Idle time of the server(s), Average/maximum number of units waiting in line, Average/maximum waiting time, Minimum/average/maximum time in system, etc… Let us consider a single server system with Poisson arrivals and exponential service
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 12
Background image of page 13
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: times. 6 Notation A : Number of time units between arrivals S : Number of time units to complete a service of a single customer arrival rate service rate A 1 = S 1 = 7 Probability of n units in the system n - 1 8 Average number of units in the system -9 Average length of the queue ( 29 -2 10 Probability of a non-empty queue 2 11 Average length of the non-empty queue -12 Average waiting time in line ( 29 -13 Average time spent in the system -1...
View Full Document

Page1 / 13

10 - times. 6 Notation A : Number of time units between...

This preview shows document pages 1 - 13. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online