Slide 1 Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted.

Slides:



Advertisements
Similar presentations
Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard.
Advertisements

Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard.
Operations Management
Slide 1 Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted.
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.
MGTSC 352 Lecture 23: Inventory Management Big Blue Congestion Management Introduction: Asgard Bank example Simulating a queue Types of congested systems,
S. Chopra/Operations/Managing Services1 Operations Management: Capacity Management in Services Module u Why do queues build up? u Process attributes and.
Slide 1 Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted.
Healthcare Operations Management © 2008 Health Administration Press. All rights reserved. 1.
OM&PM/Class 7a1 Operations Management & Performance Modeling 1Operations Strategy 2Process Analysis 3Lean Operations 4Supply Chain Management 5Capacity.
Chapter 22 Simulation with Process Model to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
Management of Waiting Lines
MGTSC 352 Lecture 23: Congestion Management Introduction: Asgard Bank example Simulating a queue Types of congested systems, queueing template Ride’n’Collide.
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.
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.
Management of Waiting Lines
Capacity Management in Services Module
Buffer or Suffer Principle
Queuing Models and Capacity Planning
Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard.
Slide 1 Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted.
Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard.
1 Providing Timely Access to Healthcare or Must Patients be Patient? Based on presentation by Professor Linda Green Columbia Business School April 20 th,
Queueing Theory I. Summary Little’s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems  M/M/1  M/M/m  M/M/1/K  …
Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard.
Queueing Theory [Bose] “The basic phenomenon of queueing arises whenever a shared facility needs to be accessed for service by a large number of jobs or.
Network Analysis A brief introduction on queues, delays, and tokens Lin Gu, Computer Networking: A Top Down Approach 6 th edition. Jim Kurose.
Introduction to Queuing Theory
Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard.
Slide 1 Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted.
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
CS433 Modeling and Simulation Lecture 13 Queueing Theory Dr. Anis Koubâa 03 May 2009 Al-Imam Mohammad Ibn Saud University.
Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard.
 Birth Death Processes  M/M/1 Queue  M/M/m Queue  M/M/m/B Queue with Finite Buffers  Results for other Queueing systems 2.
Introduction to Operations Research
Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 18 Management of Management of Waiting Lines.
18 Management of Waiting Lines.
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
CS433 Modeling and Simulation Lecture 12 Queueing Theory Dr. Anis Koubâa 03 May 2008 Al-Imam Mohammad Ibn Saud University.
1 Queuing Systems (2). Queueing Models (Henry C. Co)2 Queuing Analysis Cost of service capacity Cost of customers waiting Cost Service capacity Total.
Supplement D Waiting Line Models
Slide 1 Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted.
Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard.
Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard.
Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard.
Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard.
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.
Adeyl Khan, Faculty, BBA, NSU Elements of Queuing System ArrivalsServiceWaiting line Exit Processing order System.
Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
QUEUING THEORY 1.  - means the number of arrivals per second   - service rate of a device  T - mean service time for each arrival   = ( ) Utilization,
1 BIS 3106: Business Process Management (BPM) Lecture Nine: Quantitative Process Analysis (2) Makerere University School of Computing and Informatics Technology.
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
Al-Imam Mohammad Ibn Saud University
Management of Waiting Lines
Effect of Buffer Capacity
Demo on Queuing Concepts
Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard.
System Performance: Queuing
Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard.
Variability 8/24/04 Paul A. Jensen
Queueing Theory 2008.
Effect of Buffer Capacity
Presentation transcript:

Slide 1 Matching Supply with Demand: An Introduction to Operations Management Gérard Cachon ChristianTerwiesch All slides in this file are copyrighted by Gerard Cachon and Christian Terwiesch. Any instructor that adopts Matching Supply with Demand: An Introduction to Operations Management as a required text for their course is free to use and modify these slides as desired. All others must obtain explicit written permission from the authors to use these slides.

Slide 2 Variability – Throughput Loss

Slide 3 Lessons from Call Center Case: The Three Enemies of Operations Additional costs due to variability in demand and activity times Is associated with longer wait times and / or customer loss Requires process to hold excess capacity (idle time) Variability Use of resources beyond what is needed to meet customer requirements Not adding value to the product, but adding cost Reducing the performance of the production system 7 different types of waste WasteWorkValue- adding WasteWorkValue- adding Waste Inflexibility Additional costs incurred because of supply demand mismatches Waiting customers or Waiting (idle capacity) Capacity Customer demand

Slide 4 From Theory to Practice: How Many Patients will be Cured? Accidents Happen Ambulance Arrives Emergency Room Care Process Actual flows are determined by rolling the dice (1…6) Round 1: patients die if they are not taken care of in the same round Round 2: patients can be moved forward in the next round How many patients will be cured after 10 rounds?

Slide 5 Different Models of Variability Waiting problems Utilization has to be less than 100% Impact of variability is on Flow Time Loss problems Demand can be bigger than capacity Impact of variability is on Flow Rate Pure waiting problem, all customers are perfectly patient. All customers enter the process, some leave due to their impatience Customers do not enter the process once buffer has reached a certain limit Customers are lost once all servers are busy Same if customers are patientSame if buffer size=0 Same if buffer size is extremely large Variability is always bad – you pay through lower flow rate and/or longer flow time Buffer or suffer: if you are willing to tolerate waiting, you don’t have to give up on flow rate

Slide 6 Macro Economic Trends Driving Emergency Room Crowding and Ambulance Diversion Data from L. Green; general accounting office 20% of US hospitals are on diversion status for more than 2.4 hours per day Increase in ER visits 40% of patients admitted through the ER Decrease in number of emergency departments Consequences: –Long wait times (see waiting time analysis) –Loss of throughput (requires new analysis)

Slide 7 Analyzing Loss Systems Trauma center moves to diversion status once all servers are busy incoming patients are directed to other locations Resources 3 trauma bays (m=3) Demand Process One trauma case comes in every 3 hours (a=3 hours) a is the interarrival time Exponential interarrival times Service Process Patient stays in trauma bay for an average of 2 hours (p=2 hours) p is the service time Can have any distribution What is P m, the probability that all m resources are utilized?

Slide 8 Analyzing Loss Systems: Finding P m (r) Define r = p / a Example: r= 2 hours/ 3 hours r=0.67 Recall m=3 Use Erlang Loss Table Find that P 3 (0.67)= Given P m (r) we can compute: Time per day that system has to deny access Flow units lost = 1/a * P m (r) r = p / a m

Slide 9 Probability{all m servers busy}= Erlang Loss Table

Slide 10 Implied utilization Probability that all servers are utilized m=1 m=2 m=5 m=10 m= m=3 Implied utilization vs probability of having all servers utilized: Pooling Revisited