4/11: Queuing Models Collect homework, roll call Queuing Theory, Situations Single-Channel Waiting Line System –Distribution of arrivals –Distribution.

Slides:

Advertisements

Similar presentations

Waiting Line Management

Advertisements

Components of the Queuing System

Process Analysis and Design

Waiting Line Management

Review of Probability Distributions

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.

© 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.

D Waiting-Line Models PowerPoint presentation to accompany

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

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.

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.

Managing Waiting Lines

Waiting Line Models And Service Improvement

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.

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.

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.

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.

Waiting Line Analysis for Service Improvement

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.

Group members  Hamid Ullah Mian  Mirajuddin  Safi Ullah.

Queuing Theory (Waiting Line Models)

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

Service Systems & Queuing Chapter 12S OPS 370. Nature of Services –A

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.

Advanced Waiting Line Theory and Simulation Modeling Chapter 6 - Supplement.

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

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 and Queuing Theory Kusdhianto Setiawan Gadjah Mada University.

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.

Advance Waiting Line Theory and Simulation Modeling.

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.

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.

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.

Waiting Line Models Production and Operations Management Reporter:

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.

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.

Simple Queueing Theory: Page 5.1 CPE Systems Modelling & Simulation Techniques Topic 5: Simple Queueing Theory  Queueing Models  Kendall notation.

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,

Absolute time The passage of time as measured by a clock. Click here for Hint perceived time or absolute time or preprocess wait?

Managerial Decision Making Chapter 13 Queuing Models.

Module D Waiting Line Models.

McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.

18 Management of Waiting Lines

McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved

Demo on Queuing Concepts

Presentation transcript:

4/11: Queuing Models Collect homework, roll call Queuing Theory, Situations Single-Channel Waiting Line System –Distribution of arrivals –Distribution of service times –Queue discipline: FCFS –Steady-state operation –Operating characteristics Multiple-Channel Waiting Line System

Queuing Theory, Situations Waiting line for a roller coaster Waiting line at a restaurant Need to find an acceptable balance between few workers and few lost customers. Image courtesy of ohiomathworks.orgohiomathworks.org

Structure Single-channel waiting line Server Customers in line

Distribution of Arrivals When customers arrive Assume random & independent arrivals. A Poisson probability distribution: Server Customers in line x : # of arrivals in period : mean # of arrivals per period e :

Distribution of Arrivals: Example Assume that it has been calculated that 30 customers arrive per hour. Calculate the likelihood that no customers, 1 customer, and 2 customers will arrive in the next two minutes. Server Customers in line

Distribution of Arrivals: Example = 30 cust./60 min. = 0.50 cust./ 1 min. No customers in next minute: Server Customers in line

Distribution of Arrivals: Example = 30 cust./60 min. = 0.50 cust./ 1 min. One customer in next minute: Server Customers in line

Distribution of Arrivals: Example = 30 cust./60 min. = 0.50 cust./ 1 min. Two customers in next minute: Server Customers in line

Distribution of Arrivals: Example = 30 cust./ hour  ? Two customers in next TWO minutes: Server Customers in line = 1 customer / 2 min.

Distribution of Service Times Service times follow an exponential probability distribution.  = average # of units that can be served per time period e =

Prob. of Service Time: Example Our server can take care of, on average, 45 customers per hour. What is the probability of an order taking less than one minute?

Prob. of Service Time: Example Our server : 45 customers per hour. What is the probability of an order taking less than one minute?

Prob. of Service Time: Example Our server : 45 customers per hour. What is the probability of an order taking less than two minutes?

Queue Discipline We must define how the units are arranged for service. We will assume that our lines are FCFS, or First-Come, First-Served. Balking, reneging, jockeying

Steady-State Operation There is a transient period when a line starts, when things cannot be predicted. The system must be stable, that is, able to keep up with the customers. Our models apply only to the normal operation, or the steady-state operation.

Operating Characteristics Probability of no units in system Average number of units in waiting line Average number of units in system Average time unit is in waiting line Average time a unit is in the system Probability that an arriving unit will have to wait for service Probability of n units in system

Probability of no units in system = mean arrival rate (mean # arriv./time)  = mean service rate (mean # serv./time) The system includes the customer being serviced.

Average # of units in waiting line = mean arrival rate (mean # arriv./time)  = mean service rate (mean # serv./time) The waiting line does NOT include the customer being serviced.

Average # of units in system = mean arrival rate (mean # arriv./time)  = mean service rate (mean # serv./time)

Avg. time a unit is in waiting line = mean arrival rate (mean # arriv./time)  = mean service rate (mean # serv./time)

Average time a unit is in system = mean arrival rate (mean # arriv./time)  = mean service rate (mean # serv./time)

Probability that an arriving unit will have to wait for service = mean arrival rate (mean # arriv./time)  = mean service rate (mean # serv./time)

Probability of n units in system = mean arrival rate (mean # arriv./time)  = mean service rate (mean # serv./time)

Group Exercise A bank has a drive-up teller window. Arrivals are Poisson-distributed, with a mean rate of 24 customers / hour. Service times are exponential-probability distributed, with a mean rate of 36 customers / hour. Calculate the operating characteristics of the system.

Multiple-Channel Waiting Lines Server Customers in line Server

Multiple-Channel Waiting Lines Assumptions: Arrivals follow Poisson distribution. Service times follow exponential prob. dist. The mean service rate is the same for each channel (server). Arrivals wait in single line, then move to first open channel.

Multiple-Channel Waiting Lines = mean arrival rate  = mean service rate for each channel k = number of channels

Operating Characteristics Probability of no units in system Average number of units in waiting line Average number of units in system Average time unit is in waiting line Average time a unit is in the system Probability that an arriving unit will have to wait for service Probability of n units in system

Probability of no units in system = mean arrival rate (mean # arriv./time)  = mean service rate (mean # serv./time) k = # of channels The system includes the customer being serviced.

Average # of units in waiting line = mean arrival rate (mean # arriv./time)  = mean service rate (mean # serv./time) k = # of channels The waiting line does NOT include the customer being serviced.

Average # of units in system = mean arrival rate (mean # arriv./time)  = mean service rate (mean # serv./time)

Avg. time a unit is in waiting line = mean arrival rate (mean # arriv./time)  = mean service rate (mean # serv./time)

Average time a unit is in system = mean arrival rate (mean # arriv./time)  = mean service rate (mean # serv./time)

Probability that an arriving unit will have to wait for service = mean arrival rate (mean # arriv./time)  = mean service rate (mean # serv./time) k = # of channels

Probability of n units in system = mean arrival rate,  = mean service rate, k = # of channels

Homework due 4/18 Ch. 12 #5 (answer all questions) Ch. 12 #6 (answer all questions) Ch. 12 #7 (answer all questions) Ch. 12 #12 (answer all questions) Ch. 12 #13 (answer all questions) Turn in ON PAPER (you can do it by hand or using Excel).