Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Waiting Lines
System
Processing Order
Calling
population Arrivals Waiting Service Exit
line
Structure of a Waiting Line System
• Single Service Channel System
S1
Customer Waiting line Customer
arrives S2 leaves
S3
Formulas
Single Server Multiple Server λ = arrival rate
𝜆 1
• 𝑃𝑤 = • 𝑃0 = 1 𝜆 𝑛 1 𝜆 𝑐 𝑐µ μ = service rate
µ σ𝑛 +
𝑛=0𝑛! µ 𝑐! µ 𝑐µ− 𝜆
• 𝑃0 = 1 − 𝑃𝑤 1 𝜆 𝑐 𝑐µ
c = number of channels
• 𝑃𝑤 = 𝑃
𝜆 𝑛 𝑐! µ 𝑐µ− 𝜆 0 n = a number | n for P0 in Multiple Server is n = c - 1
• 𝑃𝑛 = 𝑃0
µ 1 𝜆 𝑛
• 𝑃𝑛 = 𝑃0 , 𝑛 >𝑐 P0 = probability the service facility is idle
𝜆2 𝑐!𝑐 𝑛−𝑐 µ
• 𝐿𝑞 =
µ µ− 𝜆
• 𝑃𝑛 =
1 𝜆 𝑛
𝑃0 , 𝑛 ≤ 𝑐
Pn = probability of n units in the system
• 𝐿 = 𝐿𝑞 + 𝑃𝑤 𝑛 µ
Pw = probability an arriving unit must wait for service
𝜆 𝑐
𝐿𝑞 𝜆µ 𝜆
• 𝑊𝑞 = • 𝐿=
µ
𝑃0 + Lq = average number of units in the queue awaiting
𝜆 (𝑐−1! ) 𝑐µ− 𝜆 2 µ
• 𝑊 = 𝑊𝑞 +
1
𝜆 service
µ • 𝐿𝑞 = 𝐿 −
µ
L = average number of units in the system
Common Formulas 𝐿
• 𝑊= Wq = average time a unit spends in the queue awaiting
𝜆 𝜆
• 𝑢𝑡𝑖𝑙𝑖𝑧𝑎𝑡𝑖𝑜𝑛 = 𝜌 =
𝑐µ
• 𝑊𝑞 =
𝐿𝑞 service
𝜆
• 𝑖𝑑𝑙𝑒 = 1 − 𝜌 W = average time a unit spends in the system
Sample, single server system
• 𝑃𝑤 =
𝜆
• ABC Bank has • Arrival rate = 4/hr or 1/15 per min
µ
recently opened • Service rate = 5/hr or 1/12 per min
• 𝑃0 = 1 − 𝑃𝑤 and has found
𝜆 𝑛
4
• 𝑃𝑛 = 𝑃0 that about 4 • 𝑃𝑤 = = 80%
5
µ
clients come in
• 𝐿𝑞 =
𝜆2
every hour for • 𝑃0 = 1 − 0.8 = 20%
µ µ− 𝜆
over the counter 42
• 𝐿 = 𝐿𝑞 + 𝑃𝑤 transactions. • 𝐿𝑞 = = 3.2
5 5−4
• 𝑊𝑞 =
𝐿𝑞 The bank being • 𝐿 = 3.2 + 0.8 = 4
𝜆
relatively new
• 𝑊 = 𝑊𝑞 +
1 3,2
µ has only one • 𝑊𝑞 = = 0.8
teller and has a 4
Common Formulas 1
𝜆 transaction turn • 𝑊 = 0.8 + =1
• 𝑢𝑡𝑖𝑙𝑖𝑧𝑎𝑡𝑖𝑜𝑛 = 𝜌 = over time of 12 5
𝑐µ
• 𝑖𝑑𝑙𝑒 = 1 − 𝜌 minutes.
Sample, multiple server system
• 𝑃0 =
1 • Computing for P0, for 3 server using the same data in the previous problem
1 𝜆 𝑛 1 𝜆 𝑐 𝑐µ
σ𝑛
𝑛=0𝑛! µ +𝑐! µ 𝑐µ− 𝜆 • Arrival rate = 4/hr or 1/15 per min
1 𝜆 𝑐 𝑐µ • Service rate = 5/hr or 1/12 per min
• 𝑃𝑤 = 𝑃
𝑐! µ 𝑐µ− 𝜆 0
1
1 𝜆 𝑛 • 𝑃0 = = 0.447
• 𝑃𝑛 = 𝑃0 , 𝑛 >𝑐 σ2𝑛=0
1 4 2 1 4 1 1 4 0 1 4 3 3∙5
𝑐!𝑐 𝑛−𝑐 µ 2! 5
+1! 5 +0! 5 +3! 5 (3 ∙ 5)−4
1
1 𝜆 𝑛 • 𝑃0 = = 0.447
• 𝑃𝑛 = 𝑃0 , 𝑛 ≤𝑐 σ2𝑛=0(0.5∙0.64)+(1∙0.8)+(1∙1) +( 0.2∙0.512
15
)
𝑛 µ 15 −4
1
𝜆 𝑐 • 𝑃0 = = 0.447
𝜆µ µ 𝜆 σ2𝑛=0 0.32+0.8+1 +(0.9∙1.36)
• 𝐿= 𝑃0 + 1
(𝑐−1! ) 𝑐µ− 𝜆 2 µ • 𝑃0 = = 0.447
𝜆 2.12+0.12
• 𝐿𝑞 = 𝐿 − 1
µ • 𝑃0 = = 0.447
2.12+0.12
𝐿 1
• 𝑊= • 𝑃0 = = 0.447
𝜆 2.24
𝐿𝑞
• 𝑊𝑞 = • For P0, the summation is based on the value of n, starts with n which is n = c-1 and
𝜆
until the value of n reaches the value of 0.
• E.g. C = 5, so it would summation for 4!, 3!, 2!, 1!, 0!
Simulation of Waiting Lines
• Interarrival time • Simulation would include the
• IAT = a + r (b – a)
• a = minimum interarrival time following
• b = maximum interarrival time
• r = random number between 0 and 1
• Service Time
• Interarrival Time
• Compute for the “x” value in normal • Arrival Time
distribution or the inverse of normal
distribution • Service Start Time
• Random Number (Area under the normal
curve, and determine z score) • Waiting Time
• Mean and Standard Deviation must be known • Service Time
• X = (zσ) + μ
• Computation of service time is usually with • Completion Time
the aid of software but can also be done
manually with the normal curve • Time in System
Simulation of Waiting Lines Table
Client IAT AT SST WT ST CT SysTi