A Somewhat Odd Service Process (Chapters 1-6)

Slides:



Advertisements
Similar presentations
Process Analysis and Design
Advertisements

Waiting Line Management
Operations Management
E&CE 418: Tutorial-4 Instructor: Prof. Xuemin (Sherman) Shen
Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard.
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.
INDR 343 Problem Session
Review of Probability Distributions
Operations Management Waiting Lines. 2 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines1  Understanding the phenomenon of waiting  Measures.
Queuing Models Basic Concepts
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.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2  Made-to-stock (MTS) operations  Product is manufactured and stocked in advance of.
Operations Management Waiting Lines. 2 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  Questions: Can we process the orders? How many.
Chapter 13 Queuing Theory
1 Queuing Theory 2 Queuing theory is the study of waiting in lines or queues. Server Pool of potential customers Rear of queue Front of queue Line (or.
Management of Waiting Lines
Queueing Theory Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO
Queueing Theory Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO
Chapter 18 Management of Waiting Lines
Queuing Theory. Queuing theory is the study of waiting in lines or queues. Server Pool of potential customers Rear of queue Front of queue Line (or queue)
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Terminology: The characteristics of a queuing system is captured by five parameters:
QUEUING MODELS Queuing theory is the analysis of waiting lines It can be used to: –Determine the # checkout stands to have open at a store –Determine the.

Buffer or Suffer Principle
Queuing Models and Capacity Planning
___________________________________________________________________________ Operations Research  Jan Fábry Waiting Line Models.
OPSM 301: Operations Management
Spreadsheet Modeling & Decision Analysis
Service Systems & Queuing Chapter 12S OPS 370. Nature of Services –A
Waiting Line Models ___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry.
Variability – Waiting Times
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Managing Waiting Lines.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
Queueing Analysis of Production Systems (Factory Physics)
Ch 6 Tech Notes OBJECTIVES
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
1-1 McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved 1 Chapter 8A Waiting Line Management.
1 Queuing Models Dr. Mahmoud Alrefaei 2 Introduction Each one of us has spent a great deal of time waiting in lines. One example in the Cafeteria. Other.
1 Systems Analysis Methods Dr. Jerrell T. Stracener, SAE Fellow SMU EMIS 5300/7300 NTU SY-521-N NTU SY-521-N SMU EMIS 5300/7300 Queuing Modeling and Analysis.
Chapter 16 Capacity Planning and Queuing Models
OMG Operations Management Spring 1997 CLASS 4: THE IMPACT OF VARIABILITY Harry Groenevelt.
yahoo.com SUT-System Level Performance Models yahoo.com SUT-System Level Performance Models8-1 chapter11 Single Queue Systems.
OPSM 301: Operations Management Session 19: Flow variability Koç University Zeynep Aksin
Components of the Queuing System
OMSAN LOJİSTİK. Top Management Program in Logistics & Supply Chain Management (TMPLSM) Production and Operations Management 3: Process Analysis.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3 Example: The arrival rate to a GAP store is 6 customers per hour and has Poisson distribution.
Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard.
Trauma center moves to diversion status once all servers are busy (incoming patients are directed to other locations) Figure 7.1.: Process flow diagram.
1 1 Slide Chapter 12 Waiting Line Models n The Structure of a Waiting Line System n Queuing Systems n Queuing System Input Characteristics n Queuing System.
Example 14.3 Queuing | 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | Background Information n County Bank has several.
OPSM 301: Operations Management Session 13-14: Queue management Koç University Graduate School of Business MBA Program Zeynep Aksin
Mohammad Khalily Islamic Azad University.  Usually buffer size is finite  Interarrival time and service times are independent  State of the system.
Queueing Theory/Waiting Line: Models and Analysis Navneet Vidyarthi
Managerial Decision Making Chapter 13 Queuing Models.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
18 Management of Waiting Lines
Managing Flow Variability: Safety Capacity
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Management of Waiting Lines
ECE 358 Examples #1 Xuemin (Sherman) Shen Office: EIT 4155
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
Variability 8/24/04 Paul A. Jensen
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
Presentation transcript:

Variability and Its Impact on Process Performance: Waiting Time Problems Chapter 7

A Somewhat Odd Service Process (Chapters 1-6) Patient Arrival Time Service 1 2 3 4 5 6 7 8 9 10 11 12 15 20 25 30 35 40 45 50 55 7:00 7:10 7:20 7:30 7:40 7:50 8:00

A More Realistic Service Process Patient 1 Patient 3 Patient 5 Patient 7 Patient 9 Patient 11 Patient 2 Patient 4 Patient 6 Patient 8 Patient 10 Patient 12 Patient Arrival Time Service 1 2 3 4 5 6 7 8 9 10 11 12 18 22 25 30 36 45 51 55 Time 7:00 7:10 7:20 7:30 7:40 7:50 8:00 3 2 Number of cases 1 2 min. 3 min. 4 min. 5 min. 6 min. 7 min. Service times

Variability Leads to Waiting Time Pt Arrival Time p 1 2 3 4 5 6 7 8 9 10 11 12 18 22 25 30 36 45 51 55 Service time Wait time 7:00 7:10 7:20 7:30 7:40 7:50 8:00 5 4 3 Inventory (Patients at lab) 2 1 7:00 7:10 7:20 7:30 7:40 7:50 8:00

Sources of Variability Processing Buffer

The “Memoryless” Exponential Function Interarrival times follow an exponential distribution Exponential interarrival times = Poisson arrival process Coefficient of Variation (CV )

Quite possibly the worst run of three slides you will see this semester

Waiting Time Flow rate Average flow time T Inventory waiting Iq In process Ip Increasing Variability Inflow Outflow Entry to system Begin Service Departure Time in queue Tq Service Time p Theoretical Flow Time Total Flow Time T=Tq+p Utilization 100% A Waiting Time Formula Service time factor Utilization factor Variability factor

Waiting Time for Multiple, Parallel Resources Inventory in service Ip Inventory waiting Iq Inflow Outflow Flow rate Entry to system Begin Service Departure Time in queue Tq Service Time p Total Flow Time T=Tq+p The Waiting Time Formula for Multiple (m) Servers

Summary of Queuing Analysis Utilization Flow unit Server Inventory in service Ip Time related measures Outflow Inflow Inventory waiting Iq Inventory related measures Entry to system Begin Service Departure Waiting Time Tq Service Time p Flow Time T=Tq+p

7. 2. E-mails arrive to My-Law. com from 8 a. m. to 6 p. m 7.2 E-mails arrive to My-Law.com from 8 a.m. to 6 p.m. at a rate of 10 e-mails per hour (cv=1). At each moment in time, there is exactly one lawyer “on call” waiting these e-mails. It takes on average five minutes to respond with a standard deviation of four minutes. What is the average time a customer must wait for a response? How many e-mails will a lawyer receive at the end of the day? When not responding to e-mails, the lawyer is encouraged to actively pursue cases that potentially could lead to large settlements. How much time during a ten hour shift can be devoted to this pursuit? To increase responsiveness of the system, a template will be used for most e-mail responses. The standard deviation for writing the response now drops to 0.5 minutes but the average writing time is unchanged. Now how much time can a lawyer spend pursuing cases? How long does a customer have to wait for a response to an inquiry?

Service Levels in Waiting Systems Fraction of customers who have to wait x seconds or less 1 90% of calls had to wait 25 seconds or less Waiting times for those customers who do not get served immediately 0.8 0.6 0.4 Fraction of customers who get served without waiting at all 0.2 50 100 150 200 Target Wait Time (TWT) Service Level = Probability{Waiting TimeTWT} Example: Deutsche Bundesbahn Call Center - now (2003): 30% of calls answered within 20 seconds - target: 80% of calls answered within 20 seconds Waiting time [seconds]

Data in Practical Call Center Setting Number of customers Distribution Function Per 15 minutes 160 160 1 1 140 140 0.8 0.8 120 120 Exponential distribution 100 100 0.6 0.6 80 80 0.4 0.4 Empirical distribution 60 60 (individual points) 40 40 0.2 0.2 20 20 0:00:00 0:00:09 0:00:17 0:00:26 0:00:35 0:00:43 0:00:52 0:01:00 0:01:09 0:15 0:15 2:00 2:00 3:45 3:45 5:30 5:30 7:15 7:15 9:00 9:00 10:45 10:45 12:30 12:30 14:15 14:15 16:00 16:00 17:45 17:45 19:30 19:30 21:15 21:15 23:00 23:00 Time

The Power of Pooling Waiting Time Tq 70.00 m=1 60.00 50.00 40.00 m=2 Independent Resources 2x(m=1) Waiting Time Tq 70.00 m=1 60.00 50.00 40.00 - OR - m=2 30.00 Pooled Resources (m=2) 20.00 m=5 10.00 m=10 0.00 60% 65% 70% 75% 80% 85% 90% 95% Utilization u

Priority Rules in Waiting Time Systems Service times: A: 9 minutes B: 10 minutes C: 4 minutes D: 8 minutes A C 4 min. 9 min. B D 19 min. 13 min. C A D 21 min. 23 min. B Total wait time: 4+13+21=38 min Total wait time: 9+19+23=51min SPT FCFS EDD Priority WNIFOARB

7.3 The airport branch of a car rental company maintains a fleet of 50 SUVs. The interarrival time between requests for an SUV is 2.4 hours with a standard deviation of 2.4 hours. Assume that, if all SUVs are rented, customers are willing to wait until an SUV is available. An SUV is rented, on average for 3 days, with a standard deviation of 1 day. What is the average number of SUVs in the company lot? What is the average time a customer has to wait to rent an SUV? The company discovers that if it reduces its daily $80 rental price by $25, the average demand would increase to 12 rentals per day and the average rental duration will become 4 days. Should they go for it? How would the waiting time change if the company decides to limit all SUV rentals to exactly 4 days? Assume that if such a restriction is imposed, the average interarrival time will increase to 3 hours as will the std deviation.