Download presentation
Presentation is loading. Please wait.
Published byFiona Foulk Modified over 10 years ago
1
Copyright 2009 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Service Design Operations Management - 6 th Edition Chapter 5 Roberta Russell & Bernard W. Taylor, III
2
Copyright 2009 John Wiley & Sons, Inc.5-2 Lecture Outline Service Economy Characteristics of Services Service Design Process Tools for Service Design Waiting Line Analysis for Service Improvement
3
Copyright 2009 John Wiley & Sons, Inc.5-3 Service Economy Source: U.S. Bureau of Labor Statistics, IBM Almaden Research Center
4
Copyright 2009 John Wiley & Sons, Inc.5-4 Characteristics of Services Services acts, deeds, or performances acts, deeds, or performances Goods tangible objects tangible objects Facilitating services accompany almost all purchases of goods accompany almost all purchases of goods Facilitating goods accompany almost all service purchases accompany almost all service purchases
5
Copyright 2009 John Wiley & Sons, Inc.5-5 Continuum from Goods to Services Source: Adapted from Earl W. Sasser, R.P. Olsen, and D. Daryl Wyckoff, Management of Service Operations (Boston: Allyn Bacon, 1978), p.11.
6
Copyright 2009 John Wiley & Sons, Inc.5-6 Characteristics of Services (cont.) Services are intangible Service output is variable Services have higher customer contact Services are perishable Service inseparable from delivery Services tend to be decentralized and dispersed Services are consumed more often than products Services can be easily emulated
7
Copyright 2009 John Wiley & Sons, Inc.5-7 Service Design Process
8
Copyright 2009 John Wiley & Sons, Inc.5-8 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 Service Design Process (cont.)
9
Copyright 2009 John Wiley & Sons, Inc.5-9 Service Process Matrix
10
Copyright 2009 John Wiley & Sons, Inc.5-10 Elements of Waiting Line Analysis Operating characteristics average values for characteristics that describe performance of waiting line system average values for characteristics that describe performance of waiting line system Queue a single waiting line a single waiting line Waiting line system consists of arrivals, servers, and waiting line structure consists of arrivals, servers, and waiting line structure Calling population source of customers; infinite or finite source of customers; infinite or finite
11
Copyright 2009 John Wiley & Sons, Inc.5-11
12
Copyright 2009 John Wiley & Sons, Inc.5-12 Elements of Waiting Line Analysis (cont.) Arrival rate (λ) frequency at which customers arrive at a waiting line according to a probability distribution, usually Poisson frequency at which customers arrive at a waiting line according to a probability distribution, usually Poisson Service time (μ) time required to serve a customer, usually described by negative exponential distribution time required to serve a customer, usually described by negative exponential distribution Service rate must be shorter than arrival rate (λ < μ) Queue discipline order in which customers are served order in which customers are served Infinite queue can be of any length; length of a finite queue is limited can be of any length; length of a finite queue is limited
13
Copyright 2009 John Wiley & Sons, Inc.5-13 Elements of Waiting Line Analysis (cont.) Channels number of parallel servers for servicing customers number of parallel servers for servicing customers Phases number of servers in sequence a customer must go through number of servers in sequence a customer must go through
14
Copyright 2006 John Wiley & Sons, Inc.17-14 Single-Channel Structures Single-channel, single-phase Waiting lineServer Single-channel, multiple phases Servers Waiting line
15
Copyright 2006 John Wiley & Sons, Inc.17-15 Multi-Channel Structures Servers Multiple-channel, single phase Waiting line Servers Multiple-channel, multiple-phase
16
Copyright 2009 John Wiley & Sons, Inc.5-16 Operating Characteristics Operating characteristics are assumed to approach a steady state
17
Copyright 2009 John Wiley & Sons, Inc.5-17 Traditional Cost Relationships as service improves, cost increases
18
Copyright 2009 John Wiley & Sons, Inc.5-18 Psychology of Waiting Waiting rooms magazines and newspapers magazines and newspapers televisions televisions Bank of America mirrors mirrors Supermarkets magazines magazines “impulse purchases” “impulse purchases” Disney costumed characters costumed characters mobile vendors mobile vendors accurate wait times accurate wait times special passes special passes
19
Copyright 2009 John Wiley & Sons, Inc.5-19 Psychology of Waiting (cont.) Preferential treatment Grocery stores: express lanes for customers with few purchases Grocery stores: express lanes for customers with few purchases Airlines/Car rental agencies: special cards available to frequent-users or for an additional fee 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 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. services of police department, fire department, etc. waiting is unacceptable; cost is not important waiting is unacceptable; cost is not important
20
Copyright 2009 John Wiley & Sons, Inc.5-20 Waiting Line Models Single-server model simplest, most basic waiting line structure simplest, most basic waiting line structure Frequent variations (all with Poisson arrival rate) exponential service times exponential service times general (unknown) distribution of service times general (unknown) distribution of service times constant service times constant service times exponential service times with finite queue exponential service times with finite queue exponential service times with finite calling population exponential service times with finite calling population
21
Copyright 2009 John Wiley & Sons, Inc.5-21 Basic Single-Server Model Assumptions Poisson arrival rate Poisson arrival rate exponential service times exponential service times first-come, first- served queue discipline first-come, first- served queue discipline infinite queue length infinite queue length infinite calling population infinite calling population Computations λ = mean arrival rate λ = mean arrival rate μ = mean service rate μ = mean service rate n = number of customers in line n = number of customers in line
22
Copyright 2009 John Wiley & Sons, Inc.5-22 Basic Single-Server Model (cont.) probability that no customers are in queuing system probability of n customers in queuing system average number of customers in queuing system average number of customers in waiting line ( ) P 0 = 1 – λμ ( ) ( )( ) P n = ∙ P 0 = 1 – λ n λ n λ μ μ μ L =L =L =L = λ μ – λ Lq =Lq =Lq =Lq = λ 2 λ 2 μ (μ – λ)
23
Copyright 2009 John Wiley & Sons, Inc.5-23 Basic Single-Server Model (cont.) average time customer spends in queuing system average time customer spends waiting in line probability that server is busy and a customer has to wait (utilization factor) probability that server is idle and customer can be served 1 L 1 L μ – λ λ W = = λ μ (μ – λ) Wq =Wq =Wq =Wq = λμ ρ =ρ =ρ =ρ = I = 1 – ρ = 1 – = P 0 = 1 – = P 0λμ
24
Copyright 2009 John Wiley & Sons, Inc.5-24 Basic Single-Server Model Example
25
Copyright 2009 John Wiley & Sons, Inc.5-25 Basic Single-Server Model Example (cont.)
26
Copyright 2009 John Wiley & Sons, Inc.5-26 Service Improvement Analysis waiting time (8 min.) is too long hire assistant for cashier? hire assistant for cashier? increased service rate increased service rate hire another cashier? hire another cashier? reduced arrival rate reduced arrival rate Is improved service worth the cost?
27
Copyright 2009 John Wiley & Sons, Inc.5-27 Advanced Single-Server Models Constant service times occur most often when automated equipment or machinery performs service occur most often when automated equipment or machinery performs service Finite queue lengths occur when there is a physical limitation to length of waiting line occur when there is a physical limitation to length of waiting line Finite calling population number of “customers” that can arrive is limited number of “customers” that can arrive is limited
28
Copyright 2009 John Wiley & Sons, Inc.5-28 Advanced Single-Server Models (cont.)
29
Copyright 2009 John Wiley & Sons, Inc.5-29 Basic Multiple-Server Model single waiting line and service facility with several independent servers in parallel same assumptions as single-server model sμ > λ s = number of servers s = number of servers servers must be able to serve customers faster than they arrive servers must be able to serve customers faster than they arrive
30
Copyright 2009 John Wiley & Sons, Inc.5-30 1 λ n s!s n – s μ P 0, for n ≤ s 1 λ n n! μ ( ) { P 0, for n > s P n = probability that there are no customers in system probability of n customers in system 1 λ n 1 λ s sμ n! μ s! μ sμ - λ ( ) ( )( ) n = s – 1 n = 0 1 P 0 = ∑ + Basic Multiple-Server Model (cont.)
31
Copyright 2009 John Wiley & Sons, Inc.5-31 Basic Multiple-Server Model (cont.) probability that customer must wait ( ) 1 λ s sμ 1 λ s sμ s! μ sμ – λ P w = P 0 λμ (λ/μ) s λ λμ (λ/μ) s λ (s – 1)! (sμ – λ) 2 μ L = P 0 + Lλ W =W =W =W = L q = L – λμ 1 L q μ λ W q = W – = ρ =ρ =ρ =ρ = λ λ λsμsμ λ λsμsμ
32
Copyright 2009 John Wiley & Sons, Inc.5-32 Basic Multiple-Server Model Example
33
Copyright 2009 John Wiley & Sons, Inc.5-33 Basic Multiple-Server Model Example (cont.)
34
Copyright 2009 John Wiley & Sons, Inc.5-34 Basic Multiple-Server Model Example (cont.)
35
Copyright 2009 John Wiley & Sons, Inc.5-35 Basic Multiple-Server Model Example (cont.)
36
Copyright 2009 John Wiley & Sons, Inc.5-36 Basic Multiple-Server Model Example (cont.)
37
Copyright 2009 John Wiley & Sons, Inc.5-37 Basic Multiple-Server Model Example (cont.) To cut wait time, add another service representative now, s = 4 now, s = 4 Therefore:
38
17-38 Cost Evaluation Service Cost = (Number of servers) x (wages per time unit) = s C s Waiting Cost = (Number of customers waiting in the system) x (cost of waiting per time unit) = L C w Total cost = service cost + waiting cost
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.