Example 14.3 Queuing. 14.114.1 | 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 |14.914.214.414.514.614.714.814.9 Background Information n County Bank has several.

Slides:

Advertisements

Similar presentations

Part 3 Probabilistic Decision Models

Advertisements

Chapter 13 Queueing Models

Waiting Line Management

Capacity Planning and Queuing Models

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

Review of Probability Distributions

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

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.

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.

Simulation of multiple server queuing systems

Nur Aini Masruroh Queuing Theory. Outlines IntroductionBirth-death processSingle server modelMulti server model.

The Theory of Queues Models of Waiting in line. Queuing Theory Basic model: Arrivals  Queue  Being Served  Done – Queuing theory lets you calculate:

Queuing Analysis Based on noted from Appendix A of Stallings Operating System text 6/10/20151.

Queuing Models Basic Concepts

Chap. 20, page 1051 Queuing Theory Arrival process Service process Queue Discipline Method to join queue IE 417, Chap 20, Jan 99.

Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.

Queuing Models Economic Analyses. ECONOMIC ANALYSES Each problem is different Examples –To determine the minimum number of servers to meet some service.

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

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.

Other Markovian Systems

Example 14.4 Queuing | 14.2 | 14.3 | 14.5 | 14.6 | 14.7 |14.8 | Background Information n Which system has the.

The Theory of Queues Models of Waiting in line. Queuing Theory Basic model: Arrivals  Queue  Being Served  Done – Queuing theory lets you calculate:

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

Queuing Analysis Based on noted from Appendix A of Stallings Operating System text 6/28/20151.

Queuing. Elements of Waiting Lines  Population –Source of customers Infinite or finite.

To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Chapter 16 Waiting Line Models and.

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.

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.

Queuing Models and Capacity Planning

A Somewhat Odd Service Process (Chapters 1-6)

Spreadsheet Modeling & Decision Analysis

1 Chapter 17 Standing in line – at the bank, the market, the movies – is the time-waster everyone loves to hate. Stand in just one 15-minute line a day,

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.

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.

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.

IE 429, Parisay, January 2010 What you need to know from Probability and Statistics: Experiment outcome: constant, random variable Random variable: discrete,

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

1 Queuing Systems (2). Queueing Models (Henry C. Co)2 Queuing Analysis Cost of service capacity Cost of customers waiting Cost Service capacity Total.

M/M/1 Queues Customers arrive according to a Poisson process with rate. There is only one server. Service time is exponential with rate  j-1 jj+1...

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.

Waiting Line Models Production and Operations Management Reporter:

Example 14.5 Queuing | 14.2 | 14.3 | 14.4 | 14.6 | 14.7 |14.8 | Background Information n Over a period of time,

QUEUING THOERY. To describe a queuing system, an input process and an output process must be specified. Examples of input and output processes are: SituationInput.

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.

Module D Waiting Line Models.

18 Management of Waiting Lines

Queuing Models Economic Analyses.

Queuing Theory Queuing Theory.

Demo on Queuing Concepts

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.

DECISION MODELING WITH Prentice Hall Publishers and

Queuing Models and Capacity Planning

Topic IV. Single Channel Systems (Limited queue length system)

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 THEORY Made by Abdulsalam shek salim

Presentation transcript:

Example 14.3 Queuing

| 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | Background Information n County Bank has several branch locations n At one of these locations, customers arrive at a Poisson rate of 150 per hour. n The branch employs 6 tellers. n Each teller takes, on average, 2 minutes to serve a customer, and service times are exponentially distributed. n Also, all tellers perform all takes, so that customers can go to any of the 6 tellers.

| 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | Background Information -- continued n Customers who arrive and find all 6 servers busy join a single queue and are then served in FCFS fashion. n As a first step, the bank manager wants to develop a queuing model of the current system. n Then he wants to find the “best” number of tellers, given that tellers are paid $8 per hour.

| 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | MMS_TEMPLATE.XLS n As in the M / M / 1 system, there are formulas for the steady state probabilities, and these can be used to find summary measures such as L and W. n However, the details are fairly complex and will not be given here. n Instead, we provide a template in this file for performing the calculations. n The template can be seen on the next slide.

| 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 |

| 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | Solution n All you need to do is enter the inputs in cells B4 through B7 and then click on the button. n This button runs a macro that calculates all of the necessary outputs and places them in the appropriate cells. n From the template, we see that when there are 6 tellers and the server utilization is 0.833, the expected number of customers in the system is 7.94 and the expected time a typical customer spends in the system if hour.

| 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | Solution -- continued n We can find the expected fraction of time each teller is busy as L serv /s. n Then the expected fraction of time each teller is busy is L serv /s = 5/6= If this number doesn’t ring a bell, it should – it is the server utilization in cell B13. This is no coincidence. n The server utilization in an M / M / 1 system, calculated as the arrival rate divided by the maximum service rate, is always the expected fraction of time a typical server is busy. n We now turn to the economic analysis.

| 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | Economic Analysis n There is a cost and benefit from adding a teller. n The cost is the wage rate paid to the extra teller, $8 per hour. n The benefit is that customers wait less time in the bank. n The problem is evaluating the cost of waiting in line. n This is not an “out-of-pocket” cost for the bank, but the back realizes that it is an indirect cost in that customers who experience long waits might take their business elsewhere.

| 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | Economic Analysis -- continued n In any case, the key to the trade-off is assessing a unit cost, c Q, per customer per hour of waiting in the queue. n If the manager can assess this unit cost, then the total expected cost per hour and each waits waiting is c Q W Q. n Then we can trade off this waiting cost against the cost of hiring extra tellers.

| 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | MMS_OPT_TEMPLATE.XLS n We provide another template in this file that helps solve the problem. n You now need to provide the arrival rate, the service rate per server, the wage rate per server, and the unit waiting cost per customer per unit time in line. n You should not enter the numbers of servers as an input. n Instead, the macro calculates selected summary measures of the system for several choices of the number of servers.

| 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 |

| 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | Solution -- continued n Specifically, it begins by using the smallest umber of servers required to keep the system stable. n This procedure requires a value for c Q in cell B8. n Because this value is probably very difficult for a bank manager to assess, we can instead use an indirect approach. n We will find ranges for c Q where a specific number of servers is economically optimal.

| 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | Solution -- continued n The output form the template can be seen on the next slide. n The results imply that it is best to use 6 tellers when c Q < $3.76. n Otherwise, if c Q < $15.24, it is best to use 7 tellers. n Finally, for c Q between $15.24 and $20, it is best to use 8 tellers.

| 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 |