Documente Academic
Documente Profesional
Documente Cultură
Queuing Models
25 Years Ago
Frontier Mail
Paschim Express
Dehradun Exp
Indian Railways
Specific Service Counters Idle Server at some counter, Longer Queue at some counter
Any Train Booking at All Booking Counters Shorter Queue and Less Idle Servers
Premier
Third Party
Power Advantage
Segregation of Service and Service Priority HongKong Bank (HSBC) Nationalized Banks Security is a Warm Feeling Service is a .. Feeling
Receipts and Payments At different counters. Idle time is more Longer queues
Customer
Counter (server)
Chitle Bandhu,
Sadashiv Peth, Pune
Cashier
Enter
Every customer gets a numbered token. Customer spends. Less time at each counter. Purchases are updated at counter. Waiting Time at cashier reduced
Exit
Processing Order
Arrivals
Waiting Line
Service
Exit
Calling Population
Calling Population
Infinite or unlimited Probability of arrival is not significantly influenced by the fact that some customers are waiting Open to general public (theatres, banks, post offices, restaurants, etc..) Finite or limited Systems have limited access for service Limited no of machines, limited no of trucks
Customer Arrivals
Discrete people arriving, trucks arriving, telephone calls Arrivals in single units or batches (bus load of passengers arriving at fast food joints, Theatre or cinema hall patrons) Distribution of arrivals follow the Poisson Distribution (ex : 4 cars per hour) The average time in between arrivals follows the negative exponential distribution. Ex Time between arrivals is 15 mins
Exit
Exit
Exit Payment of College Fees
Exit Exit
Exit
Multiple Channel/Server, Multiple Line, Single Phase Exit
Exit
Exit
Exit
Exit Exit Multiple Channel/Server, Multiple Line, Multiple Phase
Exit
Exit
Exit
Types of Customers
Arriving customers may refuse to enter the system as there is a long waiting line Customers may arrive, wait for some time, and leave without being served Customers may switch lines in order to reduce the waiting time
Balking
Reneging
Jockeying
Service
Number of servers Number of steps or phases Distribution of processing or service time Single or multiple Single phase or multiple phase Negative exponential distribution Most customers require short service time, while a few require more service time
P(t<=4) = 1- e- (0.5)(4) = 0.86466 P(t>=6) = e- (0.5)(6) = 0.049787 P(4<=t<=6) = e- (0.5(4) - e- (0.5(6) = 0.1353-0.0497 = 0.0855 U = 1/ = 1/0.5 = 2 mins S = u = 2 mins U = 1/ = 1/0.67 = 1.5 mins S = u = 1.5 mins P(t<=1) = 1- e- (0.67)(1) = 0.486 P(t>=2) = e- (0.67)(2) = 0.2636 P(1<=t<=2) = e- (0.67(1) - e- (0.67(2) =0.5134 0.2636 = 0.2498
Average Number Waiting and Average Waiting and Service Time -------------System -----------
In the System
Lq
/u
L = Lq + /u
Average Time
Wq = Lq/u 1/u
W = Wq + 1/u
Lq
L
The average number waiting for service The average number in the system (waiting for service or being served)
P0
p Wq
Wf
M
The average time customers spend in the system (waiting for service and service time)
The expected maximum number waiting for service for a given level of confidence
Wq = Weighted Average of waiting time of Actual Waiting and Non waiting Wa = Average Waiting Time Proportion of Customers Waiting = (/u) Proportion of Customers who do not wait = (1 - /u)
Notation
p Lq L
Formulae
/u 2/u(u- ) Lq + /u Lq / = /(u(-u) = (/u)Wa Wq + 1/u (1 - /u) P0(/u)n 1-(/u)k+1 Wq / (/u) = 1/(u- )
Average time in Line Average time in System Probability of Zero units in System Probability of n units in System Probability that waiting line wont exceed k units Average waiting time for an arrival not served immediately
Wq W P0 Pn Pn<=k Wa
M/M/1 Problem
At a ticket counter, mean arrival rate of customers = 3 per minute. Mean service rate is 4 customers per minute. Calculate all the performance measures. Consider n = 2 customers in the system and k = maximum length of the queue = 5
Notation p Lq L
Wq
W P0 Pn Pn<=k Wa
Probability that waiting line wont exceed k units Average waiting time for an arrival not served immediately
No Priority
New arrivals
Priority 1
Priority 2 Priority 3 Multiple Server, Priority Servicing Model
Psychology of Waiting
Perception of waiting of the customer Magazines provided at doctors or dentist waiting rooms Music, in-flight movies Fill up forms Mirrors near lifts Impulse purchases at supermarkets Additional spending
Notation
p
Formulae
/su
Lq
L Wq W P0
u(/u)sP0/((s-1)!(su- )2)
Lq + /u Lq / = /(u(-u) = (/u)Wa Wq + 1/u 1/((/u)n/n!) + (/u)s/(s!(1-(/su)) from n = 0 to s-1 P0(/u)n/(n!) for n<= s P0(/u)n/(s!sn-s) for n> s (/u)s P0/ (s!(1- /su))
Pn
Probability that an arrival will have to wait for service Average waiting time for an arrival not served immediately
Pw
Wa
1/(su- )
/u
Lq
P0
0.25
0.50
1
2 1
0.083
0.004 0.5
0.750
0.778 0.5
2
3 0.75 1
0.033
0.003 2.25
0.6
0.606 0.25
2
3 1.0 2
0.123
0.015 0.333
0.455
0.471 0.333
3
4
0.045
0.007
0.364
0.367
Problem
Determine the maximum number of customers waiting in line for probabilities of both 95% and 99%. s = 1, = 4 per hour, u = 5 per hour p = /su = 4/(1)(5) = 0.80 For /u = 0.80, s = 1, Lq = 3.2 For 95%, K = (1-0.95)/3.2(1-0.80) = 0.078 n = log 0.078/log0.80 = 11.43 or 12 For 99%, K = (1-0.99)/3.2(1-0.80) = 0.0156 n = log 0.0156/log0.80 = 18.64 or 19
During noon hour at a bank, the arroval rate is 8 customers per minute, and the service rate is 2 customers per minute. Thus /u = 8/2 = 4. How many servers would be required so that the line does not exceed 4 waiting Customers? 6 servers at 95%, 7 servers at 99%
p = /su
n95
10 4 1 0
n99
17 8 4
Cost Considerations
Minimize Total Cost = Customer Waiting Cost + Capacity (Service) Cost Iterative procedure : Increase Capacity (or channels) by one. And compute the total cost. Total cost will initially decrease with increase in number of channels and then increase.
Trucks arrive at a warehouse at a rate of 15 per hour during business hours Crew can unload at a rate of 5 per hour. Crew wage rates have increased and Crew size is to be determined. Crew cost is Rs 100/hour, while driver cost is Rs 120 per hour. Thus /u = 15/5 = 3. Values of Lq are as per calculations for given s and /u
Avg No in System L = Lq + /u
1.528 + 3 = 4.528 0.354 + 3 = 3.354 0.099 + 3 = 3.099 0.028 + 3 = 3.028
Rs 400
4.528 x 120 = Rs 543.26 3.354 x 120 = Rs 402.58 3.099 x 120 = Rs 371.88 3.028 x 120 = Rs 363.36
Rs 500
Rs 600
Rs 700
Rs 1063.36
Performance Measure System Utilization Average number waiting in line Average number in System Average time waiting in line Average time in the system
p Lq L
Formula
/su (where s = 1) ((/u)2 + 2v )/2(1-/u) where v = variance Lq + /u Lq / Wq + 1/u
Wq W
Performance Measure System Utilization Average number waiting in line Average number in System Average time waiting in line Average time in the system
p Lq
Formula
/su (where s = 1) = 0.25/0.50 = 0.50 ((/u)2 + 2v )/2(1-/u) where v = variance = (0.25/0.50)2 + 0,252(0.81)/2(1-(0.25/0.5)) = 0.301 customers Lq + /u = 0.301 + 0.5 = 0.801 customers Lq / = 0.301/0.25 = 1.203 min Wq + 1/u = 1.203 + 1/0.5 = 3.203 min
Wq W
Performance Measure
Formula
p
Lq L
System Utilization
Average number waiting in line Average number in System Average time waiting in line Average time in the system
/su (where s = 1)
(/u)2/2(1-/u) = ()2/2u(u-) Lq + /u Lq / Wq + 1/u
Wq W
Performance Measure
Formula
p
Lq L
System Utilization
Average number waiting in line Average number in System Average time waiting in line Average time in the system
Wq W
Notation p Lq
L
Formulae /u L (1-P0)
(/u)/(1- /u) (m+1)(/u)m+1/(1- (/u)m+1)
W
Wq P0 Pn
Lq /((1-Pm)) + 1/u
W - 1/u (1 - /u)/(1-(/u)m+1)where m = max length of queue P0(/u)n
Notation
p Lq L
Formulae
/u = 9/15 = 0.60 L (1-P0) = 1.206 (1-0.420) = 0.63 (/u)/(1- /u) (m+1)(/u)m+1/(1- (/u)m+1) = 0.6/(1-0.6) (5+1)(0.6)5+1)/(1-0.65+1) = 1.206 Lq /((1-Pm)) + 1/u = 0.63/(9(1 0.033)) + 1/15 = 0.139 hr W - 1/u = 0.139 1/15 = 0. 072 hour (1 - /u)/(1-(/u)m+1) = (1-0.6)/(1-0.65+1) = 0.420
Wq P0
Pn
m