OMG 402 - Operations Management Spring 1997 CLASS 4: THE IMPACT OF VARIABILITY Harry Groenevelt.

Slides:



Advertisements
Similar presentations
Lecture 10 Queueing Theory. There are a few basic elements common to almost all queueing theory application. Customers arrive, they wait for service in.
Advertisements

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
Chapter Queueing Notation
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.
1 Chapter 8 Queueing models. 2 Delay and Queueing Main source of delay Transmission (e.g., n/R) Propagation (e.g., d/c) Retransmission (e.g., in ARQ)
OMG Operations Management Spring 1997
MGTSC 352 Lecture 23: Inventory Management Big Blue Congestion Management Introduction: Asgard Bank example Simulating a queue Types of congested systems,
M / M / 1 M - Memoryless* arrival process M - Memoryless* service time distribution 1 - One server * Memoryless / Deterministic / General Queueing System.
Continuous Time Markov Chains and Basic Queueing Theory
OPSM 405 Service Management Class 19: Managing waiting time: Queuing Theory Koç University Zeynep Aksin
Previously Optimization Probability Review Inventory Models Markov Decision Processes.
Previously Optimization Probability Review Inventory Models Markov Decision Processes.
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
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.
Queuing Systems Chapter 17.
Multiple server queues In particular, we look at M/M/k Need to find steady state probabilities.
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
Lecture 11 Queueing Models. 2 Queueing System  Queueing System:  A system in which items (or customers) arrive at a station, wait in a line (or queue),
1 Queueing Theory H Plan: –Introduce basics of Queueing Theory –Define notation and terminology used –Discuss properties of queuing models –Show examples.
Queueing Network Model. Single Class Model Open - Infinite stream of arriving customers Closed - Finite population eg Intranet users Indistinguishable.
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.
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
Model Antrian By : Render, ect. M/M/1 Example 2 Five copy machines break down at UM St. Louis per eight hour day on average. The average service time.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Terminology: The characteristics of a queuing system is captured by five parameters:
Lecture 4 Mathematical and Statistical Models in Simulation.

OPSM 301: Operations Management
A Somewhat Odd Service Process (Chapters 1-6)
Spreadsheet Modeling & Decision Analysis
M EAN -V ALUE A NALYSIS Manijeh Keshtgary O VERVIEW Analysis of Open Queueing Networks Mean-Value Analysis 2.
OMG Operations Management Spring 1997 CLASS 8: Process and Inventory Control (1) Harry Groenevelt.
Probability Review Thinh Nguyen. Probability Theory Review Sample space Bayes’ Rule Independence Expectation Distributions.
1 Chapter 5 Flow Lines Types Issues in Design and Operation Models of Asynchronous Lines –Infinite or Finite Buffers Models of Synchronous (Indexing) Lines.
OMG Operations Management Spring 1997 CLASS 6: Process Design and Performance Measurement Harry Groenevelt.
Lecture 14 – Queuing Networks Topics Description of Jackson networks Equations for computing internal arrival rates Examples: computation center, job shop.
Queueing Analysis of Production Systems (Factory Physics)
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
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.
TexPoint fonts used in EMF.
Spreadsheet Models for Managers: Session 12 12/1 Copyright © Richard Brenner Spreadsheet Models for Managers Session 12 Service Systems Single-Server.
Chapter 16 Capacity Planning and Queuing Models
Queueing Theory Dr. Ron Lembke Operations Management.
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
OMSAN LOJİSTİK. Top Management Program in Logistics & Supply Chain Management (TMPLSM) Production and Operations Management 3: Process Analysis.
MGTSC 352 Lecture 25: Congestion Management MEC example Manufacturing example.
M/M/1 Queues Customers arrive according to a Poisson process with rate. There is only one server. Service time is exponential with rate  j-1 jj+1...
The M/M/ N / N Queue etc COMP5416 Advanced Network Technologies.
Queuing Models in Operations
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.
Delays  Deterministic Assumes “error free” type case Delay only when demand (known) exceeds capacity (known)  Stochastic Delay may occur any time Random.
OPSM 301: Operations Management Session 13-14: Queue management Koç University Graduate School of Business MBA Program Zeynep Aksin
Queuing Models.
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.
Mohammad Khalily Islamic Azad University.  Usually buffer size is finite  Interarrival time and service times are independent  State of the system.
Simple Queueing Theory: Page 5.1 CPE Systems Modelling & Simulation Techniques Topic 5: Simple Queueing Theory  Queueing Models  Kendall notation.
Managerial Decision Making Chapter 13 Queuing Models.
Managing Flow Variability: Safety Capacity
B.Ramamurthy Appendix A
ECE 358 Examples #1 Xuemin (Sherman) Shen Office: EIT 4155
Queueing Theory Carey Williamson Department of Computer Science
Variability 8/24/04 Paul A. Jensen
Queuing Theory By: Brian Murphy.
Carey Williamson Department of Computer Science University of Calgary
Presentation transcript:

OMG Operations Management Spring 1997 CLASS 4: THE IMPACT OF VARIABILITY Harry Groenevelt

2 Agenda The Puff Line Sources of Variability Introduction to Queues The Physics of Queues –Impact of high utilization –Economies of scale –Quantifying the impact of variability Summary of Insights

3 Sources of Variability In any process there is variability in: l demand from external or internal customers l processing time within the system The impact of variability can be especially severe in service systems, which cannot build inventory to prepare for the ‘peak’

4 Sources of Demand Variability: Examples IRS service center: seasonal variability Mutual fund service center: early evening peak Variability created by other processes within the firm: –production batches (Shot-Peening,...) –transfer batches (e.g., filling a cart, truck or boat) –surges at airline ‘hubs’ –others….

5 Servers (s) system queue departures arrivals ( customers/hour)  customers/hr./server Introduction to Queues: Notation arrival rate ( ) in customers/hour service rate (  ) in customers/hour (avg. time for one customer = ____) # servers = s; Therefore, capacity = ____

6 Introduction to Queues: Examples servicecustomerqueue‘service’ facilityarrives..locationprocess health clinicfrontwaitingtreatment deskroom on-call computer consultant AOL ‘modem farm’

7 average number in queue average number in system wait in queue system queue wait in system prob(waiting time > t) Introduction to Queues: Performance Measures

8 Performance Measures for Queues Throughput = rate of customers served Utilization (  ) = throughput / capacity = proportion of all server time spent working = avg. number being served / number of servers Load Factor = arrival rate / capacity For the system on page 5, Throughput = ______ utilization = load factor = _____ But … when is throughput  arrival rate, utilization  load factor?

9 ‘memoryless’ arrivals ‘memoryless’ servers one server Introduction to Queues: Specifying Variability Must specify variability of arrivals and service times. One example: the M/M/1 queue –Time between arrivals exponentially distributed (‘Poisson’ arrival process) –Service times exponentially distributed –All customers served in order of arrival –Arrival and service rates constant (stationary system)

10 Avg. time between arrivals = 1/ = 0.2 hours = 12 minutes Avg. service time = 1/  = 10 minutes Physics of Queues: Example ‘Rapid Oil Change’: –one service bay –Poisson arrivals with rate 5 cars/hour ( ) –Exponential service times, mean = 10 min. (1/  )

11 utilization  0 1 avg. number in system Physics of Queues: Impact of High Utilization For an M/M/1 system average time in system = 1/(  – ) = 1/(6 cars/hour – 5 cars/hour) = 1 hour load factor = /  =  = 5/6 average number in system = /(  – ) =  /(1–  ) = (5/6) / (1–5/6) = 5 cars.

12 Physics of Queues: Utilization As utilization approaches 1, average time in system, wait in queue, number in system and number in queue all rise dramatically. This effect seen in any system, including: –M/M/s (multiple servers with ‘snake’ line) –G/G/s (multiple servers with ‘snake’ line, General arrival or service distribution)

13 Physics of Queues: Economies of Scale M/M/s Example: Rapid Oil Change Same as in first example except: –2 service bays (twice as many) –Poisson arrivals with rate 10 per hour (twice as high) What is this system’s utilization? Equations for M/M/s are not as simple, so we implement them in Excel...

14 M/M/s example results (from QMACROS): single bay two bays Physics of Queues Note the difference between 1 and 2 bay systems!

Number of Servers Pr{Wait > 5 minutes} Pr{Wait > 5 minutes} (see left scale) (Avg) Wait in Queue (hrs) (Avg) Wait in Queue (hrs) (see right scale) Physics of Queues M/M/s example: Economies of Scale –Vary number of servers and raise arrival rate proportionally (load factor always 5/6 = )

16 The Physics of Queues: Impact of Variability G/G/s model (same as M/M/s model, except): –General service time distribution –General inter-arrival time distribution

17 Impact of variability G/G/s model –For arrival process specify: Arrival Rate Coefficient of Variation of inter-arrival time distribution (cv(A)) –For service time distribution specify: Service Rate Coefficient of Variation of service time distribution (cv(S))

18 Impact of variability Reminder: if X is a random variable with mean  and standard deviation , then its Coefficient of Variation = cv(X) =  /  For exponential random variables: –Coefficient of Variation = 1 For deterministic random variables: –Coefficient of Variation = ________

19 An approximation good for ‘congested’ systems: What happens as arrivals become more ‘lumpy’? As service times become more variable? Similar effect for G/G/s (try in QMACROS) Impact of variability: G/G/1

20 Summary of Insights High utilization causes congestion, high WIP and long lead times Variability causes congestion, high WIP and long lead times At the same utilization, a larger system will perform better than a smaller system - or - smaller systems must have lower utilization to perform as well as larger systems