Readings Readings Chapter 11, Sections 1, 2, 3, 5 Waiting Line Models.

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.
BA 452 Lesson C.2 Waiting Line Simulation 1 ReadingsReadings Chapter 12 Simulation.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Where is There Waiting? Service Facility –Fast-food restaurants –Post office –Grocery store.
INDR 343 Problem Session
Review of Probability Distributions
QUEUING MODELS Based on slides for Hilier, Hiller, and Lieberman, Introduction to Management Science, Irwin McGraw-Hill.
Waiting Lines Example-1
Operations research Quiz.
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
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
Waiting Lines and Queuing Theory Models
HW # Due Day: Nov 23.
Queuing Models Economic Analyses. ECONOMIC ANALYSES Each problem is different Examples –To determine the minimum number of servers to meet some service.
© The McGraw-Hill Companies, Inc., Technical Note 6 Waiting Line Management.
Queuing Systems Chapter 17.
Waiting Line Models And Service Improvement
Waiting Line Analysis OPIM 310-Lecture 3 Instructor: Jose Cruz.
Management of Waiting Lines
To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Chapter 16 Waiting Line Models and.
Waiting line Models.
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
HW # Due Day: Nov 23.
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 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
MNG221 - Management Science –
___________________________________________________________________________ Operations Research  Jan Fábry Waiting Line Models.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
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
Waiting Line Models ___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry.
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.
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
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.
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.
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
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.
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
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.
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.
Queueing Theory/Waiting Line: Models and Analysis Navneet Vidyarthi
Abu Bashar Queuing Theory. What is queuing ?? Queues or waiting lines arise when the demand for a service facility exceeds the capacity of that facility,
Topic V. Multiple-Channel Queuing Model
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.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
Chapter 11 Waiting Line Models
Queuing Models Economic Analyses.
Management of Waiting Lines
Chapter 5 Designing Services.
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:

Readings Readings Chapter 11, Sections 1, 2, 3, 5 Waiting Line Models

Overview Overview

Overview Analytical Formulas for Multiple Channels for operating characteristics have been derived, under the queue discipline first-come, first-served, for several queuing models with multiple channels. M/M/2 Queuing System designates M = Markov (memoryless) arrival distribution (Poisson), M = Markov service-time distribution (exponential), and 2 service channels, under first-come, first-served. Economic Analysis of waiting lines maximizes profit for a firm by maximizing value for customers. Maximizing customer value trades off quick service with low purchase prices (resulting from lower costs). Economic Analysis with Teamwork maximizes firm’s profits and customer’s value by trading off having more service channels with teams providing faster service in each channel.

Overview Tool Summary Use analytical formulas or Management Scientist to compute performance: Probability that no units are in the system: P0 Average number of units in waiting line: Lq Average number of units in system: L = Lq + l/m Average time a unit spends in waiting line: Wq = Lq/l Average time a unit spends in the system: W = Wq + 1/m Probability that an arriving unit has to wait for service: Pw Probability of n units in the system: Pn Compute total hourly cost for units in the system = ($ waiting cost per hour) x (Average number of units in system) Note average number of units in system is the only right choice above; average time in waiting line does not count the number of units.

Analytical Formulas for Multiple Channels

Multiple channels (with one central waiting line) Analytical Formulas for Multiple Channels Overview Analytical Formulas for Multiple Channels, for M/M/k under FCFS require assumptions, some of which are not 100% realistic: Multiple channels (with one central waiting line) Poisson arrival-rate distribution Exponential service-time distribution Unlimited maximum queue (waiting line) length Examples: Four-teller transaction counter in bank Two-clerk returns counter in retail store

Probability that no units are in the system: Analytical Formulas for Multiple Channels Probability that no units are in the system: Average number of units in waiting line: Average number of units in system: L = Lq + l/m Average time a unit spends in waiting line: Wq = Lq/l Average time a unit spends in the system: W = Wq + 1/m

Probability of n units in the system: [ (l/m)n /n! ] P0 for n < k Analytical Formulas for Multiple Channels 6) Probability that an arriving unit has to wait for service: Pw = (1/k!) (l/m)k (km/(km-l)) P0 Probability of n units in the system: [ (l/m)n /n! ] P0 for n < k Pn = [ (l/m)n /(k! k(n-k)) ] P0 for n > k

M/M/2 Queuing System M/M/2 Queuing System

M/M/2 Queuing System Overview M/M/2 Queuing System designates M = Markov (memoryless) arrival distribution (exponential), M = Markov service-time distribution (Poisson), and 2 service channels, under first-come, first-served.

M/M/2 Queuing System Question: Smith, Jones, Johnson, and Thomas, Inc. has begun a major advertising campaign which it believes will increase its business 50%. To handle the increased volume, the company has hired an additional floor trader, Fred Hanson, who works at the same speed as Joe Ferris. Note that the new arrival rate of orders, l, is 50% higher than that of Example 1 in Lesson 2.5. Thus, l = 1.5(20) = 30 per hour.

Sufficient Service Rate M/M/2 Queuing System M/M/1: P0 = 1-l/m Lq = l2/(m(m-l)) L = Lq + l/m Wq = Lq/l W = 1/(m-l) Pw = l/m Pn = (l/m)nP0 Sufficient Service Rate Will Joe Ferris alone be able to handle the increase in orders? Answer: Since Joe Ferris processes orders at a mean rate of µ = 30 per hour, then  = µ = 30 and the average time a unit spends in the system is W = 1/(m-l) = 1/0 = infinity. That implies the queue of orders will grow infinitely large. Hence, Joe alone cannot handle that increase in demand.

Probability of n Units in System M/M/2 Queuing System Probability of n Units in System What is the probability that neither Joe nor Fred will be working on an order at any point in time? Answer: This is an M/M/k queue with  = 30 per hour,  = 30 per hour, and k = 2. The probability that neither Joe nor Fred will be working = the probability of no units in the system. Analytical Formula #1 says that is: = 1/[(1 + (1/1!)(30/30)1] + [(1/2!)(1)2][2(30)/(2(30)-30)] = 1/(1 + 1 + 1) = 1/3 = .333

and L = Lq + ( /µ) = 1/3 + (30/30) = 4/3. Finally, M/M/2 Queuing System Average Time in System What is the average turnaround time for an order with both Joe and Fred working? Answer: The average turnaround time = the average time a unit spends in the system, W. Analytical Formula #2 and 3 say and L = Lq + ( /µ) = 1/3 + (30/30) = 4/3. Finally, W = L/(4/3)/30 = 4/90 hr. = 2.67 min.

Average length of queue M/M/2 Queuing System Average length of queue What is the average number of orders waiting to be filled with both Joe and Fred working? Answer: The average number of orders waiting to be filled = the average number of units in the waiting line, Lq. That was calculated earlier as 1/3.

M/M/2 Queuing System

M/M/2 Queuing System

Economic Analysis Economic Analysis

Economic Analysis Overview Economic Analysis of waiting lines maximizes profit for a firm by maximizing value for customers. Maximizing customer value trades off quick service with low purchase prices (resulting from the lower costs of having fewer or less qualified employees). Wealthy customers (like at Malibu Yogurt) prefer quick service, even if that means higher purchase prices to pay for more or better employees, but poor customers (like at Popeye's Chicken in Oxnard) prefer lower purchase prices, even if that means slower service from fewer or incompetent employees.

Economic Analysis Question: The advertising campaign of Smith, Jones, Johnson and Thomas, Inc. was so successful that business doubled. The mean rate of stock orders arriving at the exchange is now 40 per hour and the company must decide how many floor traders to employ. Each floor trader hired can process an order in an average time of 2 minutes. (So far,  = 40/hr. and m = 30/hr.)

Answer: Total hourly cost = (Total salary cost per hour) Economic Analysis The brokerage firm has determined the average waiting cost per minute for an order to be $.50. (So, you can charge $.50 more per order if you can process it an average of 1 minute faster.) Floor traders hired will earn $20 per hour in wages and benefits. Hence, compare the total hourly cost of hiring 2 traders with that of hiring 3 traders. Answer: Total hourly cost = (Total salary cost per hour) + (Total hourly cost for orders in the system) = ($20 per trader per hour) x (Number of traders) + ($30 waiting cost per hour) x (Average number of orders in system) = 20k + 30L.

P0 = 1 / [1+(1/1!)(40/30)]+[(1/2!)(40/30)2(60/(60-40))] Economic Analysis This is an M/M/2 queue with  = 40 per hour and  = 30 per hour. Analytical Formulae #1, 2, 3 P0 = 1 / [1+(1/1!)(40/30)]+[(1/2!)(40/30)2(60/(60-40))] = 1 / [1 + (4/3) + (8/3)] = 1/5 say the average number of units in the system is: L = Lq + ( /µ) = 16/15 + 4/3 = 2.40 Hence, total cost = (20)(2) + 30(2.40) = $112.00 per hour  = 40/hr. m = 30/hr. Cost = 20k + 30L

P0 = 1/[[1+(1/1!)(40/30)+(1/2!)(40/30)2]+ Economic Analysis This is an M/M/3 queue with  = 40 per hour and  = 30 per hour. Analytical Formulae #1, 2, 3 P0 = 1/[[1+(1/1!)(40/30)+(1/2!)(40/30)2]+ [(1/3!)(40/30)3(90/(90-40))] ] = 1 / [1 + 4/3 + 8/9 + 32/45] = 15/59 say the average number of units in the system is: L = .1446 + 40/30 = 1.4780 Hence, total cost = (20)(3) + 30(1.4780) = $104.35 per hour  = 40/hr. m = 30/hr. Cost = 20k + 30L

System cost comparison Wage Waiting Total Cost/Hr Cost/Hr Cost/Hr Economic Analysis System cost comparison Wage Waiting Total Cost/Hr Cost/Hr Cost/Hr 2 Traders $40.00 $72.00 $112.00 3 Traders $60.00 $44.35 $104.35 Thus, the total cost of having 3 traders is less than that of 2 traders.

Economic Analysis with Teamwork

Economic Analysis with Teamwork Overview Economic Analysis with Teamwork maximizes firm’s profits and customer’s value by trading off having more service channels (like registers in a grocery) with teams of workers (like a cashier and bagger working at the same register in a grocery) providing faster service in each channel.

Assume customer service times follow an exponential distribution. Economic Analysis with Teamwork A fast-food franchise is considering adding a drive-up window to a particular location. Assume customer arrivals follow a Poisson probability distribution, with an arrival rate of l = 24 cars per hour. Assume customer service times follow an exponential distribution. Arriving customers place orders at an intercom station at the back of the parking lot and then drive to the service window to pay for and receive their orders. The following three service alternatives are being considered.

Economic Analysis with Teamwork System A. One employee fills the order and takes the money from the customer. The average service time for this alternative is 2 minutes (30 customers per hour). All together, (k, l, m) = (1, 24, 30). System B. One employee fills the order while a second employee takes the money from the customer. The average service time for this alternative is 1.25 minutes (48 customers per hour). All together, (k, l, m) = (1, 24, 48). System C. Two service windows, each with an employee that fills the order and takes the money from the customer. The average service time for this alternative is 2 minutes (30 customers per hour) for each channel. All together, (k, l, m) = (2, 24, 30).

Customer waiting time is valued at $25 per hour. Economic Analysis with Teamwork Customer waiting time is valued at $25 per hour. So, you can charge $25/60 more per order if you can process orders an average of 1 minute (1/60 hour) faster. The cost of each employee is $6.50 per hour. Each channel costs $20 for equipment and space. Which system is most profitable?

The waiting plus channel cost for each each system is: Economic Analysis with Teamwork The labor plus equipment-space cost for each channel of each system is: System A: 6.50 + 20.00 = $26.50/hour System B: 2(6.50) $33.00/hour System C: The waiting plus channel cost for each each system is: System B is thus most profitable (it costs the minimum, $58.00). That is, one employee fills the order while a second employee takes the money from the customer. System A: 25(4) + 26.50(1) = $126.50 System B: 25(1) 33.00(1) $ 58.00 System C: 25(0.9524) 26.50(2) $ 76.81

Economic Analysis with Teamwork If, instead, the drive-up window were for a location in a poor part of town, where customer waiting time is valued at $2 per hour, which system is most profitable? Answer: Change the waiting plus channel cost for each system from to reduce time value from $25 to $2. System A is now most profitable. Finally, if the drive-up window were for outside the colony in Malibu, where customer waiting time is valued at $200 per hour, which system is most profitable? Answer: System B is most profitable, but if the value of time were high enough, then System C would be most profitable. System A: 25(4) + 26.50(1) = $126.50 System B: 25(1) 33.00(1) $ 58.00 System C: 25(0.9524) 26.50(2) $ 76.81

BA 452 Quantitative Analysis End of Lesson B.8