OPSM 301: Operations Management Session 12: Service processes and flow variability Koç University Graduate School of Business MBA Program Zeynep Aksin.

Slides:



Advertisements
Similar presentations
EMBA-2, BUP Major Asad EO Chapter 5: Process Analysis.
Advertisements

Managing Processes and Capabilities CHAPTER THREE McGraw-Hill/Irwin Copyright © 2011 by the McGraw-Hill Companies, Inc. All rights reserved.
Operations Management
1 Ardavan Asef-Vaziri Oct. 2011Operations Management: Waiting Lines 1 Polling: Lower Waiting Time, Longer Processing Time (Perhaps) Waiting Lines.
OPSM 301 Operations Management
Scheduling.
OPSM 301 Operations Management Class 13: Service Design Waiting-Line Models Koç University Zeynep Aksin
Service Processes. 1. Understand the characteristics of service processes and know how they differ from manufacturing processes. 2. Construct a service.
Capacity Setting and Queuing Theory
S. D. Deshmukh OM V. Capacity Planning in Services u Matching Supply and Demand u The Service Process u Performance Measures u Causes of Waiting u Economics.
S. Chopra/Operations/Managing Services1 Operations Management: Capacity Management in Services Module u Why do queues build up? u Process attributes and.
1 Term Project – Call Center Operations SOM 686, Fall 2006 Darren Mitchell Hayden Gilbert Serge Suprun.
OPSM 405 Service Management Class 19: Managing waiting time: Queuing Theory Koç University Zeynep Aksin
OM&PM/Class 7a1 Operations Management & Performance Modeling 1Operations Strategy 2Process Analysis 3Lean Operations 4Supply Chain Management 5Capacity.
Previously Optimization Probability Review Inventory Models Markov Decision Processes.
Previously Optimization Probability Review Inventory Models Markov Decision Processes.
Operations Management Waiting Lines. 2 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  Questions: Can we process the orders? How many.
ECS 152A Acknowledgement: slides from S. Kalyanaraman & B.Sikdar
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2  Made-to-stock (MTS) operations  Product is manufactured and stocked in advance of.
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 6 SCHEDULING E
Queuing and Transportation
1 Queueing Theory H Plan: –Introduce basics of Queueing Theory –Define notation and terminology used –Discuss properties of queuing models –Show examples.
Polling: Lower Waiting Time, Longer Processing Time (Perhaps)
Capacity Management in Services Module
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Terminology: The characteristics of a queuing system is captured by five parameters:
CHAPTER 19 Scheduling Operations Management, Eighth Edition, by William J. Stevenson Copyright © 2005 by The McGraw-Hill Companies, Inc. All rights reserved.
Chapter 16: Learning Objectives
Queuing Theory (Waiting Line Models)
Operations Managment Kristen’s Cookie - Lecture 4 (Chapters 4 and 5)
OPSM 301: Operations Management
MBA 8452 Systems and Operations Management MBA 8452 Systems and Operations Management Product Design & Process Selection —Service.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 16 Scheduling.
Dr. Cesar Malave Texas A & M University
OPSM 501: Operations Management Week 6: The Goal Koç University Graduate School of Business MBA Program Zeynep Aksin
1 Chapter 5 Flow Lines Types Issues in Design and Operation Models of Asynchronous Lines –Infinite or Finite Buffers Models of Synchronous (Indexing) Lines.
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Introduction to the Theory of Constraints (TOC) & Critical Chain Project Management (CCPM) Major Mark McNabb.
Announcement-exam rules
Lines and Waiting Waiting and Service Quality A Quick Look at Queuing Theory Utilization versus Variability Tradeoff Managing Perceptions... “Every day.
15-1Scheduling William J. Stevenson Operations Management 8 th edition.
Introduction to Operations Research
Queueing Analysis of Production Systems (Factory Physics)
OPSM 405 Service Management Class 18: Managing capacity Koç University Zeynep Aksin
CS433 Modeling and Simulation Lecture 12 Queueing Theory Dr. Anis Koubâa 03 May 2008 Al-Imam Mohammad Ibn Saud University.
1 Queuing Systems (2). Queueing Models (Henry C. Co)2 Queuing Analysis Cost of service capacity Cost of customers waiting Cost Service capacity Total.
OPSM 405 Service Operations Management
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
OMG Operations Management Spring 1997 CLASS 4: THE IMPACT OF VARIABILITY Harry Groenevelt.
Analysis and Design of Asynchronous Transfer Lines as a series of G/G/m queues.
OPSM 301: Operations Management Session 19: Flow variability Koç University Zeynep Aksin
OMSAN LOJİSTİK. Top Management Program in Logistics & Supply Chain Management (TMPLSM) Production and Operations Management 3: Process Analysis.
11-IE IE IE-60  Facilities design for manufacturing systems is extremely important because of the economic dependence of the firm.  Facility.
Operations Fall 2015 Bruce Duggan Providence University College.
The Effects of Process Variability 35E00100 Service Operations and Strategy #3 Fall 2015.
OPSM 301: Operations Management Session 13-14: Queue management Koç University Graduate School of Business MBA Program Zeynep Aksin
Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
Analysis and Design of Asynchronous Transfer Lines as a series of G/G/m queues.
Queuing Theory Simulation & Modeling.
Lin/Operations/Managing Services1 Capacity Management in Services Module u Queuing processes and performance measures u Why do queues build up? u Performance.
Class 28: Review for Final Exam
Introduction to the Theory of Constraints (TOC) & Critical Chain Project Management (CCPM) Major Mark McNabb.
Managing Flow Variability: Safety Capacity
Analytical Tools for Process Analysis and Improvement
Al-Imam Mohammad Ibn Saud University
Queuing models Basic definitions, assumptions, and identities
Queuing models Basic definitions, assumptions, and identities
Chap 11 Learning Objectives
8 Job Sequencing & Operations Scheduling CHAPTER Arranged by
MECH 3550 : Simulation & Visualization
CSE 550 Computer Network Design
Presentation transcript:

OPSM 301: Operations Management Session 12: Service processes and flow variability Koç University Graduate School of Business MBA Program Zeynep Aksin

Recall the smiley face game: an unbalanced line  if average task times are different, will have an unbalanced line will have idleness  in unbalanced case, slowest task determines output rate bottleneck is busy idleness in other stages

The role of variability 6units/hr 4 or 8/hr 2 or 10 0 or 12 As variability increases, throughput (rate) decreases Capacity/hr:

The role of task times: a balanced line  if task times are similar will have a balanced line in the absence of variability (deterministic) complete synchronization is possible in a balanced line idleness is minimized, though in the presence of variability full synchronization cannot be achieved

Compounding effect of variability and unbalanced task times 6/hr4/hr 4 or 8/hr 2 or 6/hr 2 or 100 or 8 4/hr 3.5/hr 2.5/hr

Resource interaction effects 6/hr 4 or 8/hr 2 or 10 0 or 12 6/hr 4 or 8/hr 2 or 100 or 12 6/hr 4.5/hr 3/hr 1.5/hr In a serial process downstream resources depend on upstream resources: can have temporary starvation (idleness) As variability increases, the impact of resource interaction increases

Variability in multi-stage processes  We have seen how variability hurts performance in a multi-stage process –Worse with unbalanced task times and resource interference  Note that –We assumed a very simplistic form of processing time variability –We assumed there is no variability in arrivals  We now know variability hurts, but can’t say how much yet

Want to eliminate as much variability as possible from your processes: how?  specialization in tasks can reduce task time variability  standardization of offer can reduce job type variability  automation of certain tasks  IT support: templates, prompts, etc.  Incentives  Scheduled arrivals to reduce demand variability  Initiatives to smoothen arrivals

Want to reduce resource interference in your processes: how?  smaller lotsizes (smaller batches)  better balanced line  by speeding-up bottleneck (adding staff, changing procedure, different incentives, change technology)  through cross-training  eliminate steps  buffers  integrate work (pooling)

What differentiates services  Customer contact: the physical presence of the customer in the system –Service systems with a high degree of customer contact are more difficult to control  The product is the process: the work process involved in providing the service itself

Structuring the Service Encounter: Service-System Design Matrix

Service Delivery System Customer Demand Limited Capacity Fundamental Problem: Variable Usage Services cannot be produced in advance and stored for later consumption; they must be produced at the time of consumption.

Designing Service Organizations  We cannot inventory services  In services capacity becomes the dominant issue –Too much capacity leads to excessive costs –Insufficient capacity leads to lost customers  Managing waiting lines is a central issue in services

Service Blueprinting and Fail-Safing  The standard tool for service process design is the flowchart –Called a service blueprint  A unique feature of the service blueprint is the distinction made between the high customer contact aspects of the service and those activities that the customer does not see –Made with a “line of visibility” on the flowchart

Process Blueprint Example: Automotive Service Operation 15 Not served in order Process time-consuming incorrect diagnosis incorrect estimate F F F F

To address the “how much does variability hurt” question: Consider service processes  This could be a call center or a restaurant or a ticket counter  Customers or customer jobs arrive to the process; their arrival times are not known in advance  Customers are processed. Processing rates have some variability.  The combined variability results in queues and waiting.  We need to build some safety capacity in order to reduce waiting due to variability

Components of the Queuing System Visually Customers come in Customers are served Customers leave

Specifications of a Service Provider Service Provider Leaving Customers Waiting Customers Demand Pattern Resources Human resources Information system other... Arriving Customers Satisfaction Measures Reneges or abandonments Waiting Pattern Served Customers Service Time

The Service Process  Customer Inflow (Arrival) Rate (R i ) ( ) –Inter-arrival Time = 1 / R i  Processing Time T p (unit load) –Processing Rate per Server = 1/ T p (µ)  Number of Servers (c) –Number of customers that can be processed simultaneously  Total Processing Rate (Capacity) = R p = c / T p (cµ)

Operational Performance Measures Flow time T=T w +T p (waiting+process) Inventory I= I w + I p Flow Rate R =Min (R i, R p  Stable Process= R i < R p,, so that R = R i Little’s Law: I = R  T, I w = R  T w, I p = R  T p Capacity Utilization  = R i / R p < 1 Safety Capacity = R p – R i Number of Busy Servers = I p = c  = R i  T p waiting processing ( ) R i e.g10 /hr R ( ) 10 /hr 10 min, R p =12/hr Tw?Tw?

Flow Times with Arrival Every 4 Secs (Service time=5 seconds) Customer Number Arrival Time Departure Time Time in Process What is the queue size? Can we apply Little’s Law? What is the capacity utilization?

Customer Number Arrival Time Departure Time Time in Process Flow Times with Arrival Every 6 Secs (Service time=5 seconds) What is the queue size? What is the capacity utilization?

Customer Number Arrival Time Processing Time Time in Process Effect of Variability What is the queue size? What is the capacity utilization?

Customer Number Arrival Time Processing Time Time in Process Effect of Synchronization What is the queue size? What is the capacity utilization?

Conclusion  If inter-arrival and processing times are constant, queues will build up if and only if the arrival rate is greater than the processing rate  If there is (unsynchronized) variability in inter-arrival and/or processing times, queues will build up even if the average arrival rate is less than the average processing rate  If variability in interarrival and processing times can be synchronized (correlated), queues and waiting times will be reduced

A measure of variability  Needs to be unitless  Only variance is not enough  Use the coefficient of variation  C or CV=  / 

Interpreting the variability measures C i = coefficient of variation of interarrival times i) constant or deterministic arrivals C i = 0 ii) completely random or independent arrivals C i =1 iii) scheduled or negatively correlated arrivals C i < 1 iv) bursty or positively correlated arrivals C i > 1

Why is there waiting?  the perpetual queue: insufficient capacity-add capacity  the predictable queue: peaks and rush-hours- synchronize/schedule if possible  the stochastic queue: whenever customers come faster than they are served-reduce variability