©The McGraw-Hill Companies, Inc., 2004
1
Technical Note 6
Waiting Line Management
©The McGraw-Hill Companies, Inc., 2004
2
• Waiting Line Characteristics
• Suggestions for Managing Queues
• Examples (Models 1, 2, 3, and 4)
OBJECTIVES
©The McGraw-Hill Companies, Inc., 2004
3
• Waiting is a fact of life
• Americans wait up to 30 minutes daily or about 37 billion hours in line yearly
• US leisure time has shrunk by more than 35% since 1973
• An average part spends more than 95% of its time waiting
• Waiting is bad for business and occurs in every arrival
Waiting Line Characteristics
©The McGraw-Hill Companies, Inc., 2004
4
Components of the Queuing System
CustomerArrivals
Servers
Waiting Line
Servicing System
Exit
Queue or
©The McGraw-Hill Companies, Inc., 2004
5
Customer Service Population Sources
Population Source
Finite Infinite
Example: Number of machines needing repair when a company only has three machines.
Example: Number of machines needing repair when a company only has three machines.
Example: The number of people who could wait in a line for gasoline.
Example: The number of people who could wait in a line for gasoline.
©The McGraw-Hill Companies, Inc., 2004
6
Service Pattern
ServicePattern
Constant Variable
Example: Items coming down an automated assembly line.
Example: Items coming down an automated assembly line.
Example: People spending time shopping.
Example: People spending time shopping.
©The McGraw-Hill Companies, Inc., 2004
7
The Queuing System
Queue Discipline
Length
Number of Lines &Line Structures
Service Time Distribution
Queuing System
©The McGraw-Hill Companies, Inc., 2004
8
Single-channel, single-phase
Single-channel, multiple-phase
Server
Servers
Waiting line
Waiting line
Basic Waiting Line Structures
©The McGraw-Hill Companies, Inc., 2004
9
Multiple-channel, single-phase
Multiple-channel, multiple-phaseServers
Servers
Waiting line
Waiting line
Basic Waiting Line Structures
©The McGraw-Hill Companies, Inc., 2004
10
Examples of Line Structures
Single Channel
Multichannel
SinglePhase Multiphase
One-personbarber shop
Car wash
Hospitaladmissions
Bank tellers’windows
©The McGraw-Hill Companies, Inc., 2004
11
Degree of Patience
No Way!
BALK
No Way!
RENEGE
Other Human Behavior• Server speeds up• Customer jockeys
©The McGraw-Hill Companies, Inc., 2004
12
Suggestions for Managing Queues
1. Determine an acceptable waiting time for your customers
2. Try to divert your customer’s attention when waiting
3. Inform your customers of what to expect
4. Keep employees not serving the customers out of sight
5. Segment customers
©The McGraw-Hill Companies, Inc., 2004
13
Suggestions for Managing Queues (Continued)
6. Train your servers to be friendly
7. Encourage customers to come during the slack periods
8. Take a long-term perspective toward getting rid of the queues
©The McGraw-Hill Companies, Inc., 2004
14
The General Waiting Framework
• Arrival process could be random, if so:– We assume Poisson arrival = Average rate of arrival– 1/ = Arrival time
• Service process could be random or constant– If random
• We assume Exponential = Average rate of service• 1/ = Service time
– If constant, service time is same for all
• Service intensity =/<1
©The McGraw-Hill Companies, Inc., 2004
15
Notation for Waiting Line Models
• (a/b/c):(d/e/f)
• Example: (M/M/1):(FCFS//)
a = Customer arrivals distribution (M, D, G)
b = Customer service time distribution (M, D, G)
c = Number of servers (1, 2, . . ., )
d = Service discipline (FCFS, SIRO)
e = Capacity of the system (N, )
f = Size of the calling source (N, )
©The McGraw-Hill Companies, Inc., 2004
16
Waiting Line Models
Model LayoutSourcePopulation Service Pattern
1 Single channel Infinite Exponential
2 Single channel Infinite Constant
3 Multichannel Infinite Exponential
4 Single or Multi Finite Exponential
These four models share the following characteristics:
• Single phase• Poisson arrival• FCFS• Unlimited queue length
©The McGraw-Hill Companies, Inc., 2004
17
Notation: Infinite Queuing: Models 1-3
linein tingnumber wai Average
server single afor
rate sevice torate arrival totalof Ratio = =
arrivalsbetween timeAverage
timeservice Average
rate Service =
rate Arrival =
1
1
Lq
linein tingnumber wai Average
server single afor
rate sevice torate arrival totalof Ratio = =
arrivalsbetween timeAverage
timeservice Average
rate Service =
rate Arrival =
1
1
Lq
©The McGraw-Hill Companies, Inc., 2004
18
Infinite Queuing Models 1-3 (Continued)
linein waitingofy Probabilit
systemin units exactly ofy Probabilit
channels service identical ofNumber =
system in the units ofNumber
served) be to time(including
systemin time totalAverage
linein waiting timeAverage =
served) being those(including
systemin number Average = s
Pw
nPn
S
n
Ws
Wq
L
linein waitingofy Probabilit
systemin units exactly ofy Probabilit
channels service identical ofNumber =
system in the units ofNumber
served) be to time(including
systemin time totalAverage
linein waiting timeAverage =
served) being those(including
systemin number Average = s
Pw
nPn
S
n
Ws
Wq
L
©The McGraw-Hill Companies, Inc., 2004
19
Example: Model 1
Assume a drive-up window at a fast food restaurant.Customers arrive at the rate of 25 per hour. The employee can serve one customer every 2 minutes.Assume Poisson arrival and exponential service rates.
Determine:
A) What is the average utilization of the employee?
B) What is the average number of customers in line?
C) What is the average number of customers in the system?
D) What is the average waiting time in line?
E) What is the average waiting time in the system?
F) What is the probability that exactly two cars will be
in the system?
Determine:
A) What is the average utilization of the employee?
B) What is the average number of customers in line?
C) What is the average number of customers in the system?
D) What is the average waiting time in line?
E) What is the average waiting time in the system?
F) What is the probability that exactly two cars will be
in the system?
©The McGraw-Hill Companies, Inc., 2004
20
= 25 cust / hr
= 1 customer
2 mins (1hr / 60 mins) = 30 cust / hr
= = 25 cust / hr
30 cust / hr = .8333
= 25 cust / hr
= 1 customer
2 mins (1hr / 60 mins) = 30 cust / hr
= = 25 cust / hr
30 cust / hr = .8333
Example: Model 1
A) What is the average utilization of the employee?
©The McGraw-Hill Companies, Inc., 2004
21
Example: Model 1
B) What is the average number of customers in line?
4.167 = 25)-30(30
(25) =
) - ( =
22
Lq 4.167 = 25)-30(30
(25) =
) - ( =
22
Lq
C) What is the average number of customers in the system?
5 = 25)-(30
25 =
- =
Ls 5 = 25)-(30
25 =
- =
Ls
©The McGraw-Hill Companies, Inc., 2004
22
Example: Model 1
D) What is the average waiting time in line?
mins 10 = hrs .1667 =
=
LqWq mins 10 = hrs .1667 =
=
LqWq
E) What is the average waiting time in the system?
mins 12 = hrs .2 = =Ls
Ws mins 12 = hrs .2 = =Ls
Ws
©The McGraw-Hill Companies, Inc., 2004
23
Example: Model 1
F) What is the probability that exactly two cars will be in the system (one being served and the other waiting in line)?
p = (1-n
n
)( )p = (1-
n
n
)( )
p = (1- = 2
225
30
25
30)( ) .1157p = (1- =
2
225
30
25
30)( ) .1157
nnP 1
©The McGraw-Hill Companies, Inc., 2004
24
Example: Model 2
An automated pizza vending machine heats and dispenses a slice of pizza in 4 minutes.
Customers arrive at a rate of one every 6 minutes with the arrival rate exhibiting a Poisson distribution.
Determine:
A) The average number of customers in line.
B) The average total waiting time in the system.
Determine:
A) The average number of customers in line.
B) The average total waiting time in the system.
©The McGraw-Hill Companies, Inc., 2004
25
Example: Model 2
A) The average number of customers in line.
.6667 = 10)-(2)(15)(15
(10) =
) - (2 =
22
Lq .6667 = 10)-(2)(15)(15
(10) =
) - (2 =
22
Lq
B) The average total waiting time in the system.
mins 4 = hrs .06667 = 10)-51)(15(2
10 =
) - (2 =
Wq mins 4 = hrs .06667 = 10)-51)(15(2
10 =
) - (2 =
Wq
mins 8 = hrs .1333 = 15/hr
1 + hrs .06667 =
1 + =
WqWs mins 8 = hrs .1333 = 15/hr
1 + hrs .06667 =
1 + =
WqWs
©The McGraw-Hill Companies, Inc., 2004
26
Determining s and for Given SL
• In a Model 1 car wash facility =10 and =12. Find the number of parking spaces needed to guarantee a service level of 98%. (Let s=number in the system). Then:
©The McGraw-Hill Companies, Inc., 2004
27
Example: Model 3
Recall the Model 1 example:Drive-up window at a fast food restaurant.Customers arrive at the rate of 25 per hour.The employee can serve one customer every two minutes.Assume Poisson arrival and exponential service rates.
If an identical window (and an identically trained server) were added, what would the effects be on the average number of cars in the system and the total time customers wait before being served?
If an identical window (and an identically trained server) were added, what would the effects be on the average number of cars in the system and the total time customers wait before being served?
©The McGraw-Hill Companies, Inc., 2004
28
Example: Model 3
Average number of cars in the system
ion)interpolatlinear -using-TN6.10(Exhibit
1760= .Lqion)interpolatlinear -using-TN6.10(Exhibit
1760= .Lq
1.009 = 30
25 + .176 = + =
LqLs 1.009 = 30
25 + .176 = + =
LqLs
Total time customers wait before being served
)( = mincustomers/ 25
customers .176 = = Wait! No
LqWq mins .007
)( =
mincustomers/ 25
customers .176 = = Wait! No
LqWq mins .007
©The McGraw-Hill Companies, Inc., 2004
29
Notation: Finite Queuing: Model 4
channels service ofNumber
linein units ofnumber Average
)( system
queuingin thoseless source Population =
served being units ofnumber Average
linein wait tohaving
ofeffect theof measure a factor, Efficiency
linein must wait arrivalan y that Probabilit =
S
L
n-N
J
H
F
D
channels service ofNumber
linein units ofnumber Average
)( system
queuingin thoseless source Population =
served being units ofnumber Average
linein wait tohaving
ofeffect theof measure a factor, Efficiency
linein must wait arrivalan y that Probabilit =
S
L
n-N
J
H
F
D
©The McGraw-Hill Companies, Inc., 2004
30
Finite Queuing: Model 4 (Continued)
required timeservice of proportionor factor, Service
linein time waitingAverage
tsrequiremen servicecustomer between timeAverage
service theperform to timeAverage =
system queuingin units exactly ofy Probabilit
source populationin units ofNumber
served) being one the(including
system queuingin units ofnumber Average =
X
W
U
T
nPn
N
n
required timeservice of proportionor factor, Service
linein time waitingAverage
tsrequiremen servicecustomer between timeAverage
service theperform to timeAverage =
system queuingin units exactly ofy Probabilit
source populationin units ofNumber
served) being one the(including
system queuingin units ofnumber Average =
X
W
U
T
nPn
N
n
©The McGraw-Hill Companies, Inc., 2004
31
Example: Model 4
The copy center of an electronics firm has four copymachines that are all serviced by a single technician.
Every two hours, on average, the machines require adjustment. The technician spends an average of 10minutes per machine when adjustment is required.
Assuming Poisson arrivals and exponential service, how many machines are “down” (on average)?
The copy center of an electronics firm has four copymachines that are all serviced by a single technician.
Every two hours, on average, the machines require adjustment. The technician spends an average of 10minutes per machine when adjustment is required.
Assuming Poisson arrivals and exponential service, how many machines are “down” (on average)?
©The McGraw-Hill Companies, Inc., 2004
32
Example: Model 4
N, the number of machines in the population = 4M, the number of repair people = 1T, the time required to service a machine = 10 minutesU, the average time between service = 2 hours
X =T
T + U
10 min
10 min + 120 min= .077X =
T
T + U
10 min
10 min + 120 min= .077
From Table TN6.11, F = .980 (Interpolation)From Table TN6.11, F = .980 (Interpolation)
L, the number of machines waiting to be serviced = N(1-F) = 4(1-.980) = .08 machines
L, the number of machines waiting to be serviced = N(1-F) = 4(1-.980) = .08 machines
H, the number of machines being serviced = FNX = .980(4)(.077) = .302 machines
H, the number of machines being serviced = FNX = .980(4)(.077) = .302 machines
Number of machines down = L + H = .382 machinesNumber of machines down = L + H = .382 machines
©The McGraw-Hill Companies, Inc., 2004
33
Queuing Approximation• This approximation is a quick way to analyze a queuing situation. Now, both
interarrival time and service time distributions are allowed to be general.
• In general, average performance measures (waiting time in queue, number in queue, etc) can be very well approximated by mean and variance of the distribution (distribution shape not very important).
• This is very good news for managers: all you need is mean and standard deviation, to compute average waiting time
222
Define:
Standard deviation of Xcoefficient of variation for r.v. X =
Mean of XVariance
squared coefficient of variation (scv) = mean
x
x x
C
C C
©The McGraw-Hill Companies, Inc., 2004
34
Queue Approximation
2( 1) 2 2
1 2
Sa s
q
C CL
s qL L S
Compute S
2 2,a sC CInputs: S, , ,
(Alternatively: S, , , variances of interarrival and service time distributions)
as before, , and q sq s
L LW W
©The McGraw-Hill Companies, Inc., 2004
35
Approximation Example
• Consider a manufacturing process (for example making plastic parts) consisting of a single stage with five machines. Processing times have a mean of 5.4 days and standard deviation of 4 days. The firm operates make-to-order. Management has collected date on customer orders, and verified that the time between orders has a mean of 1.2 days and variance of 0.72 days. What is the average time that an order waits before being worked on?
Using our “Waiting Line Approximation” spreadsheet we get:
Lq = 3.154 Expected number of orders waiting to becompleted.
Wq = 3.78 Expected number of days order waits.
Ρ = 0.9 Expected machine utilization.