Polling: Lower Waiting Time, Longer Processing Time (Perhaps)

Slides:



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

Waiting Line Management
Process Flow Analysis The Little’s Law The main source for preparing these slides is Managing Business Process Flow Anupindi, Chopra, Deshmoukh, Van.
Managing Demand and Capacity
Operations Management
1 Ardavan Asef-Vaziri Oct. 2011Operations Management: Waiting Lines 1 Polling: Lower Waiting Time, Longer Processing Time (Perhaps) Waiting Lines.
Managing Demand and Capacity
15-1 Managing Demand and Capacity  The Underlying Issue: Lack of Inventory Capability  Capacity Constraints  Demand Patterns  Strategies for Matching.
OPSM 301: Operations Management Session 12: Service processes and flow variability Koç University Graduate School of Business MBA Program Zeynep Aksin.
LESSONs NINE and TEN QUEUING MODELS.
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.
Review of Probability Distributions
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
Waiting Time Management
QMD: Waiting-line analysis
People as Strategy: Managing
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.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines2  Made-to-stock (MTS) operations  Product is manufactured and stocked in advance of.
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.
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
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.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Terminology: The characteristics of a queuing system is captured by five parameters:
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
A Somewhat Odd Service Process (Chapters 1-6)
Introduction to Management Science
MKT 346: Marketing of Services Dr. Houston Chapter 9: Balancing Demand Against Productive Capacity.
1 1 Slide © 2005 Thomson/South-Western Chapter 12, Part A Waiting Line Models n Structure of a Waiting Line System n Queuing Systems n Queuing System Input.
Introduction to Queuing Theory
Operations Management
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Throughput Part 2 Effective Capacity & Utilization Based on the book: Managing Business Process Flows.
Introduction to Operations Research
Make to stock vs. Make to Order
Chapter 16 Capacity Planning and Queuing Models
OMG Operations Management Spring 1997 CLASS 4: THE IMPACT OF VARIABILITY Harry Groenevelt.
Balancing Demand and Capacity
OPSM 301: Operations Management Session 19: Flow variability Koç University Zeynep Aksin
Copyright 2013 John Wiley & Sons, Inc. Chapter 8 Capacity, Scheduling, and Location Planning.
OMSAN LOJİSTİK. Top Management Program in Logistics & Supply Chain Management (TMPLSM) Production and Operations Management 3: Process Analysis.
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.
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.
Sampling and Confidence Interval How can it be that mathematics, being after all a product of human thought independent of experience, is so admirably.
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.
Managing Customer Waiting Lines and Reservations.
Queueing Theory/Waiting Line: Models and Analysis Navneet Vidyarthi
1 Ardavan Asef-Vaziri Jan.-2016Basics Probability Distributions- Uniform.
Managerial Decision Making Chapter 13 Queuing Models.
15-1 MANAGING DEMAND AND CAPACITY Variations in Demand Relative to Capacity.
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
Modeling and Simulation CS 313
Effect of Buffer Capacity
Management of Waiting Lines
Throughput Key Problems
Effect of Buffer Capacity
Presentation transcript:

Polling: Lower Waiting Time, Longer Processing Time (Perhaps) Waiting Lines

Make to Stock (MTS) vs. Make to Order (MTO) Made-to-stock (MTS) operations. Product is manufactured and stocked in advance. Safety inventory protects against stockouts due to variability of arrival time and processing time. Inventory also permits economies of scale. Make-to-order (MTO) operations. Each order is specific, cannot be stored in advance. Ex. banks, restaurants, retail checkout counters, airline reservation, hospitals , repair shops, call centres. Production systems also try to follow Dell Computer model. We needs to maintain sufficient capacity to deal with uncertainty in both arrival and processing time. Safety Capacity vs. Safety Inventory.

A Call Centre The Call Centre Process Sales Reps Processing Calls (Service Process) Incoming Calls (Customer Arrivals) on Hold (Service Inventory) Answered Calls (Customer Departures) Blocked Calls (Due to busy signal) Abandoned Calls (Due to long waits) Calls In Process The Call Centre Process

Capacity More than Demand- Still Waiting Lines? Variability The time of the arrival of an order is not known ahead of time. It is a random variable with estimated Average and Standard Deviation. The time of the next telephone call is not known. The time of arrival of the next car into a gas station is not known. The service time is not known (precisely) ahead of time. It is a random variable with estimated Average and Standard Deviation. The time a customers spends on the web page of amazon.com is not precisely known. The time a customer spends speaking with the teller in the bank is unknown.

Article: The Psychology of Waiting Lines Unoccupied time feels longer than occupied time. Pre-process waits feels longer than in-process waits. Anxiety makes waits seem longer. Uncertain waits are longer than known, finite waits. Unexplained waits are longer than explained waits. Unfair waits are longer than equitable waits. The more valuable the service, the longer I will wait. Solo waiting feels longer than group waiting.

Characteristics of Queuing Systems Variability in arrival time and service time leads to Idleness of resources Waiting time of customers (orders) to be processed We are interested in evaluating two measures: Average waiting time of flow units. Average waiting time in the waiting line and in the system (Waiting line + Processor). Average number of flow units. The average number of orders (customers) waiting in the waiting line (to be then processed). Let us first look at the Servers or Processors

AVERAGE Processing Time Tp AVERAGE Processing Rate Rp Tp : Processing time. Tp units of time. Ex. 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.

More than One Server; c Servers Tp : processing time. Rp : processing rate. What is the relationship between Rp and Tp? If we have one resource  Rp = 1/Tp What is the relationship between Rp and Tp when we have more than one resource; We have c recourses Rp = c/Tp Each customer always spends Tp unites of time with the server

Average Processing Rate of c Servers Tp = 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.

Inter-arrival Time (Ta) and Arrival Rate (Ra) Ta : customer inter-arrival time. On average each 10 minutes one customer arrives. Ra: customer arrival (inflow) rate. What is the relationship between Ta and Ra Ta = every ten minutes one customer arrives How many customers in a minute? 1/10; Ra= 1/Ta= 1/10 Ra = 1/10 customers per min; 6 customers per hour Ra= 1/Ta

Throughput = Min (Ri,Rp) Ra MUST ALWAYS <= Rp. We will show later that even Ra=Rp is not possible. Incoming rate must be less than processing rate. Throughput = Flow Rate R = Min (Ra, Rp) . Stable Process = Ra< Rp  R = Ra Safety Capacity Rs = Rp – Ra

Buffer (waiting line) and Processors (Servers) Flow time T = Ti + Tp Inventory I = Ii + Ip Ti: waiting time in the inflow buffer Ii: number of customers in the inflow buffer What is the waiting time in the servers (processors)? Throughput?

Utilization is Always Less than 1 U = Utilization U =inflow rate / processing rate U = throughout / process capacity U = R/ Rp < 1 Safety Capacity = Rp – R For example , R = 6 per hour, processing time for a single server is 5 min  Rp= 12 per hour, U = R/ Rp = 6/12 = 0.5 Safety Capacity = Rp – R = 12-6 = 6

Given the Utilization, How Many Flow Units are in the Processor(s) Given a single server, and a utilization of U= 0.5 How many flow units are in the server ? U = 0.5 means 50% of time there is 1 flow unit in the server 50% of time there is 0 flow unit in the server 0.5  1 + 0.5  0 = 0.5 Average Inventory in the server is equal to utilization Ip= 1U = U

Given the Utilization, How Many Flow Units are in the Processor(s) Given 2 servers, and a utilization of U = 0.3 How many flow units are in the servers ? U = 0.3 means 30% of time there is 1 flow unit in each server 70% of time there is 0 flow unit in each server 0.3  1 + 0.7  0 = 0.3 flow unit in each server Average Inventory in the server is equal to utilization times the number of servers Ip= 2U = cU

What We Have Learned Without Looking for any Formula Processing time: Tp, Ex. Tp = 5 minutes Number of servers: c, Ex. c=3 Tp is also waiting time in the server, no mater one server or c servers. Tp in this example is always 5 min. Processing rate Rp= c/Tp. Ex. Rp =3/5 per min; 36/hr Utilization: U. Ex. U = 0.8 in our example Number of the flow units in all servers, Ip = cU In our example, Ip = 3  0.8 = 2.4 Can we compute R?  TR = I Tp  R = cU  R = cU/Tp 5  R = 2.4  R = 0.48 flow units per minute or 28.8 / hr We learned it without looking at any formula

What We Have Learned Without Looking for any Formula Processing time of a set of servers is 10 minutes. Tp = 10 minutes. There are 3 servers. Utilization of these servers is 0.8. 1. Compute the processing rate of this system. Rp=? 2. On average how many flow units are in these servers? 3. Compute the arrival rate (throughput) of this system. 4. What is the average interarival time between two consecutive customers ?