1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2  Made-to-stock (MTS) operations  Product is manufactured and stocked in advance of.

Slides:



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

Process Flow Analysis The Little’s Law The main source for preparing these slides is Managing Business Process Flow Anupindi, Chopra, Deshmoukh, Van.
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
OPSM 301: Operations Management Session 12: Service processes and flow variability Koç University Graduate School of Business MBA Program Zeynep Aksin.
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.
Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Capacity Planning and Queuing Models.
1 Ardavan Asef-Vaziri Jan-2011Operations Management: Waiting Lines 2 Bank of San Pedro has only 1 teller. On average, 1 customer comes every 6 minutes,
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.
1 Ardavan Asef-Vaziri Jan-2011Operations Management: Waiting Lines 2 The arrival rate to a GAP store is 6 customers per hour and has Poisson distribution.
Operations Management Waiting Lines. 2 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines1  Understanding the phenomenon of waiting  Measures.
Waiting Lines Example-1
OPSM 405 Service Management Class 19: Managing waiting time: Queuing Theory Koç University Zeynep Aksin
Queuing Models Basic Concepts
1 Ardavan Asef-Vaziri Jan-2011Operations Management: Waiting Lines 2 Example: The arrival rate to a GAP store is 6 customers per hour and has Poisson distribution.
Operations Management Waiting Lines. 2 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  Questions: Can we process the orders? How many.
Queuing Systems Chapter 17.
Operations Management Waiting Lines. 2 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  Questions: Can we process the orders? How many.
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)
MGTSC 352 Lecture 23: Congestion Management Introduction: Asgard Bank example Simulating a queue Types of congested systems, queueing template Ride’n’Collide.
OM&PM/Class 6b1 1Operations Strategy 2Process Analysis 3Lean Operations 4Supply Chain Management 5Capacity Management in Services –Class 6b: Capacity Analysis.
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.
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:
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.
Quality Control.
Buffer or Suffer Principle
OPSM 301: Operations Management
A Somewhat Odd Service Process (Chapters 1-6)
Introduction to Management Science
1 Chapter 16 Applications of Queuing Theory Prepared by: Ashraf Soliman Abuhamad Supervisor by : Dr. Sana’a Wafa Al-Sayegh University of Palestine Faculty.
Introduction to Queuing Theory
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Throughput Part 2 Effective Capacity & Utilization Based on the book: Managing Business Process Flows.
Introduction to Operations Research
Lecture 14 – Queuing Networks Topics Description of Jackson networks Equations for computing internal arrival rates Examples: computation center, job shop.
Structure of a Waiting Line System Queuing theory is the study of waiting lines Four characteristics of a queuing system: –The manner in which customers.
Make to stock vs. Make to Order
Queueing Theory What is a queue? Examples of queues: Grocery store checkout Fast food (McDonalds – vs- Wendy’s) Hospital Emergency rooms Machines waiting.
Chapter 16 Capacity Planning and Queuing Models
CS433 Modeling and Simulation Lecture 12 Queueing Theory Dr. Anis Koubâa 03 May 2008 Al-Imam Mohammad Ibn Saud University.
OMG Operations Management Spring 1997 CLASS 4: THE IMPACT OF VARIABILITY Harry Groenevelt.
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.
CS352 - Introduction to Queuing Theory Rutgers University.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Mean inter-arrival time = 1/Ri = 1/R  Probability that the time between two arrivals.
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.
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.
1 Safety Capacity Capacity Planning in Services Industry  Matching Supply and Demand in Service Processes  Performance Measures  Causes of Waiting 
Queueing Theory. The study of queues – why they form, how they can be evaluated, and how they can be optimized. Building blocks – arrival process and.
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 BIS 3106: Business Process Management (BPM) Lecture Nine: Quantitative Process Analysis (2) Makerere University School of Computing and Informatics Technology.
Queuing Theory Simulation & Modeling.
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.
Lecture 14 – Queuing Networks
Managing Flow Variability: Safety Capacity
Al-Imam Mohammad Ibn Saud University
ECE 358 Examples #1 Xuemin (Sherman) Shen Office: EIT 4155
Variability 8/24/04 Paul A. Jensen
Lecture 14 – Queuing Networks
On average, there are 3(4.42) =13.26 claims waiting be processed.
Presentation transcript:

1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2  Made-to-stock (MTS) operations  Product is manufactured and stocked in advance of demand  Inventory permits economies of scale and protects against stockouts due to variability of inflows and outflows  Make-to-order (MTO) process  Each order is specific, cannot be stored in advance  Process manger needs to maintain sufficient capacity  Variability in both arrival and processing time  Role of capacity rather than inventory  Safety inventory vs. Safety Capacity  Example: Service operations Make to stock vs. Make to Order

2 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2  Banks (tellers, ATMs, drive-ins)  Fast food restaurants (counters, drive-ins)  Retail (checkout counters)  Airline (reservation, check-in, takeoff, landing, baggage claim)  Hospitals (ER, OR, HMO)  Service facilities (repair, job shop, ships/trucks load/unload)  Some production systems- to some extend (Dell computer)  Call centers (telemarketing, help desks, 911 emergency) Examples

3 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 The DesiTalk Call Center Sales Reps Processing Calls (Service Process) Incoming Calls (Customer Arrivals) Calls on Hold (Service Inventory) Answered Calls (Customer Departures) Blocked Calls (Due to busy signal) Abandoned Calls (Due to long waits) Calls In Process (Due to long waits) The Call Center Process

4 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 Tp : processing time. Tp units of time. Example, on average it takes 5 minutes to serve a customer. Rp : processing rate. Rp flow units are handled per unit of time. If Tp is 5 minutes. Compute Rp. Rp= 1/5 per minute. Or 60/5 = 12 per hour. Service Process Attributes

5 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 Tp : processing time. Rp : processing rate. What is the relationship between Rp and Tp? If we have one resource  Rp = 1/Tp Service Process Attributes What is the relationship between Rp and Tp Rp = c/Tp Each customer always stay for Tp unites of time with the server In general when we have c recourses

6 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 T p = 5 minutes. Processing time is 5 minute. Each customer on average is with the server for 5 minutes. c = 3, we have three servers. Processing rate of each server is 1/5 customers per minute. Or 12 customer per hour. Rp is the processing rate of all three servers. Rp = c/Tp Rp = 3/5 customers/minute. Or 36 customers/hour. Service Process Attributes

7 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 Service Process Attributes T a : customer inter-arrival time. On average each 10 minutes one customer arrives. R i : customer arrival (inflow) rate. What is the relationship between Ta and Ri Ta = every ten minutes one customer arrives How many customers in a minute? 1/10; Ri = 1/Ta= 1/10 Ri = 1/10 customers per min; 6 customers per hour Ri = 1/Ta

8 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 Service Process Attributes Ri MUST ALWAYS <= Rp We will show later that even Ri=Rp is not possible Incoming rate must be less than processing rate Throughput = Flow Rate R = Min (Ri, Rp Stable Process = Ri < Rp,, so that R = Ri Safety Capacity Rs = Rp – Ri

9 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 Waiting time in the servers (processors)? Throughput? Operational Performance Measures Flow time T = T i + T p Inventory I = I i + I p T i : waiting time in the inflow buffer I i : number of customers waiting in the inflow buffer

10 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 = Utilization = inflow rate / processing rate = throughout / process capacity = R/ Rp < 1 Safety Capacity = Rp – R For example, R = 6 per hour, processing time for a single server is 6 min  Rp= 12 per hour, = R/ Rp = 6/12 = 0.5 Safety Capacity = Rp – R = 12-6 = 6 Service Process Attributes

11 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 Given a single server. And a utilization of = 0.5 How many flow units are in the server ? Operational Performance Measures Given 2 servers. And a utilization of r = 0.5 How many flow units are in the servers ?

12 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 Operational Performance Measures Flow time T T i + T p Inventory I = I i + I p R I = R T R = I/T = Ii/Ti = Ip/Tp Ii = R Ti Ip = R  Tp Tp  if 1 server  Rp = 1/Tp In general, if c servers  Rp = c/Tp

13 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 Operational Performance Measures  = R/ R p = (Ip/Tp)/(c/Tp) = Ip/c And it is obvious that  = Ip/c Because on average there are Ip people in the processors and the capacity of the servers is to serve c costomer at a time. = R/R p = Ip/c From the Little’s Law  Rp = c/Tp R = Ip/Tp From definition of Rp 

14 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2  Sales Throughput Rate  Cost Capacity utilization Number in queue / in system  Customer service Waiting Time in queue /in system Financial Performance Measures

15 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 What is the queue size? What is the capacity utilization? Arrival Rate at an Airport Security Check Point Customer NumberArrival Time Departure Time Time in Process

16 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 What is the queue size? What is the capacity utilization? Flow Times with Arrival Every 6 Secs Customer NumberArrival Time Departure Time Time in Process

17 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 What is the queue size? What is the capacity utilization? Flow Times with Arrival Every 6 Secs Customer NumberArrival TimeProcessing Time Time in Process 1-A077 2-B C D E F G H I J54111

18 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 What is the queue size? What is the capacity utilization? Flow Times with Arrival Every 6 Secs Customer NumberArrival TimeProcessing Time Time in Process 1-E088 2-H D A B J C F G I5457

19 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2  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 Conclusion

20 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2  Two key drivers of process performance are (i) Capacity utilization, and (ii) interarrival time and processing time variability  High capacity utilization ρ= R/ Rp or low safety capacity Rs =R – Rp, due to High inflow rate R Low processing rate Rp=c / Tp, which may be due to small-scale c and/or slow speed 1 /Tp  High, unsynchronized variability in Interarrival times Processing times Causes of Delays and Queues

21 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2  Variability in the interarrival and processing times can be measured using standard deviation. Higher standard deviation means greater variability.  Coefficient of Variation: the ratio of the standard deviation of interarrival time (or processing time) to the mean.  Ci = coefficient of variation for interarrival times  Cp = coefficient of variation for processing times Drivers of Process Performance

22 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 Operational Performance Measures Flow time T = T i + T p Inventory I = I i + I p T i : waiting time in the inflow buffer = ? I i : number of customers waiting in the inflow buffer =?

23 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2  R i / R p, where R p = c / T p  C i and C p are the Coefficients of Variation  (Standard Deviation/Mean) of the inter-arrival and processing times (assumed independent) The Queue Length Formula Utilization effect Variability effect

24 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 This part factor captures the capacity utilization effect, which shows that queue length increases rapidly as the capacity utilization p increases to 1 Factors affecting Queue Length The second factor captures the variability effect, which shows that the queue length increases as the variability in interarrival and processing times increases. Whenever there is variability in arrival or in processing queues will build up and customers will have to wait, even if the processing capacity is not fully utilized.

25 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 Throughput- Delay Curve Variability Increases Average Flow Time T Utilization (ρ)  100% TpTp

26 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 Coefficient of Variations

27 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 A sample of 10 observations on Interarrival times in seconds 10,10,2,10,1,3,7,9, 2, 6 =AVERAGE ()  Avg. interarrival time = 6 R i = 1/6 arrivals / sec. =STDEV()  Std. Deviation = 3.94 C i = 3.94/6 = 0.66 C 2 i = (0.66) 2 = Example 8.4

28 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 A sample of 10 observations on processing times in seconds 7,1,7 2,8,7,4,8,5, 1 T p = 5 seconds R p = 1/5 processes/sec. Std. Deviation = 2.83 C p = 2.83/5 = 0.57 C 2 p = (0.57) 2 = Example 8.4

29 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 R i =1/6 < R P =1/5  R = R i  = R/ R P = (1/6)/(1/5) = 0.83 With c = 1, the average number of passengers in queue is as follows: Example 8.4 On average 1.56 passengers waiting in line, even though safety capacity is Rs= R P - Ri = 1/5 - 1/6 = 1/30 passenger per second, or 2 per minutes I i = [( )/(1-0.83)] ×[( )/2] = 1.56

30 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 Other performance measures: T i =I i /R = (1.56)(6) = 9.4 seconds Compute T? T = Ti+Tp Since T P = 5  T = T i + T P = 14.4 seconds Total number of passengers in the process is: I = RT = (1/6) (14.4) = 2.4 Alternatively, 1.56 in the buffer. How many in the process? I = = Example 8.4

31 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 Compute R, Rp and : Ta= 6 min, Tp = 5 min R = Ri= 1/6 per minute Processing rate for one processor 1/5 for 2 processors Rp = 2/5  = R/Rp = (1/6)/(2/5) = 5/12 = Now suppose we have two servers. On average passengers waiting in line. safety capacity is Rs= R P - Ri = 2/5 - 1/6 = 7/30 passenger per second, or 14 passengers per minutes

32 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 Other performance measures: T i =I i /R = (0.076)(6) = 0.46 seconds Compute T? T = Ti+Tp Since T P = 5  T = T i + T P = = 5.46 seconds Total number of passengers in the process is: I= 0.08 in the buffer and in the process. I = (0.417) = 0.91 Example 8.4 cρRsRs IiIi TiTi TI

33 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 Example: The arrival rate to a GAP store is 6 customers per hour and has Poisson distribution. The service time is 5 min per customer and has Exponential distribution. On average how many customers are in the waiting line? How long a customer stays in the line? How long a customer stays in the processor (with the server)? On average how many customers are with the server? On average how many customers are in the system? On average how long a customer stay in the system? Assignment- Problem 1: M/M/1 Performance Evaluation

34 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 Assignment- Problem 2: M/M/1 Performance Evaluation What if the arrival rate is 11 per hour?

35 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 A local GAP store on average has 10 customers per hour for the checkout line. The inter-arrival time follows the exponential distribution. The store has two cashiers. The service time for checkout follows a normal distribution with mean equal to 5 minutes and a standard deviation of 1 minute. On average how many customers are in the waiting line? How long a customer stays in the line? How long a customer stays in the processors (with the servers)? On average how many customers are with the servers? On average how many customers are in the system ? On average how long a customer stay in the system ? Assignment- Problem 3: M/G/c

36 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2 A call center has 11 operators. The arrival rate of calls is 200 calls per hour. Each of the operators can serve 20 customers per hour. Assume interarrival time and processing time follow Poisson and Exponential, respectively. What is the average waiting time (time before a customer’s call is answered)? Assignment- Problem 4: M/M/c Example

37 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2  Suppose the service time is a constant  What is the answer of the previous question? Assignment- Problem 5: M/D/c Example