MGTSC 352 Lecture 23: Congestion Management Introduction: Asgard Bank example Simulating a queue Types of congested systems, queueing template Ride’n’Collide.

Slides:



Advertisements
Similar presentations
Waiting Line Management
Advertisements

Module C8 Queuing Economic/Cost Models. ECONOMIC ANALYSES Each problem is different Examples –To determine the minimum number of servers to meet some.
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,
Q vs Await Node Q is a simplified Await node Q activity is the resource ie server, inspection Await Node can specify resource that is needed by activity.
INDR 343 Problem Session
QUEUING MODELS Based on slides for Hilier, Hiller, and Lieberman, Introduction to Management Science, Irwin McGraw-Hill.
Queuing Models M/M/k Systems. CLASSIFICATION OF QUEUING SYSTEMS Recall that queues are classified by (Arrival Dist.)/(Service Dist.)/(# servers) Designations.
OPSM 405 Service Management Class 19: Managing waiting time: Queuing Theory Koç University Zeynep Aksin
Queuing Models Basic Concepts
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.
Waiting Lines and Queuing Theory Models
Queuing Models Economic Analyses. ECONOMIC ANALYSES Each problem is different Examples –To determine the minimum number of servers to meet some service.
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.
Waiting Line Models And Service Improvement
Chapter 13 Queuing Theory
Other Markovian Systems
Queueing Theory Chapter 17.
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),
14-1. Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 14 Capacity Planning and Queuing Models.
Module C10 Simulation of Inventory/Queuing Models.
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
To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Chapter 16 Waiting Line Models and.
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.
Operations Management Waiting-Line Models Module D
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:
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.
Lecture 14 – Queuing Systems
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
___________________________________________________________________________ Operations Research  Jan Fábry Waiting Line Models.
OPSM 301: Operations Management
Spreadsheet Modeling & Decision Analysis
Introduction to Management Science
Waiting Line Models ___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry.
4/11: Queuing Models Collect homework, roll call Queuing Theory, Situations Single-Channel Waiting Line System –Distribution of arrivals –Distribution.
1 Slides used in class may be different from slides in student pack Chapter 5 Process Analysis  Process Analysis  Process Flowcharting  Categories of.
M/M/1 queue λn = λ, (n >=0); μn = μ (n>=1) λ μ λ: arrival rate
1 Queuing Systems (2). Queueing Models (Henry C. Co)2 Queuing Analysis Cost of service capacity Cost of customers waiting Cost Service capacity Total.
OMG Operations Management Spring 1997 CLASS 4: THE IMPACT OF VARIABILITY Harry Groenevelt.
Queueing Theory Dr. Ron Lembke Operations Management.
Machine interference problem: introduction
1 ISE 195 Introduction to Industrial & Systems Engineering.
MGTSC 352 Lecture 25: Congestion Management MEC example Manufacturing example.
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.
Waiting Lines and Queuing Theory Models
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.
Waiting Line Models Production and Operations Management Reporter:
Introduction Definition M/M queues M/M/1 M/M/S M/M/infinity M/M/S/K.
SIMULATION EXAMPLES. Monte-Carlo (Static) Simulation Estimating profit on a sale promotion Estimating profit on a sale promotion Estimating profit on.
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
© 2015 McGraw-Hill Education. All rights reserved. Chapter 17 Queueing Theory.
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.
Simple Queueing Theory: Page 5.1 CPE Systems Modelling & Simulation Techniques Topic 5: Simple Queueing Theory  Queueing Models  Kendall notation.
1 BIS 3106: Business Process Management (BPM) Lecture Nine: Quantitative Process Analysis (2) Makerere University School of Computing and Informatics Technology.
Managerial Decision Making Chapter 13 Queuing Models.
Module D Waiting Line Models.
Queuing Models Economic Analyses.
Solutions Queueing Theory 1
Variability 8/24/04 Paul A. Jensen
Solutions Queueing Theory 1
Solutions Queueing Theory 1
Presentation transcript:

MGTSC 352 Lecture 23: Congestion Management Introduction: Asgard Bank example Simulating a queue Types of congested systems, queueing template Ride’n’Collide example MEC example Manufacturing example

Analyzing a Congested System (pg. 174)  System Description Measures of Quality of Service Measures important to Servers Model of the System Inputs Outputs

Asgard Bank: Times Between Arrivals (pg. 173) pg. 168

Asgard Bank: Service Times

Including Randomness: Simulation Service times: Normal distribution, mean = 57/3600 hrs, stdev = 10/3600 hrs. MAX(NORMINV(RAND(),57/3600,10/3600),0) Inter-arrival times: Exponential distribution, mean = 1/ 60 hrs. – (1/60)*LN(RAND()) To Excel …

Simulated Lunch Hour 1: 71 arrivals

Simulated Lunch Hour 2: 50 arrivals

Simulated Lunch Hour 3: Unused capacity

Causes of Congestion Higher than average number of arrivals Lower than average service capacity Lost capacity due to timing Lesson: For a service where customers arrive randomly, it is not a good idea to operate the system close to its average capacity

Template.xls Does calculations for –M/M/s –M/M/s/s+C –M/M/s/  /M –M/G/1 Want to know more? Go to Asgard Bank Data –Model: M/G/1 –Arrival rate: 1 per minute –Average service time: 57/60 min. –St. dev of service time: 10/60 min.

Asgard Conclusions The ATM is busy 95% of the time. Average queue length = 9.3 people Average no. in the system = (waiting, or using the ATM) Average wait = 9.3 minutes What if the service rate changes to … –1.05 / min.? –1.06 / min.?

Ride’n’Collide (pg. 178) Repair personnel cost: $10 per hour Average repair duration: 30 minutes Lost income: $50 per hour per car Number of cars: 20 cars A car will function for 10 hours on average from the time it has been fixed until the next time it needs to be repaired. How many repair-people should be hired?

Ride’n’Collide Customers = Servers = Average number in system = Lost revenue per hour = Arrival rate = Service rate = Model to use:

Waiting Line Analysis Template: Which Model to Use? Who are the customers? Who are the servers? Where is the queue? … not always obvious

If you are told how many customers there are … then you should consider using the “finite population” template waiting room = queue potential customers parallel servers Number is small enough to worry about

If you are told the maximum number of customers that can wait (the size of the waiting room) … then you should consider using the “finite Q” template waiting room = queue potential customers parallel servers Capacity is small enough to worry about

If you are told the standard deviation of the service times, and there is 1 server … then you should consider using the “MG1” template waiting room = queue potential customers one server, non- exponential service time distribution

If you are told nothing about the size of the pool of potential customers, or the maximum number that will wait, or the standard deviation of the service times, … then you should probably use the “MMs” template

MEC (p. 181) One operator, two lines to take orders –Average call duration: 4 minutes exp –Average call rate: 10 calls per hour exp –Average profit from call: $24.76 Third call gets busy signal How many lines/agents? –Line cost: $4.00/ hr –Agent cost: $12.00/hr –Avg. time on hold < 1 min.

Modeling Approaches Simulation Waiting line analysis template We’ll use both for this example To Excel …

Manufacturing Example (p. 184) Machine (1.2 or 1.8/minute) 1/minute Poisson arrivals Exponential service times

Manufacturing Example Arrival rate for jobs: 1 per minute Machine 1: –Processing rate: 1.20/minute –Cost: $1.20/minute Machine 2: –Processing rate: 1.80/minute –Cost: $2.00/minute Cost of idle jobs: $2.50/minute Which machine should be chosen? To Excel …

Manufacturing Example Cost of machine 1 = $1.20 / min. + ($2.50 / min. / job)  (5.00 jobs) = $13.70 / min. Cost of machine 2 = $2.00 / min. + ($2.50 / min. / job)  (1.25 jobs) = $5.13 / min.  Switching to machine 2 saves money – reduction in lost revenue outweighs higher operating cost.

Cost of waiting (Mach. 1) Method 1: –Unit cost × L = ($2.50 / min. job)  (5.00 jobs) = $13.70 / min Method 2: –Unit cost × × W  = ($2.50 / min. job)  (5.00 min)  (1 job/min) = $13.70 / min Little’s LawL = × W