1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.

Slides:



Advertisements
Similar presentations
Waiting Line Management
Advertisements

Components of the Queuing System
Waiting Line Management
Review of Probability Distributions
Readings Readings Chapter 11, Sections 1, 2, 3, 5 Waiting Line Models.
Waiting Lines Example-1
1 Waiting Lines Also Known as Queuing Theory. 2 Have you ever been to the grocery store and had to wait in line? Or maybe you had to wait at the bank.
D Waiting-Line Models PowerPoint presentation to accompany
© The McGraw-Hill Companies, Inc., Technical Note 6 Waiting Line Management.
Queuing Systems Chapter 17.
Waiting Line Models And Service Improvement
Chapter 13 Queuing Theory
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 Lines Students should be able to:
Waiting Line Analysis OPIM 310-Lecture 3 Instructor: Jose Cruz.
Management of Waiting Lines
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
Waiting lines problems
To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Chapter 16 Waiting Line Models and.
Chapter 18 Management of Waiting Lines
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
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 1 Slide © 2014 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
Chapter 9: Queuing Models
Lecture 14 – Queuing Systems
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.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
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.
Operations Management
Introduction to Management Science
1 1 Slide © 2005 Thomson/South-Western Chapter 12, Part A Waiting Line Models n Structure of a Waiting Line System n Queuing Systems n Queuing System Input.
McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. Service Processes CHAPTER 5.
Waiting Line Models (1) Pertemuan 11 Matakuliah: K0442-Metode Kuantitatif Tahun: 2009.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
4/11: Queuing Models Collect homework, roll call Queuing Theory, Situations Single-Channel Waiting Line System –Distribution of arrivals –Distribution.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
Ch 6 Tech Notes OBJECTIVES
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.
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.
Components of the Queuing System
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.
Waiting Line Models Production and Operations Management Reporter:
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.
Queuing Models.
Topic V. Multiple-Channel Queuing Model
Managerial Decision Making Chapter 13 Queuing Models.
Module D Waiting Line Models.
© 2006 Prentice Hall, Inc.D – 1 Operations Management Module D – Waiting-Line Models © 2006 Prentice Hall, Inc. PowerPoint presentation to accompany Heizer/Render.
Queuing Models Part 1: Basics
Model Antrian Tunggal Pertemuan 20
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
Chapter 11 Waiting Line Models
WAITING LINES AND SIMULATION
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Management of Waiting Lines
Chapter 9: Queuing Models
Solutions Queueing Theory 1
Topic IV. Single Channel Systems (Limited queue length system)
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:

1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University

2 2 Slide © 2009 South-Western, a part of Cengage Learning Chapter 15, Part B Waiting Line Models n Single-Channel Waiting Line Model with Poisson Arrivals and Constant Service Times n Single-Channel Waiting Line Model with Poisson Arrivals and Arbitrary Service Times n Multiple-Channel Waiting Line Model with Poisson Arrivals, Arbitrary Service Times, and No Waiting Line n Waiting Lines with Finite Calling Populations

3 3 Slide © 2009 South-Western, a part of Cengage Learning n M / D /1 queuing system n Single channel n Poisson arrival-rate distribution n Constant service time n Unlimited maximum queue length n Infinite calling population n Examples: Single-booth automatic car wash Single-booth automatic car wash Coffee vending machine Coffee vending machine Single-Channel Waiting Line Model with Poisson Arrivals and Constant Service Times

4 4 Slide © 2009 South-Western, a part of Cengage Learning Example: Ride ‘Em Cowboy! n M / D /1 Queuing System The mechanical pony ride machine at the entrance to a very popular J-Mart store provides 2 minutes of riding for $.50. Children wanting to ride the pony arrive (accompanied of course) according to a Poisson distribution with a mean rate of 15 per hour.

5 5 Slide © 2009 South-Western, a part of Cengage Learning Example: Ride ‘Em Cowboy! n What fraction of the time is the pony idle? = 15 per hour = 15 per hour  = 60/2 = 30 per hour Utilization = /  = 15/30 =.5 Idle fraction = 1 – Utilization = =.5

6 6 Slide © 2009 South-Western, a part of Cengage Learning n What is the average number of children waiting to ride the pony? n What is the average time a child waits for a ride? Example: Ride ‘Em Cowboy! (or 1 minute)

7 7 Slide © 2009 South-Western, a part of Cengage Learning n M / G /1 queuing system n Single channel n Poisson arrival-rate distribution n General or unspecified service time distribution n Unlimited maximum queue length n Infinite calling population Single-Channel Waiting Line Model with Poisson Arrivals and Arbitrary Service Times

8 8 Slide © 2009 South-Western, a part of Cengage Learning Single-Channel Waiting Line Model with Poisson Arrivals and Arbitrary Service Times The Cutler University Student Union has one self The Cutler University Student Union has one self service copying machine. On the average, 12 customers per hour arrive to make copies. (The arrival process follows a Poisson distribution.) The time to copy documents follows approximately a normal distribution with a mean of 2.5 minutes and a standard deviation of 30 seconds.

9 9 Slide © 2009 South-Western, a part of Cengage Learning Single-Channel Waiting Line Model with Poisson Arrivals and Arbitrary Service Times The Union manager has received several The Union manager has received several complaints from students regarding the long lines at the copier. Based of this information, determine: 1) the average number of customers waiting or using the copier. the copier. 2) the probability an arriving customer must wait in line. line. 3) the proportion of time the copier is idle. 4) the average time a customer must wait in line before using the copier. before using the copier.

10 Slide © 2009 South-Western, a part of Cengage Learning This situation can be modeled as an M / G /1 This situation can be modeled as an M / G /1 system with: = 12 per hour = 12/60 =.2/minute = 12 per hour = 12/60 =.2/minute 1/ µ = 2.5 minutes 1/ µ = 2.5 minutes µ = 1/(2.5) =.4 per minute µ = 1/(2.5) =.4 per minute  = 30 seconds =.5 minutes  = 30 seconds =.5 minutes Single-Channel Waiting Line Model with Poisson Arrivals and Arbitrary Service Times

11 Slide © 2009 South-Western, a part of Cengage Learning n Average number of customers waiting or using the copier Substituting the appropriate values gives: Substituting the appropriate values gives: Thus L =.26 + (.2/.4) =.76 customers Thus L =.26 + (.2/.4) =.76 customers where Single-Channel Waiting Line Model with Poisson Arrivals and Arbitrary Service Times

12 Slide © 2009 South-Western, a part of Cengage Learning n Probability an arriving customer must wait in line n Proportion of time the copier is idle n Average time a customer must wait in line before using the copier Single-Channel Waiting Line Model with Poisson Arrivals and Arbitrary Service Times

13 Slide © 2009 South-Western, a part of Cengage Learning n M/G/k Queuing system n Multiple channels n Poisson arrival-rate distribution n Arbitrary service times n No waiting line n Infinite calling population n Example: Telephone system with k lines. (When all k lines are being used, additional callers get a busy signal.) Telephone system with k lines. (When all k lines are being used, additional callers get a busy signal.) Multiple-Channel Waiting Line Model with Poisson Arrivals, Arbitrary Service Times, and No Waiting Line

14 Slide © 2009 South-Western, a part of Cengage Learning Several firms are over-the-counter (OTC) market makers of MegaTech stock. A broker wishing to trade this stock for a client will call on these firms to execute the order. If the market maker's phone line is busy, a broker will immediately try calling another market maker to transact the order. Multiple-Channel Waiting Line Model with Poisson Arrivals, Arbitrary Service Times, and No Waiting Line

15 Slide © 2009 South-Western, a part of Cengage Learning Richardson and Company is one such OTC market maker. It estimates that on the average, a broker will try to call to execute a stock transaction every two minutes. The time required to complete the transaction averages 75 seconds. The firm has four traders staffing its phones. Assume calls arrive according to a Poisson distribution. Multiple-Channel Waiting Line Model with Poisson Arrivals, Arbitrary Service Times, and No Waiting Line

16 Slide © 2009 South-Western, a part of Cengage Learning What percentage of its potential business will be What percentage of its potential business will be lost by Richardson? What percentage of its potential business would What percentage of its potential business would be lost if only three traders staffed its phones? Multiple-Channel Waiting Line Model with Poisson Arrivals, Arbitrary Service Times, and No Waiting Line

17 Slide © 2009 South-Western, a part of Cengage Learning This problem can be modeled as an M / G / k This problem can be modeled as an M / G / k system with block customers cleared with: 1/ = 2 minutes = 2/60 hour 1/ = 2 minutes = 2/60 hour = 60/2 = 30 per hour = 60/2 = 30 per hour 1/ µ = 75 seconds = 75/60 minutes = 75/3600 hours 1/ µ = 75 seconds = 75/60 minutes = 75/3600 hours µ = 3600/75 = 48 per hour µ = 3600/75 = 48 per hour Multiple-Channel Waiting Line Model with Poisson Arrivals, Arbitrary Service Times, and No Waiting Line

18 Slide © 2009 South-Western, a part of Cengage Learning n Percentage of potential business that be lost when using 4 traders ( k = 4) The system will be blocked when there are four customers in the system. Hence, the answer is P 4. Multiple-Channel Waiting Line Model with Poisson Arrivals, Arbitrary Service Times, and No Waiting Line continued

19 Slide © 2009 South-Western, a part of Cengage Learning n Percentage of potential business that be lost when using 4 traders ( k = 4) Now, Now, Thus, with four traders 0.3% of the potential customers are lost. Multiple-Channel Waiting Line Model with Poisson Arrivals, Arbitrary Service Times, and No Waiting Line

20 Slide © 2009 South-Western, a part of Cengage Learning n Percentage of potential business that be lost when using 3 traders ( k = 3) The system will be blocked when there are three customers in the system. Hence, the answer is P 3. Thus, with three traders 2.2% of the potential customers are lost. Multiple-Channel Waiting Line Model with Poisson Arrivals, Arbitrary Service Times, and No Waiting Line

21 Slide © 2009 South-Western, a part of Cengage Learning Biff Smith is in charge of maintenance for four of Biff Smith is in charge of maintenance for four of the rides at the Rollerama Amusement Park. On the average, each ride operates four hours before needing repair. When repair is needed, the average repair time is 10 minutes. Assuming the time between machine repairs as Assuming the time between machine repairs as well as the service times follow exponential distributions, determine: 1) the proportion of time Biff is idle, and 2) the average time a ride is "down" for repairs. Waiting Lines with Finite Calling Populations

22 Slide © 2009 South-Western, a part of Cengage Learning This problem can be modeled as an This problem can be modeled as an M / M /1 queue with a finite calling population of size N = 4 (rides). = 1/(4 hours) =.25 per hour = 1/(4 hours) =.25 per hour µ = 60/(10 minutes) = 6 per hour µ = 60/(10 minutes) = 6 per hour  /  =.25/6 = 1/24 Waiting Lines with Finite Calling Populations

23 Slide © 2009 South-Western, a part of Cengage Learning Waiting Lines with Finite Calling Populations n Proportion of time Biff is idle Hence, Biff is idle approximately 84% of the time. Hence, Biff is idle approximately 84% of the time.

24 Slide © 2009 South-Western, a part of Cengage Learning Waiting Lines with Finite Calling Populations n Average time a ride is "down" for repairs where

25 Slide © 2009 South-Western, a part of Cengage Learning Waiting Lines with Finite Calling Populations n Average time a ride is "down" for repairs Substituting the appropriate values gives: Substituting the appropriate values gives: L q = 4 - ((.25+6)/.25)( ) = L q = 4 - ((.25+6)/.25)( ) = L = ( ) =.1798 L = ( ) =.1798 W q = /(( ).25) = W q = /(( ).25) = W = /6 = hours or 11.3 minutes W = /6 = hours or 11.3 minutes

26 Slide © 2009 South-Western, a part of Cengage Learning End of Chapter 15, Part B