D-1 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J. 07458 Operations Management Waiting-Line Models Module D.

Slides:



Advertisements
Similar presentations
Waiting Line Management
Advertisements

Components of the Queuing System
Model Antrian (Waiting Line Models ) Pertemuan 18:
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
© The McGraw-Hill Companies, Inc., 1998 Irwin/McGraw-Hill 2 Chapter 7 TN Waiting Line Management u Waiting line characteristics u Some waiting line management.
QMD: Waiting-line analysis
D Waiting-Line Models PowerPoint presentation to accompany
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
© The McGraw-Hill Companies, Inc., Technical Note 6 Waiting Line Management.
Waiting Line Models And Service Improvement
D – 1 Operations Management Module D – Waiting-Line Models © 2006 Prentice Hall, Inc. PowerPoint presentation to accompany Heizer/Render Principles of.
Queues / Lines You manage a call center which can answer an average of 20 calls an hour. Your call center gets 17.5 calls in an average hour. On average.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
Waiting Line Management
Waiting Lines Students should be able to:
Management of Waiting Lines
© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-1 Operations Management Simulation Module F.
Queuing. Elements of Waiting Lines  Population –Source of customers Infinite or finite.
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.
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
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.
Chapter 9: Queuing Models
Queuing Models and Capacity Planning
© 2008 Prentice Hall, Inc.D – 1 Operations Management Module D – Waiting-Line Models PowerPoint presentation to accompany Heizer/Render Principles of Operations.
D Waiting-Line Models PowerPoint presentation to accompany
Spreadsheet Modeling & Decision Analysis
Operations Management
Operations Management
Queueing Theory Models Training Presentation By: Seth Randall.
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.
Advanced Waiting Line Theory and Simulation Modeling Chapter 6 - Supplement.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
4/11: Queuing Models Collect homework, roll call Queuing Theory, Situations Single-Channel Waiting Line System –Distribution of arrivals –Distribution.
Queuing Models. © 2002 Prentice-Hall, IncCh 9-2 Stay in Queue: Short Video &feature=related
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 18 Management of Management of Waiting Lines.
Waiting Line and Queuing Theory Kusdhianto Setiawan Gadjah Mada University.
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.
1-1 McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved 1 Chapter 8A Waiting Line Management.
Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.
1 Queuing Systems (2). Queueing Models (Henry C. Co)2 Queuing Analysis Cost of service capacity Cost of customers waiting Cost Service capacity Total.
Components of the Queuing System
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.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Structure of a Waiting Line System Queuing theory is the study of waiting lines Four characteristics of a queuing system: –The manner in which customers.
Waiting Line Theory Akhid Yulianto, SE, MSc (log).
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.
Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
Queuing Models.
OPERATIONS MANAGEMENT INTEGRATING MANUFACTURING AND SERVICES FIFTH EDITION Mark M. Davis Janelle Heineke Copyright ©2005, The McGraw-Hill Companies, Inc.
Simple Queueing Theory: Page 5.1 CPE Systems Modelling & Simulation Techniques Topic 5: Simple Queueing Theory  Queueing Models  Kendall notation.
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.
D - 1© 2011 Pearson Education, Inc. publishing as Prentice Hall D D Waiting-Line Models PowerPoint presentation to accompany Heizer and Render Operations.
© 2006 Prentice Hall, Inc.D – 1 Operations Management Module D – Waiting-Line Models © 2006 Prentice Hall, Inc. PowerPoint presentation to accompany Heizer/Render.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
WAITING LINES AND SIMULATION
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Management of Waiting Lines
Chapter 9: Queuing Models
Queuing Systems Don Sutton.
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:

D-1 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Operations Management Waiting-Line Models Module D

D-2 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J You manage a call center which can answer an average of 20 calls per hour. Your call center gets 17.5 calls in an average hour. On average, what is the time a customer spends on hold waiting for service? a) on average, customers should not have to wait on hold since capacity is greater than demand. b) average customer wait will be less than 10 minutes. c) average customer wait will be between 10 and 20 minutes. d) average customer wait will be greater than 20 minutes. e) who knows? There’s no way to tell. Queues / Lines © 1995 Corel Corp.

D-3 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Two ways to address waiting lines  Queuing theory  Certain types of lines can be described mathematically  Requires that assumptions are valid for your situation  Systems with multiple lines that feed each other are too complex for queuing theory  Simulation  Building mathematical models that attempt to act like real operating systems  Real-world situations can be studied without imposing on the actual system

D-4 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Why do we have to wait? © 1995 Corel Corp. Why do services (and most non-MTS manufacturers) have queues?  Processing time and/or arrival time variance  Costs of capacity – can we afford to always have more people/servers than customers?  Efficiency – e.g. scheduling at the Doctor’s office

D-5 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Waiting Costs and Service Costs Total expected cost Cost of waiting time Cost Low level of service Optimal service level High level of service Minimum total cost Cost of providing service

D-6 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Costs of Queues Too Little Queue Too Much Queue Cost of capacity Wasted capacity Annoyed customers Lost customers Space Possible opportunity: e.g. wait in the bar for a restaurant table

D-7 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J BankCustomersTellerDeposit, etc. Doctor’sPatientDoctorTreatment office Traffic CarsLightControlled intersection passage Assembly linePartsWorkersAssembly 1–800 softwareUser call-insTech supportTechnical support support personnel Situation Arrivals ServersService Process Waiting Line Examples

D-8 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Service Facility Population  Pattern of arrivals  Scheduled  Random – estimated by Poisson distribution Arrival Characteristics Characteristics of a Waiting Line System  Size of the source population  Limited  Unlimited  Behavior of arrivals  Join the queue, wait until served  Balk – refuse to join the line  Renege – leave the line Waiting Line = average arrival rate

D-9 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Poisson Distributions for Arrival Rates =2 = x Probability x Probability = average arrival rate

D-10 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Service Facility Waiting Line Population Waiting Line Characteristics  Length of the queue  Limited  Unlimited  Queue discipline  FIFO  Other Characteristics of a Waiting Line System

D-11 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Service Facility Waiting Line Population Service Characteristics  Number of channels  Single  Multiple  Number of phases in service system  Single  Multiple  Service time distribution  Constant  Random – estimated by negative exponential distribution Characteristics of a Waiting Line System  = average service rate

D-12 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Negative Exponential Distribution Average Service Rate (  ) = 3 customers per hour Average Service Time = 20 minutes per customer Average Service Rate (  ) = 1 customer per hour Probability that Service Time is greater than t=e -  t, for t > 0 Time t in Hours Probability that Service Time  t Average Service Rate (  ) = 3 customers per hour Average Service Time = 20 minutes per customer Average Service Rate (  ) = 1 customer per hour Probability that Service Time is greater than t = e for t > 0 –t–t

D-13 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Basic Queuing System Designs Arrivals Served units Service facility Queue Single-Channel, Single-Phase Service facility Arrivals Served units Service facility Queue Service facility Multi-Channel, Multi-Phase Arrivals Served units Service facility Queue Service facility Multi-Channel, Single-Phase e.g. U.S. Post Office e.g. drive-through bank e.g. Suds & Suds Laundromat Arrivals Served units Service facility Queue Service facility Single-Channel, Multi-Phase e.g. McDonald’s drive-through

D-14 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J You manage a call center which can answer an average of 20 calls per hour. Your call center gets 17.5 calls in an average hour. On average, what is the time a customer spends on hold waiting for service? Call Center – Solution (1) = average arrival rate = 17.5 calls/hr  = average service rate = 20 calls/hr ρ = average utilization of system = /  = 87.5%

D-15 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J You manage a call center which can answer an average of 20 calls per hour. Your call center gets 17.5 calls in an average hour. On average, what is the time a customer spends on hold waiting for service? Call Center – Solution (2) = average arrival rate = 17.5 calls/hr  = average service rate = 20 calls/hr ρ = average utilization of system = /  = 87.5% L = average number of customers in service system (line and being served) = / (  - ) = 7 calls L q = average number waiting in line = ρL = calls

D-16 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J You manage a call center which can answer an average of 20 calls per hour. Your call center gets 17.5 calls in an average hour. On average, what is the time a customer spends on hold waiting for service? Call Center – Solution (3) = average arrival rate = 17.5 calls/hr  = average service rate = 20 calls/hr ρ = average utilization of system = /  = 87.5% W = average time in system (wait and service) = 1 / (  - ) =.4 hr = 24 min W q = average time waiting = ρW = 21 min

D-17 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Single server equations = average arrival rate  = average service rate ρ = average utilization of system = /  P n = probability that n customers are in the system = (1- ρ) ρ n L = average number of customers in service system (line and being served) = / (  - ) L q = average number waiting in line = ρL W = average time in system (wait and service) = 1/ (  - ) W q = average time waiting = ρW

D-18 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J  You are opening an ice cream stand that has a single employee (you). You expect to see about 25 customers an hour. It takes you an average of 2 minutes to serve each customer. Customers are served in a FCFS manner.  Your research suggests that if there is a line of more than 4 people that some customers will leave without buying anything. In addition, if customers have to wait more than 6 minutes to get their order filled they are not likely to come back.  How well will this system do at satisfying customers?  What assumptions are you making to answer this question? Izzy’s Ice Cream Stand

D-19 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Izzy’s Ice Cream Stand (2) = 25 customers/hr  = 30 customers/hr ρ = /  =.833 P n = probability that n customers are in the system = (1- ρ) ρ n P 0 = (1 –.833) x.833 = P 1 = (1 –.833) x.833 = P 2 = (1 –.833) x.833 = P 3 = (1 –.833) x.833 = P 4 = (1 –.833) x.833 = P more than 4 = 1 –.599 = cumulative L = / (  - ) = 5 customers Customers in the system

D-20 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Izzy’s Ice Cream Stand (3) = 25 customers/hr  = 30 customers/hr ρ = /  =.833 L = / (  - ) = 25 / (30 – 25) = 5 customers L q = ρL =.833 x 5 = 4.17 customers W = 1 / (  - ) = 1 / (30 – 25) =.2 hr = 12 min W q = ρW =.833 x 12 min = 10 min Why not L – 1 ?

D-21 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Why do we have to wait? © 1995 Corel Corp. Why do services (and most non-MTS manufacturers) have queues?  Processing time and/or arrival time variance  Costs of capacity – can we afford to always have more people/servers than customers?  Efficiency – e.g. scheduling at the Doctor’s office

D-22 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J x Time t Probability that Service Time  t Probability ARRIVALS (Poisson) SERVICE (Exponential) CUSTOMERS IN THE SYSTEM Probability n