Effect of Buffer Capacity

Slides:



Advertisements
Similar presentations
Make to Stock (MTS) vs. Make to Order (MTO)
Advertisements

Waiting Line Management
Capacity Planning and Queuing Models
Operations Management
1 Ardavan Asef-Vaziri Oct. 2011Operations Management: Waiting Lines 1 Polling: Lower Waiting Time, Longer Processing Time (Perhaps) Waiting Lines.
E&CE 418: Tutorial-4 Instructor: Prof. Xuemin (Sherman) Shen
ArrivalsServiceWaiting line Exit Processing order System Queuing Systems: basic elements.
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.
Waiting Lines Example-1
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.
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2  Made-to-stock (MTS) operations  Product is manufactured and stocked in advance of.
Waiting Line Models And Service Improvement
Management of Waiting Lines
Polling: Lower Waiting Time, Longer Processing Time (Perhaps)
Little’s Theorem Examples Courtesy of: Dr. Abdul Waheed (previous instructor at COE)
14-1. Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 14 Capacity Planning and Queuing Models.
OM&PM/Class 6b1 1Operations Strategy 2Process Analysis 3Lean Operations 4Supply Chain Management 5Capacity Management in Services –Class 6b: Capacity Analysis.
Chapter 18 Management of Waiting Lines
Problem 8.4 K = ∞ R i = 60/4 = 15 /hr T p = 3 min = 0.05 hour c= 1 R p = c/Tp = 20 /hour Both Ti and Tp exponential Server $20 /hr Phone $5/hr Wait cost.
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
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:
Buffer or Suffer Principle
OPSM 301: Operations Management
D-1 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Operations Management Waiting-Line Models Module D.
CS433 Modeling and Simulation Lecture 13 Queueing Theory Dr. Anis Koubâa 03 May 2009 Al-Imam Mohammad Ibn Saud University.
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
OMG Operations Management Spring 1997 CLASS 6: Process Design and Performance Measurement Harry Groenevelt.
1 Queuing Analysis Overview What is queuing analysis? - to study how people behave in waiting in line so that we could provide a solution with minimizing.
Make to stock vs. Make to Order
Chapter 16 Capacity Planning and Queuing Models
1 Queuing Systems (2). Queueing Models (Henry C. Co)2 Queuing Analysis Cost of service capacity Cost of customers waiting Cost Service capacity Total.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Queueing Theory Dr. Ron Lembke Operations Management.
MINGZHE HAN (CMP TUTOR) COMM 204 Review Session. Outline T ABLE OF C ONTENT (Basic Information) (Process Analysis) (Multiple Types and the Product Process.
Slide 1 Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted.
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.
Computer Networking Queueing (A Summary from Appendix A) Dr Sandra I. Woolley.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Trauma center moves to diversion status once all servers are busy (incoming patients are directed to other locations) Figure 7.1.: Process flow diagram.
Example 14.3 Queuing | 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | Background Information n County Bank has several.
1 Safety Capacity Capacity Planning in Services Industry  Matching Supply and Demand in Service Processes  Performance Measures  Causes of Waiting 
1 Ardavan Asef-Vaziri Jan-2011Operations Management: Waiting Lines 2 Example: The average arrival rate to a GAP store is 6 customers per hour. The average.
1 Ardavan Asef-Vaziri Jan.-2016Basics Probability Distributions- Uniform.
Managerial Decision Making Chapter 13 Queuing Models.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 18 Management of Waiting Lines.
Lin/Operations/Managing Services1 Capacity Management in Services Module u Queuing processes and performance measures u Why do queues build up? u Performance.
Managing Flow Variability: Safety Capacity
Chapter 4 Inventory Management.
Analyzing Security and Energy Tradeoffs in Autonomic Capacity Management Wei Wu.
Management of Waiting Lines
Demo on Queuing Concepts
Service Operations Management (SOM) Waiting Line Models
WL2. An ambulance company receives a request for service about every 45 minutes. The service time, which includes time for the ambulance to get to the.
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.
DECISION MODELING WITH Prentice Hall Publishers and
Variability 8/24/04 Paul A. Jensen
Queuing Applications.
Queuing Models and Capacity Planning
Problem 8.3 John Doe has promised a total service time of 20 minutes. Processing time at the oven = 15 min Preparation = 2 min At most 3 minutes waiting.
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
On average, there are 3(4.42) =13.26 claims waiting be processed.
Effect of Buffer Capacity
Presentation transcript:

Effect of Buffer Capacity Process Data Ri = 20/hour, Tp = 2.5 mins, c = 1, K = # Lines – c Performance Measures K 4 5 6 Ii 1.23 1.52 1.79 Ti 4.10 4.94 5.72 Pb 0.1004 0.0771 0.0603 R 17.99 18.46 18.79 r 0.749 0.768 0.782

Economics of Capacity Decisions Cost of Lost Business Cb $ / customer Increases with competition Cost of Buffer Capacity Ck $/unit/unit time Cost of Waiting Cw $ /customer/unit time Cost of Processing Cs $ /server/unit time Increases with 1/ Tp Tradeoff: Choose c, Tp, K Minimize Total Cost/unit time = Cb Ri Pb + Ck K + Cw I (or Ii) + c Cs

Optimal Buffer Capacity Cost Data Cost of telephone line = $5/hour, Cost of server = $20/hour, Margin lost = $100/call, Waiting cost = $2/customer/minute Effect of Buffer Capacity on Total Cost K $5(K + c) $20 c $100 Ri Pb $120 Ii TC ($/hr) 4 25 20 200.8 147.6 393.4 5 30 154.2 182.6 386.4 6 35 120.6 214.8 390.4

Optimal Processing Capacity K = 6 – c Pb Ii TC ($/hr) = $20c + $5(K+c) + $100Ri Pb+ $120 Ii 1 5 0.0771 1.542 $386.6 2 4 0.0043 0.158 $97.8 3 0.0009 0.021 $94.2 0.0004 0.003 $110.8

Performance Variability Effect of Variability Average versus Actual Flow time Time Guarantee Promise Service Level P(Actual Time  Time Guarantee) Safety Time Time Guarantee – Average Time Probability Distribution of Actual Flow Time P(Actual Time  t) = 1 – EXP(- t / T)

Effect of Blocking and Abandonment Blocking: the buffer is full = new arrivals are turned away Abandonment: the customers may leave the process before being served Proportion blocked Pb Proportion abandoning Pa

Net Rate: Ri(1- Pb)(1- Pa) Throughput Rate: R=min[Ri(1- Pb)(1- Pa),Rp] Effect of Blocking and Abandonment Net Rate: Ri(1- Pb)(1- Pa) Throughput Rate: R=min[Ri(1- Pb)(1- Pa),Rp]

Example 8.8 - DesiCom Call Center Arrival Rate Ri= 20 per hour=0.33 per min Processing time Tp =2.5 minutes (24/hr) Number of servers c=1 Buffer capacity K=5 Probability of blocking Pb=0.0771 Average number of calls on hold Ii=1.52 Average waiting time in queue Ti=4.94 min Average total time in the system T=7.44 min Average total number of customers in the system I=2.29

Example 8.8 - DesiCom Call Center Throughput Rate R=min[Ri(1- Pb),Rp]= min[20*(1-0.0771),24] R=18.46 calls/hour Server utilization: R/ Rp=18.46/24=0.769

Example 8.8 - DesiCom Call Center Number of lines 5 6 7 8 9 10 Number of servers c 1 Buffer Capacity K 4 Average number of calls in queue 1.23 1.52 1.79 2.04 2.27 2.47 Average wait in queue Ti (min) 4.10 4.94 5.72 6.43 7.08 7.67 Blocking Probability Pb (%) 10.04 7.71 6.03 4.78 3.83 3.09 Throughput R (units/hour) 17.99 18.46 18.79 19.04 19.23 19.38 Resource utilization .749 .769 .782 .793 .801 .807

Capacity Investment Decisions The Economics of Buffer Capacity Cost of servers wages =$20/hour Cost of leasing a telephone line=$5 per line per hour Cost of lost contribution margin =$100 per blocked call Cost of waiting by callers on hold =$2 per minute per customer Total Operating Cost is $386.6/hour

Example 8.9 - Effect of Buffer Capacity on Total Cost Number of lines n 5 6 7 8 9 Number of CSR’s c 1 Buffer capacity K=n-c 4 Cost of servers ($/hr)=20c 20 Cost of tel.lines ($/hr)=5n 25 30 35 40 45 Blocking Probability Pb (%) 10.04 7.71 6.03 4.78 3.83 Lost margin = $100RiPb 200.8 154.2 120.6 95.6 76.6 Average number of calls in queue Ii 1.23 1.52 1.79 2.04 2.27 Hourly cost of waiting=120Ii 147.6 182.4 214.8 244.8 272.4 Total cost of service, blocking and waiting ($/hr) 393.4 386.6 390.4 400.4 414

Example 8.10 - The Economics of Processing Capacity The number of line is fixed: n=6 The buffer capacity K=6-c c K Blocking Pb(%) Lost Calls RiPb (number/hr) Queue length Ii Total Cost ($/hour) 1 5 7.71% 1.542 1.52 30+20+(1.542x100)+(1.52x120)=386.6 2 4 0.43% 0.086 0.16 30+40+(0.086x100)+(0.16x120)=97.8 3 0.09% 0.018 0.02 30+60+(0.018x100)+(0.02x120)=94.2 0.04% 0.008 0.00 30+80+(0.008x100)+(0.00x120)110.8

Variability in Process Performance Why considering the average queue length and waiting time as performance measures may not be sufficient? Average waiting time includes both customers with very long wait and customers with short or no wait. We would like to look at the entire probability distribution of the waiting time across all customers. Thus we need to focus on the upper tail of the probability distribution of the waiting time, not just its average value.

Average of 20 customers per hour Example 8.11 - WalCo Drugs One pharmacist, Dave Average of 20 customers per hour Dave takes Average of 2.5 min to fill prescription Process rate 24 per hour Assume exponentially distributed interarrival and processing time; we have single phase, single server exponential model Average total process is; T = 1/(Rp – Ri) = 1/(24 -20) = 0.25 or 15 min

Example 8.11 - Probability distribution of the actual time customer spends in process (obtained by simulation)

Example 8.11 - Probability Distribution Analysis 65% of customers will spend 15 min or less in process 95% of customers are served within 40 min 5% of customers are the ones who will bitterly complain. Imagine if they new that the average customer spends 15 min in the system. 35% may experience delays longer than Average T,15min

Service Promise: Tduedate , Service Level & Safety Time SL; The probability of fulfilling the stated promise. The Firm will set the SL and calculate the Tduedate from the probability distribution of the total time in process (T). Safety time is the time margin that we should allow over and above the expected time to deliver service in order to ensure that we will be able to meet the required date with high probability Tduedate = T + Tsafety Prob(Total time in process <= Tduedate) = SL Larger SL results in grater probability of fulfilling the promise.

Due Date Quotation Due Date Quotation is the practice of promising a time frame within which the product will be delivered. We know that in single-phase single server service process; the Actual total time a customer spends in the process is exponentially distributed with mean T. SL = Prob(Total time in process <= Tduedate) = 1 – EXP( - Tduedate /T) Which is the fraction of customers who will no longer be delayed more than promised. Tduedate = -T ln(1 – SL)

95% of customers will get served within 45 min Example 8.12 - WalCo Drug WalCo has set SL = 0.95 Assuming total time for customers is exponential Tduedate = -T ln(1 – SL) Tduedate = -T ln(0.05) = 3T Flow time for 95 percentile of exponential distribution is three times the average T Tduedate = 3 * 15 = 45 95% of customers will get served within 45 min Tduedate = T + Tsafety Tsafety = 45 – 15 = 30 min 30 min is the extra margin that WalCo should allow as protection against variability

Higher the utilization; Longer the promised time and Safety time Relating Utilization and Safety Time: Safety Time Vs. Capacity Utilization Capacity utilization ρ 60 % 70% 80% 90% Waiting time Ti 1.5Tp 2.33Tp 4Tp 9Tp Total flow time T= Ti + Tp 2.5Tp 3.33Tp 5Tp 10Tp Promised time Tduedate 7.7Tp 10Tp 15Tp 30Tp Safety time Tsafety = Tduedate – T 5Tp 6.67Tp 10Tp 20Tp Higher the utilization; Longer the promised time and Safety time Safety Capacity decreases when capacity utilization increases Larger safety capacity, the smaller safety time and therefore we can promise a shorter wait

Managing Customer Perceptions and Expectations Uncertainty about the length of wait (Blind waits) makes customers more impatient. Solution is Behavioral Strategies Making the waiting customers comfortable Creating distractions Offering entertainment

Thank you Questions?