Module C8 Queuing Economic/Cost Models. ECONOMIC ANALYSES Each problem is different Examples –To determine the minimum number of servers to meet some.

Slides:



Advertisements
Similar presentations
Components of the Queuing System
Advertisements

Introduction Queuing is the study of waiting lines, or queues.
Waiting Line Management
IE 429, Parisay, January 2003 Review of Probability and Statistics: Experiment outcome: constant, random variable Random variable: discrete, continuous.
LESSONs NINE and TEN QUEUING MODELS.
Model Antrian Ganda Pertemuan 21 Matakuliah: K0414 / Riset Operasi Bisnis dan Industri Tahun: 2008 / 2009.
Review of Probability Distributions
Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Capacity Planning and Queuing Models.
Queuing Theory Worthmore Department Store
QUEUING MODELS Based on slides for Hilier, Hiller, and Lieberman, Introduction to Management Science, Irwin McGraw-Hill.
Readings Readings Chapter 11, Sections 1, 2, 3, 5 Waiting Line Models.
Queuing Models M/M/k Systems. CLASSIFICATION OF QUEUING SYSTEMS Recall that queues are classified by (Arrival Dist.)/(Service Dist.)/(# servers) Designations.
© 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.
Operations research Quiz.
QMD: Waiting-line analysis
Queuing Models Basic Concepts
Simulation A Queuing Simulation. Example The arrival pattern to a bank is not Poisson There are three clerks with different service rates A customer must.
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.
Simulation A Queuing Simulation. Example The arrival pattern to a bank is not Poisson There are three clerks with different service rates A customer must.
© The McGraw-Hill Companies, Inc., Technical Note 6 Waiting Line Management.
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
Chapter 13 Queuing Theory
Other Markovian Systems
MGTSC 352 Lecture 23: Congestion Management Introduction: Asgard Bank example Simulating a queue Types of congested systems, queueing template Ride’n’Collide.
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
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.
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.
Chapter 9: Queuing Models
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
OPSM 301: Operations Management
Spreadsheet Modeling & Decision Analysis
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.
D-1 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Operations Management Waiting-Line Models Module D.
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
1-1 McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved 1 Chapter 8A Waiting Line Management.
1 ISE 195 Introduction to Industrial & Systems Engineering.
Components of the Queuing System
MGTSC 352 Lecture 25: Congestion Management MEC example Manufacturing example.
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.
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.
Delays  Deterministic Assumes “error free” type case Delay only when demand (known) exceeds capacity (known)  Stochastic Delay may occur any time Random.
Example 14.3 Queuing | 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | Background Information n County Bank has several.
Queuing Models.
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,
Managerial Decision Making Chapter 13 Queuing Models.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
Managing Flow Variability: Safety Capacity
Application of Queueing
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Queuing Models Economic Analyses.
Delays Deterministic Stochastic Assumes “error free” type case
LESSON 12: EXPONENTIAL DISTRIBUTION
Variability 8/24/04 Paul A. Jensen
Topic IV. Single Channel Systems (Limited queue length system)
Presentation transcript:

Module C8 Queuing Economic/Cost Models

ECONOMIC ANALYSES Each problem is different Examples –To determine the minimum number of servers to meet some service criterion (e.g. an average of < 4 minutes in the queue) -- trial and error with M/M/k systems –To compare 2 or more situations -- Consider the total (hourly) cost for each system and choose the minimum

Example 1 Determining Optimal Number of Servers Customers arrive to an electronics store at random at an average rate of 100 per hour. Service times are random but average 5 min. How many servers should be hired so that the average time of a customer waits for service is less than 30 seconds? –30 seconds =.5 minutes = hours

GOAL: Average time in the queue, W Q <.00833hrs. ……….. How many servers? Arrival rate = 100/hr. Average service time 1/  = 5 min. = 5/60 hr.  = 60/5 = 12/hr.

First time W Q < servers needed Input values for and 

Example 2 Determining Which Server to Hire Customers arrive at random to a store at night at an average rate of 8 per hour. The company places a value of $4 per hour per customer in the store. Service times are random. The average service time that depends on the server. ServerSalary Average Service Time – Ann$ 6/hr.6 min. – Bill$ 10/hr.5 min. – Charlie$ 14/hr.4 min. Which server should be hired?

Ann 1/  = 6 min.  A = 60/6 = 10/hr. Hourly Cost = $6 + 4L Ann L Ann = 8/hr L Ann = 4 L Ann Hourly Cost = $6 + $4(4) = $22 4

Bill 1/  = 5 min.  B = 60/5 = 12/hr. Hourly Cost = $10 + 4L Bill L Bill = 8/hr L Bill = 2 Hourly Cost = $10 + $4(2) = $18 2

Charlie 1/  = 4 min.  C = 60/4 = 15/hr. Hourly Cost = $14 + 4L Charlie L Charlie Hourly Cost = $14 + $4(1.14) = $ = 8/hr L Charlie = 1.14

Optimal Ann--- Total Hourly Cost = $22 Bill--- Total Hourly Cost = $18 Charlie--- Total Hourly Cost = $18.56 Hire Bill

Example 3 What Kind of Line to Have.A fast food operation is considering opening a drive-up window food service operation. Customers arrive at random at an average rate of 24 per hour. Three systems are being considered. Customer waiting time is valued at $25 per hour. Each clerk makes $6.50 per hour. Each drive-thru lane costs $20 per hour to operate. Which system should be used?

Option clerk, 1 lane Store = 24/hr. 1/  = 2 min.  = 60/2 = 30/hr. Total Hourly Cost Salary + Lanes + Wait Cost $ $20 + $25L Q L Q = 3.2 Total Hourly Cost Salary + Lanes + Wait Cost $ $20 + $25(3.2) = $106.50

Option clerks, 1 lane = 24/hr. 1 Service System 1/  = 1.25 min.  = 60/1.25 = 48/hr. Total Hourly Cost Salary + Lanes + Wait Cost 2($6.50) + $20 + $25L Q Store L Q =.5 Total Hourly Cost Salary + Lanes + Wait Cost 2($6.50) + $20 + $25(.5) = $45.50

Option clerks, 2 lanes Store = 24/hr. Total Hourly Cost Salary + Lanes + Wait Cost 2($6.50) + $40 + $25L Q Store 1/  = 2 min.  = 60/2 = 30/hr. L Q =.152 Total Hourly Cost Salary + Lanes + Wait Cost 2($6.50) + $40 + $25(.152) = $56.80

Optimal Option 1--- Total Hourly Cost = $ Option 2--- Total Hourly Cost = $ Option 3--- Total Hourly Cost = $ Best Option 2

Example 4 Which Store to Lease Customers are expected to arrive to a store location at random at an average rate of 30 per hour. The store will be open 10 hours per day. Service times can be considered random. The average sale grosses $25. Clerks are paid $20/hr. including all benefits. The cost of having a customer in the store is estimated to be $8 per customer per hour. Clerk Service Rate = 10 customers/hr. Should they lease a Large Store or Small Store?

Large Store = 30/hr. … 6 Servers Unlimited Queue Length All customers get served! Lease Cost = $1000/day = $1000/10 = $100/hr.

Small Store = 30/hr. 2 Servers Maximum Queue Length = 1 Lease Cost = $200/day = $200/10 = $20/hr. Will join system if 0 or 1 in the queue Will not join the queue if there is 1 customer in the queue

Hourly Profit Analysis Large Small Arrival Rate = 30 e = 30(1-p 3 ) Revenue $25(Arrival Rate) (25)(30)=$750 $25 e Costs Lease $100$20 Server $20(#Servers) (20)(6) =$120 (20)(2) =$40 Waiting $8(Avg. in Store) =$8L $8L Net Profit ? ?

Large Store -- M/M/ L

Small Store -- M/M/2/3 L p3p3 e = ( )(30) =

Hourly Profit Analysis Large Small Arrival Rate = 30 e = 30(1-p 3 ) Revenue $25(Arrival Rate) (25)(30)=$750 $25 e Costs Lease $100$20 Server $20(#Servers) (20)(6) =$120 (20)(2) =$40 Waiting $8(Avg. in Store) =$8L $8L Net Profit ? ? $750 $418 $100 $ 20 $120 $ 40 $8( ) $ 25$8( ) $ 17 $750-$100-$120-$25 $505 $418-$20-$40-$17 $341 Lease the large store

Example 5 Which Machine is Preferable Jobs arrive randomly to an assembly plant at an average rate of 5 per hour. Service times do not follow an exponential distribution. Two machines are being considered –(1) Mean service time of 6 min. (  = 60/6 = 10/hr.) standard deviation of 3 min. (  = 3/60 =.05 hr.) –(2) Mean service time of 6.25 min.(  = 60/6.25 = 9.6/hr.) standard deviation of.6 min. (  =.6/60 =.01 hr.) Which of the two designs seems preferable?

Machine 1

Machine 2

Machine Comparisons Machine1 Machine 2 Prob (No Wait) -- P Average Service Time 6 min min. Average # in System Average # in Queue Average Time in System.1625 hr hr min min. Average Time in Queue.0625 hr hr min min.

Module C8 Review List Components of System Develop a model Use templates to get parameter estimates Select “optimal” design