Waiting Line Management

Slides:



Advertisements
Similar presentations
Waiting Line Management
Advertisements

Part 3 Probabilistic Decision Models
Components of the Queuing System
Introduction Queuing is the study of waiting lines, or queues.
By: Abby Almonte Crystal Chea Anthony Yoohanna
Process Analysis and Design
Chapter 5: Service Processes
Capacity Planning and Queuing Models
Capacity Planning Chapter 14.
Operations Management
Introduction to Queuing Theory
Waiting Lines CrossChek Sporting Goods’ Golf Division gets requests-for- quotes for custom-made golf clubs at a rate of about 4 per hour. Each of these.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Where is There Waiting? Service Facility –Fast-food restaurants –Post office –Grocery store.
Waiting Lines Example Students arrive at the Administrative Services Office at an average of one every 15 minutes, and their request take on average 10.
QUEUING MODELS Based on slides for Hilier, Hiller, and Lieberman, Introduction to Management Science, Irwin McGraw-Hill.
1 Ardavan Asef-Vaziri Jan-2011Operations Management: Waiting Lines 2 The arrival rate to a GAP store is 6 customers per hour and has Poisson distribution.
© 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.
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
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.
HW # Due Day: Nov 23.
© The McGraw-Hill Companies, Inc., Technical Note 6 Waiting Line Management.
Queuing Systems Chapter 17.
Management of Waiting Lines
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.
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
HW # Due Day: Nov 23.
Chapter 9: Queuing Models
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.

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.
Operations Management
Introduction to Management Science
McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. Service Processes CHAPTER 5.
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.
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.
Queueing Theory What is a queue? Examples of queues: Grocery store checkout Fast food (McDonalds – vs- Wendy’s) Hospital Emergency rooms Machines waiting.
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.
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.
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.
Queuing Models.
Topic VI. Multiple-Channel Queuing Model (Limited queue length system)
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.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
WAITING LINES AND SIMULATION
18 Management of Waiting Lines
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Management of Waiting Lines
Queuing Theory Queuing Theory.
Demo on Queuing Concepts
Queuing Systems Don Sutton.
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 By: Brian Murphy.
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.
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.
Queuing Models J. Mercy Arokia Rani Assistant Professor
Presentation transcript:

Waiting Line Management

Queuing systems: basic framework & key metrics Customer Population Arrival Queue Service Exit Average utilization (% time server busy) Average queuing time Average queue length (# of customers in line) Average system time (queuing + service) Average # of customers in the system (in line + being served)

Life without variability Customer Population Exit Arrival Queue Service Arrival stream: 1 every 5 minutes Service time: Exactly 5 minutes 1 every 10 minutes Exactly 5 minutes Average utilization Average queuing time Average queue length Average system time Average no. in system 100% 5 1 50% 5 0.5

Single queue, single server (M/M/1) Queuing Models… Single queue, single server (M/M/1) Arrival rate λ Service rate μ Assume Time between arrivals is Exp(λ) Time between services is Exp()

Queuing Models: Arrivals T = time between arrivals Assume T is an exponential random variable with rate l Probability density function for the exponential distribution: Expected time between arrivals:

Queuing Models: Arrivals Time between arrivals is Exp()  Poisson arrivals at rate l If we want to know how many customers arrive in a given time period, we can use the Poisson distribution. N(T) = number of arrivals in T time units PN(T)(n) is the probability that the number of arriving customers in any period of length T is exactly n

Examples: Customers arrive to a McDonalds according to a Poisson process with rate 2 customers per minute. What is the expected time between arrivals? What is the probability that exactly 3 customers arrive in any 5 minute period?

Queuing Models: Service We assume that service time S is an exponential random variable with rate  Example: A bank teller can service customers at a rate of 3 customers per minute.  = 3 customers/min What is the expected service time?

Utilization for M/M/1… How much of the capacity is being utilized? Arrival rate Service rate

Number of customers in the system for the M/M/1 queue… Ns = number of customers in system

Average number of customers in the system for the M/M/1 queue… On average, how many customers are in the system at any moment in time? Ls = Average # of customers in the system

Metrics for the M/M/1 queue… Utilization Average # of customers in the system Average # of customers in line Average time a customer spends in line Average time a customer spends in the system

Example … Western National Bank is considering opening a drive- through window for customer service. Management estimates that customers will arrive at the rate of 15 per hour. The teller who will staff the window can service customers at the rate of one every three minutes. Assuming exponential interarrival and service times, calculate performance metrics of this queue.

Example (continued) Because of limited space availability and a desire to provide an acceptable level of service, the bank manager would like reduce the probability that more than three cars are in the system at any given time. What is the current level of service? What must be service rate at the teller, and what utilization must be achieved, to ensure a 95% service level (probability of having 3 or less cars in the system being 95%).

Single queue, multiple servers (M/M/s) Queuing Models… Single queue, multiple servers (M/M/s) s = # of servers Arrival rate λ Service rate μ (for each server)

Metrics for the M/M/s queue… Utilization Average # of customers in line (see table TN7.11) Average # of customers in the system Average time a customer spends in line Average time a customer spends in the system

Example … Sharp Discounts Wholesale club has two service desks, one at each entrance of the store. Customers arrive at each service desk at an average of one every six minutes. The service rate at each service desk is four minutes per customer. What percentage of time is each service desk idle? What is the probability that both desks are busy? Idle? How many customers, on average, are waiting in line? How much time does a customer spend at the service desk? (waiting plus service time) e. Should Sharp Discounts consolidate its two service desks?

Cost of providing faster service vs. “cost” of waiting The trade-off in waiting line management… Cost of providing faster service vs. “cost” of waiting Total cost Cost Cost of capacity Cost of waiting Capacity

Example … In the service department at Glenn-Mark auto agency, mechanics requiring parts for auto repair or service present their request forms at the parts department counter. The parts clerk fills a request while the mechanic waits. Mechanics arrive according to a Poisson process with rate 40/h, and a clerk can fill requests at the rate of 20/h. The costs for a parts clerk is $6/h, and the cost for a mechanic is $12/h. Assuming there are currently 3 parts clerks, would you add a fourth?