Professional Documents
Culture Documents
Chapter 5b Service Design
Chapter 5b Service Design
Designing Services
5-1
Lecture Outline
• Service Economy
• Characteristics of Services
• Service Design Process
• Tools for Service Design
• Waiting Line Analysis for Service Improvement
Source: Adapted from Earl W. Sasser, R.P. Olsen, and D. Daryl Wyckoff, Management of
Service Operations (Boston: Allyn Bacon, 1978), p.11.
• Service concept
– purpose of a service; it defines target market and
customer experience
• Service package
– mixture of physical items, sensual benefits, and
psychological benefits
• Service specifications
– performance specifications
– design specifications
– delivery specifications
• Operating characteristics
• average values for characteristics that describe
performance of waiting line system
• Queue
• a single waiting line
• Waiting line system
• consists of arrivals, servers, and waiting line structure
• Calling population
• source of customers; infinite or finite
• Waiting rooms
• magazines and
newspapers
• televisions
• Bank of America
• mirrors
• Supermarkets
• magazines
• “impulse purchases”
5-24
Copyright 2011 John Wiley & Sons, Inc.
Psychology of Waiting
• Preferential treatment
• Grocery stores: express lanes for customers with few
purchases
• Airlines/Car rental agencies: special cards available
to frequent-users or for an additional fee
• Phone retailers: route calls to more or less
experienced salespeople based on customer’s sales
history
• Critical service providers
• services of police department, fire department, etc.
• waiting is unacceptable; cost is not important
• Single-server model
• simplest, most basic waiting line structure
• Frequent variations (all with Poisson arrival rate)
• exponential service times
• general (unknown) distribution of service times
• constant service times
• exponential service times with finite queue
• exponential service times with finite calling population
• Assumptions • Computations
• Poisson arrival rate • λ = mean arrival rate
• exponential service • μ = mean service rate
times • n = number of
• first-come, first-served customers in line
queue discipline
• infinite queue length
• infinite calling
population
5-27
Copyright 2011 John Wiley & Sons, Inc.
Basic Single-Server Model
• probability that no customers • average number of customers
are in queuing system in queuing system
P0 = ( )
1–
λ
μ
L=
λ
μ–λ
λ n λ n λ λ2
Pn =
( ) ( )( )
μ
∙ P0 =
μ
1–
μ
Lq =
μ (μ – λ)
5-28
Copyright 2011 John Wiley & Sons, Inc.
Basic Single-Server Model
λ I=1– ρ
Wq =
μ (μ – λ) λ
=1– = P0
μ
5-29
Copyright 2011 John Wiley & Sons, Inc.
Basic Single-Server Model Example
l = 24
m = 30
D4/(D5-D4)
(1/(D5-D4))*60
(D4/D5)*(D5-D4)*60
Probability of zero
customers
1 λ n
n! μ
–
{s μ
()
P0, for n ≤ s
5-38
Copyright 2011 John Wiley & Sons, Inc.
Basic Multiple-Server Model
λμ (λ/μ)s λ
L= P0 + 1 Lq
(s – 1)! (sμ – λ)2 μ Wq = W – =
μ λ
L λ
W= ρ=
λ sμ
• Three-server system