Operations Management Waiting Lines. 2 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  Questions: Can we process the orders? How many.

Slides:



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

Waiting Line Management
Operations Management
1 Ardavan Asef-Vaziri Oct. 2011Operations Management: Waiting Lines 1 Polling: Lower Waiting Time, Longer Processing Time (Perhaps) Waiting Lines.
OPSM 301: Operations Management Session 12: Service processes and flow variability Koç University Graduate School of Business MBA Program Zeynep Aksin.
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 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.
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.
Operations Management Waiting Lines. 2 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  Questions: Can we process the orders? How many.
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 6 SCHEDULING E
Simulation with ArenaChapter 2 – Fundamental Simulation Concepts Discrete Event “Hand” Simulation of a GI/GI/1 Queue.
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),
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
Operations Management
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.
WINTER 2012IE 368. FACILITY DESIGN AND OPERATIONS MANAGEMENT 1 IE 368: FACILITY DESIGN AND OPERATIONS MANAGEMENT Lecture Notes #3 Production System Design.
 1  Outline  simulating GI/G/1 queues  M/M/1 queues  theoretical results of queueing systems  an inventory system  simulation program with an event.
Graduate Program in Engineering and Technology Management
Queuing Networks. Input source Queue Service mechanism arriving customers exiting customers Structure of Single Queuing Systems Note: 1.Customers need.
OPSM 301: Operations Management
A Somewhat Odd Service Process (Chapters 1-6)
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Lines and Waiting Waiting and Service Quality A Quick Look at Queuing Theory Utilization versus Variability Tradeoff Managing Perceptions... “Every day.
Introduction to Operations Research
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)
Make to stock vs. Make to Order
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
1 Systems Analysis Methods Dr. Jerrell T. Stracener, SAE Fellow SMU EMIS 5300/7300 NTU SY-521-N NTU SY-521-N SMU EMIS 5300/7300 Queuing Modeling and Analysis.
Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.
Chapter 16 Capacity Planning and Queuing Models
OMG Operations Management Spring 1997 CLASS 4: THE IMPACT OF VARIABILITY Harry Groenevelt.
SIMULATION EXAMPLES QUEUEING SYSTEMS.
yahoo.com SUT-System Level Performance Models yahoo.com SUT-System Level Performance Models8-1 chapter11 Single Queue Systems.
Analysis and Design of Asynchronous Transfer Lines as a series of G/G/m queues.
OPSM 301: Operations Management Session 19: Flow variability Koç University Zeynep Aksin
IE450 Models Relating Cycle-time, Throughput, WIP and Batch Sizes
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.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Mean inter-arrival time = 1/Ri = 1/R  Probability that the time between two arrivals.
Introduction to Uncertainty Simulation of Operations.
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.
Assignment Capacity. 2 Ardavan Asef-Vaziri March, 2015Capacity- Basics MamossaAssaf Inc. fabricates garage doors. Roofs are punched in a roof punching.
(C) J. M. Garrido1 Objects in a Simulation Model There are several objects in a simulation model The activate objects are instances of the classes that.
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.
Delays  Deterministic Assumes “error free” type case Delay only when demand (known) exceeds capacity (known)  Stochastic Delay may occur any time Random.
Basic Queuing Insights Nico M. van Dijk “Why queuing never vanishes” European Journal of Operational Research 99 (1997)
OPSM 301: Operations Management Session 13-14: Queue management Koç University Graduate School of Business MBA Program Zeynep Aksin
Random Variables r Random variables define a real valued function over a sample space. r The value of a random variable is determined by the outcome of.
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.
Managing Flow Variability: Safety Capacity
Demo on Queuing Concepts
SIMULATION EXAMPLES QUEUEING SYSTEMS.
Our favorite simple stochastic process.
Introduction Notation Little’s Law aka Little’s Result
SIMULATION EXAMPLES QUEUEING SYSTEMS.
Variability 8/24/04 Paul A. Jensen
Discrete Event “Hand” Simulation of a GI/GI/1 Queue
SIMULATION EXAMPLES QUEUEING SYSTEMS.
Presentation transcript:

Operations Management Waiting Lines

2 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  Questions: Can we process the orders? How many orders will wait in the queue? How long will orders wait in the queue? What is the utilization rate of the facility? Example: A Deterministic System

3 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1 A Deterministic System: Example 1

4 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1 A Deterministic System: Example 1

5 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  Arrival rate = 1/10 per minutes  Processing rate = time 1/9 per minute  Utilization – AR/PR = (1/10)/(1/9) = 0.9 or 90%  On average 0.9 person is in the system Utilization

6 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1 A Deterministic System: Example 1 Utilization:90% Variability:0.00 Average Throughput time:9.00minutes Average Wait in Queue:0.00minutes Average Number in system:0.90jobs

7 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  What if arrivals are not exactly every 10 minutes?  Let’s open the spreadsheet. Known but Uneven Demand: Example 2

8 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1 A Deterministic System: Example 2

9 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1 A Deterministic System: Example 2 Arrival TimeService Time Interarrival time Throughput timeDeparture Waiting time in Queue

10 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1 A Deterministic System: Example 2

11 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1 Observations: 1. Utilization is below 100% (machine is idle 14% of the time). 2. There are 1.12 orders (on average) waiting to be processed. A Deterministic System: Example 2 Average Interarrival time10.000minutesUtilization86% Average Service time9.000minutes Average Throughput Time11.70minutes Std Service time0.000minutes Average Wait in Queue2.70minutes Thoughput rate0.096 jobs / min Average # in the system1.12jobs Capacity (Service rate)0.111 jobs / min

12 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  Why do we have idleness (low utilization) and at the same time orders are waiting to be processed?  Answer: Variability A Deterministic System: Example 2

13 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  How to measure variability?  Coefficient of variation: CV = Standard Deviation / Mean Known but Uneven Demand: Example 2

14 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  The interarrival time is either 5 periods with probability 0.5 or 15 periods with probability 0.5 Notice that the mean interarrival time is 10. (mean interarrival = 0.5 * * 5 = 10)  The service time is 9 periods (with certainty).  The only difference between example 3 and 1 is that the interarrival times are random. Uncertain Demand (Interarrival times): Example 3

15 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1 Simulation of Uncertain Demand (Inter-arrival times): Example 3 ArrivalStartFinishWaitingIdleness

16 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1 (Recall that in Example 1, no job needed to wait.) Uncertain Demand (Interarrival times): Example 3 Average Interarrival time10.200minutes Average Througput time18.98 Average Service time9.000minutes Average wait in queue9.98 Std Service time0.000minutesAverage # in queue0.98 Thoughput rate0.100 jobs / min Average in the system Capacity (Service rate)0.111 jobs / min

17 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  Suppose we change the previous example and assume: Inter-arrival time170.5 probability Inter-arrival time 30.5 probability Average inter-arrival times as before 10 min. Uncertain Demand (Inter-arrival times): Example 3

18 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1 The effect of variability: higher variability in inter-arrival times results in higher average # in queue. Uncertain Demand (Interarrival times): Example 3 Average Interarrival time10.200minutes Average Througput time27.94 Average Service time9.000minutes Average wait in queue18.94 Std Service time0.000minutesAverage # in queue1.86 Thoughput rate0.100 jobs / min Average in the system Capacity (Service rate)0.111 jobs / min

19 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  Can we manage demand?  What are other sources of variability/uncertainty? Can we reduce demand variability/ uncertainty?

20 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  Up to now, our service time is exactly 9 minutes.  What will happen to waiting-line and waiting-time if we have a short service time (i.e., we have a lower utilization rate)?  What will happen if our service time is longer than 10 minutes? Uncertain Demand (Inter-arrival times)

21 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  The factors that determine the performance of the waiting lines: Variability Utilization rate Risk pooling effect Key Concepts and Issues

22 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  In general, if the variability, or the uncertainty, of the demand (arrival) or service process is large, the queue length and the waiting time are also large. Rule 1

23 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  As the utilization increases the waiting time and the number of orders in the queue increases exponentially. Rule 2

24 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  In general, pooling the demand (customers) into one common line improves the performance of the system. Rule 3

25 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1 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

26 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1 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

27 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1 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

28 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1 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