Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Capacity Planning and Queuing Models.

Slides:



Advertisements
Similar presentations
Part 3 Probabilistic Decision Models
Advertisements

Waiting Line Management
Capacity Planning and Queuing Models
Operations Management
Capacity Planning and Queuing Models
QUEUING MODELS Based on slides for Hilier, Hiller, and Lieberman, Introduction to Management Science, Irwin McGraw-Hill.
S. Chopra/Operations/Managing Services1 Operations Management: Capacity Management in Services Module u Why do queues build up? u Process attributes and.
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.
Queuing Systems Chapter 17.
Multiple server queues In particular, we look at M/M/k Need to find steady state probabilities.
Waiting Line Models And Service Improvement
Waiting Lines Students should be able to:
Waiting Line Analysis OPIM 310-Lecture 3 Instructor: Jose Cruz.
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),
Management of Waiting Lines
14-1. Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 14 Capacity Planning and Queuing Models.
To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Chapter 16 Waiting Line Models and.
OM&PM/Class 6b1 1Operations Strategy 2Process Analysis 3Lean Operations 4Supply Chain Management 5Capacity Management in Services –Class 6b: Capacity Analysis.
Waiting line Models.
Chapter 18 Management of Waiting Lines
Management of Waiting Lines
19-1 McGraw-Hill Ryerson Operations Management, 2 nd Canadian Edition, by Stevenson & Hojati Copyright © 2004 by The McGraw-Hill Companies, Inc. All rights.
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Seventh Edition © 2004 Prentice Hall, Inc. All rights reserved. Waiting.
Chapter 9: Queuing Models
WAITING LINES The study of waiting lines, called queuing theory, is one of the most widely used and oldest management science techniques. The three basic.
Spreadsheet Modeling & Decision Analysis
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.
Introduction to Management Science
McGraw-Hill/Irwin © 2003 The McGraw-Hill Companies, Inc., All Rights Reserved. Waiting Line Models.
Queueing Theory Models Training Presentation By: Seth Randall.
ISM 270 Service Engineering and Management Lecture 7: Forecasting and Managing Service Capacity.
McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. Service Processes CHAPTER 5.
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Supplement D Waiting Line Models Operations Management by R. Dan Reid & Nada R. Sanders 3rd Edition © Wiley 2005 PowerPoint Presentation by Roger B. Grinde,
1 Queuing Analysis Overview What is queuing analysis? - to study how people behave in waiting in line so that we could provide a solution with minimizing.
Ch 6 Tech Notes OBJECTIVES
Supplement C Waiting Line Models Operations Management by R. Dan Reid & Nada R. Sanders 4th Edition © Wiley 2010.
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.
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.
 One or more ‘customers’ waiting for a service.  ‘Customer’ can be: › People e.g. A person waiting in line to deposit cash in a bank. › Objects e.g.
1-1 McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved 1 Chapter 8A Waiting Line Management.
Queueing Theory What is a queue? Examples of queues: Grocery store checkout Fast food (McDonalds – vs- Wendy’s) Hospital Emergency rooms Machines waiting.
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.
Chapter 16 Capacity Planning and Queuing Models
Supplement D Waiting Line Models
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
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.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
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.
Adeyl Khan, Faculty, BBA, NSU Elements of Queuing System ArrivalsServiceWaiting line Exit Processing order System.
Example 14.3 Queuing | 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | Background Information n County Bank has several.
Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
Queuing Models.
Managerial Decision Making Chapter 13 Queuing Models.
Module D Waiting Line Models.
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.
WAITING LINES AND SIMULATION
Queuing Models Economic Analyses.
Management of Waiting Lines
Solutions Queueing Theory 1
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
Queuing Models and Capacity Planning
Waiting Line Models Waiting takes place in virtually every productive process or service. Since the time spent by people and things waiting in line is.
Presentation transcript:

Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Capacity Planning and Queuing Models

Capacity Planning Challenges  Inability to create a steady flow of demand to fully utilize capacity  Idle capacity always a reality for services.  Customer arrivals fluctuate and service demands also vary.  Customers are participants in the service and the level of congestion impacts on perceived quality.  Inability to control demand results in capacity measured in terms of inputs (e.g. number of hotel rooms rather than guest nights).

Strategic Role of Capacity Decisions  Using long range capacity as a preemptive strike where market is too small for two competitors (e.g. building a luxury hotel in a mid-sized city)  Lack of short-term capacity planning can generate customers for competition (e.g. restaurant staffing)  Capacity decisions balance costs of lost sales due to inadequate capacity against operating losses due to inadequate demand.  Strategy of building ahead of demand is often taken to avoid losing customers.

Queuing System Cost Tradeoff

Single Server Model with Poisson Arrival and Service Rates: M/M/1 1. Mean arrival rate: 2. Mean service rate: 3. Mean number in service: 4. Probability of exactly “n” customers in the system: 5. Probability of “k” or more customers in the system: 6. Mean number of customers in the system: 7. Mean number of customers in queue: 8. Mean time in system: 9. Mean time in queue: Queuing Formulas

Single Server General Service Distribution Model: M/G/1 Mean number of customers in queue for two servers: M/M/2 Relationships among system characteristics: Queuing Formulas (cont.)

With: Then: Congestion as  1.0

On average 2 customers arrive per hour at a Foto-Mat to process film. There is one clerk in attendance that on average spends 15 minutes per customer. 1.What is the average queue length and average number of customers in the system? 2.What is the average waiting time in queue and average time spent in the system? 3.What is the probability of having 2 or more customers waiting in queue? 4.If the clerk is paid $4 per hour and a customer’s waiting cost in queue is considered $6 per hour. What is the total system cost per hour? 5. What would be the total system cost per hour, if a second clerk were added and a single queue were used? Foto-Mat Queuing Analysis

White & Sons wholesale fruit distributions employ a single crew whose job is to unload fruit from farmer’s trucks. Trucks arrive at the unloading dock at an average rate of 5 per hour Poisson distributed. The crew is able to unload a truck in approximately 10 minutes with exponential distribution. 1.On the average, how many trucks are waiting in the queue to be unloaded? 2.The management has received complaints that waiting trucks have blocked the alley to the business next door. If there is room for 2 trucks at the loading dock before the alley is blocked, how often will this problem arise? 3.What is the probability that an arriving truck will find space available at the unloading dock and not block the alley? White & Sons Queuing Analysis

A production line is dependent upon the use of assembly robots that periodically break down and require service. The average time between breakdowns is three days with a Poisson arrival rate. The average time to repair a robot is two days with exponential distribution. One mechanic repairs the robots in the order in which they fail. 1.What is the average number of robots out of service? 2. If management wants 95% assurance that robots out of service will not cause the production line to shut down due to lack of working robots, how many spare robots need to be purchased? 3.Management is considering a preventive maintenance (PM) program at a daily cost of $100 which will extend the average breakdowns to six days. Would you recommend this program if the cost of having a robot out of service is $500 per day? Assume PM is accomplished while the robots are in service. 4.If mechanics are paid $100 per day and the PM program is in effect, should another mechanic be hired? Consider daily cost of mechanics and idle robots. Capacity Analysis of Robot Maintenance and Repair Service

1. Assume mechanics work together as a team Mechanics $100 M $500 Ls Total system in Crew (M) Mechanic cost Robot idleness Cost per day 100(1)=$ (1/2)=$250 $ (2)=$ (1/5)=$100 $ (3)=$ (1/8)=$62 $ / /2 Determining Number of Mechanics to Serve Robot Line

2. Assume Robots divided equally among mechanics working alone Identical $100 n $500 Ls (n) Total System Queues (n) Mechanic Robot idleness Cost per day cost 1 1/ 6 $100 $250 $ / 12 $ (1/5) 2=$200 $400 Determining Number of Mechanics to Serve Robot Line

3. Assume two mechanics work alone from a single queue. Note: = = 0.34 Total Cost/day = 100(2) + 500(.34) = =$370 Determining Number of Mechanics to Serve Robot Line

System Single Queue with Team Service 6/ 5 =1.2 days 0.2 days Single Queue with Multiple 6 (.34) = 2.06 days 0.06 days Servers Multiple Queue and Multiple 12 (1/5) =2.4 days 0.4 days Servers Comparisons of System Performance for Two Mechanics

1. For Exponential Distribution: 2. For Constant Service Time: 3. Conclusion: Congestion measured by L q is accounted for equally by variability in arrivals and service times. Single Server General Service Distribution Model: M/G/1

1.Variability in arrivals and service times contribute equally to congestion as measured by L q. 2.Service capacity must exceed demand. 3.Servers must be idle some of the time. 4.Single queue preferred to multiple queue unless jockeying is permitted. 5.Large single server (team) preferred to multiple-servers if minimizing mean time in system, W S. 6.Multiple-servers preferred to single large server (team) if minimizing mean time in queue, W Q. General Queuing Observations

L q for Various Values of C and 