Service Processes Operations Management Dr. Ron Lembke.

Slides:



Advertisements
Similar presentations
Chapter 7 Product Design and process Selection – Services
Advertisements

Ch. 4 Product & Service Design
Chapter 5: Service Processes
E&CE 418: Tutorial-4 Instructor: Prof. Xuemin (Sherman) Shen
Waiting Lines Operations Management Dr. Ron Lembke.
Design of Services To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved.
Service Processes. 1. Understand the characteristics of service processes and know how they differ from manufacturing processes. 2. Construct a service.
What is the Poisson Distribution? Dr. Ron Tibben-Lembke.
HAWKES LEARNING SYSTEMS math courseware specialists Copyright © 2010 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Chapter 7 Probability.
Queueing Lessons Dr. Ron Lembke Operations Management.
Service Processes Chapter 7. Service Businesses Facilities-based services: Where the customer must go to the service facility Field-based services: Where.
1 © The McGraw-Hill Companies, Inc., 2004 Chapter 6 Product Design and Process Selection – Services.
© The McGraw-Hill Companies, Inc., Technical Note 6 Waiting Line Management.
Probability Distributions Finite Random Variables.
Chapter 13 Queuing Theory
Queues / Lines You manage a call center which can answer an average of 20 calls an hour. Your call center gets 17.5 calls in an average hour. On average.
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
Queueing Theory.
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
Lecture 14 – Queuing Systems
The Poisson Distribution (Not in Reif’s book)
Queuing Theory (Waiting Line Models)
Chapter 8 Service Processes.
B7801: Operations Management 27 March Agenda Mass Customization National Cranberry Cooperative Capacity Management Queue and customer management.
Spreadsheet Modeling & Decision Analysis
MBA 8452 Systems and Operations Management MBA 8452 Systems and Operations Management Product Design & Process Selection —Service.
Service Systems & Queuing Chapter 12S OPS 370. Nature of Services –A
D-1 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Operations Management Waiting-Line Models Module D.
McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. Service Processes CHAPTER 5.
Introduction to Operations Research
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
Queueing Theory Dr. Ron Lembke Operations Management.
McGraw-Hill/Irwin © 2011 The McGraw-Hill Companies, All Rights Reserved Chapter 7 Service Processes.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
Service Processes Operations Management Dr. Ron Tibben-Lembke.
Chapter 20 Queuing Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
OMSAN LOJİSTİK. Top Management Program in Logistics & Supply Chain Management (TMPLSM) Production and Operations Management 3: Process Analysis.
Random Variable The outcome of an experiment need not be a number, for example, the outcome when a coin is tossed can be 'heads' or 'tails'. However, we.
1-1 1 Service Process Selection and Design Chapter 8.
MTSU 1 Designing Quality Services. MTSU 2 The Nature of Services Services are unique Quality of work is not quality of service Service package contains.
Product Design & Process Selection - Services
1 Slides used in class may be different from slides in student pack Chapter 8 Product Design and process Selection – Services  Service Generalizations.
Chapter 7 Service Process Selection and Design
Simulation Chapter 16 of Quantitative Methods for Business, by Anderson, Sweeney and Williams Read sections 16.1, 16.2, 16.3, 16.4, and Appendix 16.1.
OPSM 301: Operations Management Session 13-14: Queue management Koç University Graduate School of Business MBA Program Zeynep Aksin
Random Variables r Random variables define a real valued function over a sample space. r The value of a random variable is determined by the outcome of.
Abu Bashar Queuing Theory. What is queuing ?? Queues or waiting lines arise when the demand for a service facility exceeds the capacity of that facility,
SERVICE PROCESSES CHAPTER 5. Learning Objectives After completing the chapter you will: Understand the characteristics of service processes and how they.
Managerial Decision Making Chapter 13 Queuing Models.
BUSINESS MATHEMATICS & STATISTICS. LECTURE 39 Patterns of probability: Binomial, Poisson and Normal Distributions Part 4.
1 © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved Chapter 7 Service Process Selection and Design.
Probability Distributions: a review
Product Design and Process Selection – Services
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Dr. Ron Lembke Operations Management
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Queuing Theory Queuing Theory.
Chapter 7 Product Design and process Selection – Services
Modeling and Simulation CS 313
Poisson Distribution (Not in Reif’s book)
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
Demo on Queuing Concepts
Service Operations Management (SOM) Waiting Line Models
ECE 358 Examples #1 Xuemin (Sherman) Shen Office: EIT 4155
Chapter 5 Designing Services.
Operations Management Dr. Ron Lembke
Supplement D Waiting Line Models
Poisson Distribution (Not in Reif’s book)
Lecture 13 – Queuing Systems
IE 360: Design and Control of Industrial Systems I
Presentation transcript:

Service Processes Operations Management Dr. Ron Lembke

How are Services Different? Everyone is an expert on services What works well for one service provider doesn’t necessarily carry over to another Quality of work is not quality of service “Service package” consists of tangible and intangible components Services are experienced, goods are consumed Mgmt of service involves mktg, personnel Service encounters mail, phone, F2F

Degree of Customer Contact More customer contact, harder to standardize and control Customer influences: Time of demand Exact nature of service Quality (or perceived quality) of service

3 Approaches Which is Best? Production Line Self-Service Personal attention

What do People Want? Amount of friendliness and helpfulness Speed and convenience of delivery Price of the service Variety of services Quality of tangible goods involved Unique skills required to provide service Level of customization

Service-System Design Matrix Mail contact Face-to-face loose specs Face-to-face tight specs Phone Contact Face-to-face total customization Buffered core (none) Permeable system (some) Reactive system (much) High Low High Low Degree of customer/server contact Internet & on-site technology Sales Opportunity Production Efficiency

Applying Behavioral Science The end is more important to the lasting impression (Colonoscopy) Segment pleasure, but combine pain Let the customer control the process Follow norms & rituals Compensation for failures: fix bad product, apologize for bad service

Restaurant Tipping NormalExperiment Introduce self (Sun brunch) 15%23% Smiling (alone in bar) 20%48% Waitress28%33% Waiter (upscale lunch) 21%18% “…staffing wait positions is among the most important tasks restaurant managers perform.”

Fail-Safing “poka-yokes” – Japanese for “avoid mistakes” Not possible to do things the wrong way Indented trays for surgeons ATMs beep so you don’t forget your card Pagers at restaurants for when table ready Airplane bathroom locks turn on lights Height bars at amusement parks

How Much Capacity Do We Need?

Blueprinting Fancy word for making a flow chart “line of visibility” separates what customers can see from what they can’t Flow chart “back office” and “front office” activities separately.

Capacity greater than Average # customers arriving per hour

Queues In England, they don’t ‘wait in line,’ they ‘wait on queue.’ So the study of lines is called queueing theory.

Cost-Effectiveness How much money do we lose from people waiting in line for the copy machine? Would that justify a new machine? How much money do we lose from bailing out (balking)?

We are the problem Customers arrive randomly. Time between arrivals is called the “interarrival time” Interarrival times often have the “memoryless property”: On average, interarrival time is 60 sec. the last person came in 30 sec. ago, expected time until next person: 60 sec. 5 minutes since last person: still 60 sec. Variability in flow means excess capacity is needed

Memoryless Property Interarrival time = time between arrivals Memoryless property means it doesn’t matter how long you’ve been waiting. If average wait is 5 min, and you’ve been there 10 min, expected time until bus comes = 5 min Exponential Distribution Probability time is t =

Poisson Distribution Assumes interarrival times are exponential Tells the probability of a given number of arrivals during some time period T.

Ce n'est pas les petits poissons. Les poissons How I love les poissons Love to chop And to serve little fish First I cut off their heads Then I pull out the bones Ah mais oui Ca c'est toujours delish Les poissons Hee hee hee Hah hah hah With the cleaver I hack them in two I pull out what's inside And I serve it up fried God, I love little fishes Don't you?

Simeon Denis Poisson "Researches on the probability of criminal and civil verdicts" 1837 looked at the form of the binomial distribution when the number of trials was large. He derived the cumulative Poisson distribution as the limiting case of the binomial when the chance of success tend to zero.

Binomial Distribution The binomial distribution tells us the probability of having x successes in n trials, where p is the probability of success in any given attempt.

Binomial Distribution The probability of getting 8 tails in 10 coin flips is:

Poisson Distribution

POISSON(x,mean,cumulative) X is the number of events. Mean is the expected numeric value. Cumulative is a logical value that determines the form of the probability distribution returned. If cumulative is TRUE, POISSON returns the cumulative Poisson probability that the number of random events occurring will be between zero and x inclusive; if FALSE, it returns the Poisson probability mass function that the number of events occurring will be exactly x.

Larger average, more normal

Queueing Theory Equations Memoryless Assumptions: Exponential arrival rate = Avg. interarrival time = 1/ Exponential service rate =  Avg service time = 1/  Utilization =  = / 

Avg. # in System Lq = avg # in line = Ls = avg # in system = Prob. n in system=

Average Time Wq = avg wait in line Ws = avg time in system

System Structure The more comlicated the system, the harder it is to model: Separate lines Separate tellers, etc.

Now what? Simulate! Build a computer version of it, and try it out Tweak any parameters you want Change it as much as you want Try it out with zero risk

Factors to Consider Arrival patterns, arrival rate Size of arrival units – 1,2,4 at a time? Degree of patience Length line grows to Number of lines – 1 is best Does anyone get priority?

Service Time Distribution Deterministic – each person always takes 5 minutes Random – low variability, most people take similar amounts of time Random – high variability, large difference between slow & fast people

Which is better, one line or two?

Waiting Lines Operations Management Dr. Ron Lembke

Everyone is just waiting

People Hate Lines Nobody likes waiting in line Entertain them, keep them occupied Let them be productive: fill out deposit slips, etc. (Wells Fargo) People hate cutters / budgers Like to see that it is moving, see people being waited on Tell them how long the wait will be (Space Mountain)

Retail Lines Things you don’t need in easy reach Candy Seasonal, promotional items People hate waiting in line, get bored easily, reach for magazine or book to look at while in line Magazines

Disney FastPass Wait without standing around Come back to ride at assigned time Only hold one pass at a time Ride other rides Buy souvenirs Do more rides per day

Fastpasses

Some Lucky People Get These

In-Line Entertainment Set up the story Get more buy-in to ride Plus, keep from boredom

Slow me down before going again Create buzz, harvest addresses

False Hope Dumbo Peter Pan

What did we learn? Human considerations very important in services Queueing Theory can help with simple capacity decisions Simulation needed for more complex ones People hate lines, but hate uncertainty more Keep them informed and amused