Waiting Line Management

Slides:



Advertisements
Similar presentations
© 2008 Pearson Addison Wesley. All rights reserved Chapter Seven Costs.
Advertisements

Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Part 3 Probabilistic Decision Models
Chapter 1 The Study of Body Function Image PowerPoint
1 Copyright © 2013 Elsevier Inc. All rights reserved. Appendix 01.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Components of the Queuing System
Introduction Queuing is the study of waiting lines, or queues.
Process Analysis and Design
Waiting Line Management
Chapter 5: Service Processes
1 Undirected Breadth First Search F A BCG DE H 2 F A BCG DE H Queue: A get Undiscovered Fringe Finished Active 0 distance from A visit(A)
VOORBLAD.
1 Breadth First Search s s Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.
Factor P 16 8(8-5ab) 4(d² + 4) 3rs(2r – s) 15cd(1 + 2cd) 8(4a² + 3b²)
© 2012 National Heart Foundation of Australia. Slide 2.
Understanding Generalist Practice, 5e, Kirst-Ashman/Hull
Model and Relationships 6 M 1 M M M M M M M M M M M M M M M M
25 seconds left…...
Introduction to Queuing Theory
H to shape fully developed personality to shape fully developed personality for successful application in life for successful.
Januar MDMDFSSMDMDFSSS
Statistical Inferences Based on Two Samples
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
PSSA Preparation.
Experimental Design and Analysis of Variance
Copyright 2009 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Service Design Operations Management - 6 th Edition Chapter.
Queuing Analysis Chapter 13.
Introduction into Simulation Basic Simulation Modeling.
OPSM 301 Operations Management Class 13: Service Design Waiting-Line Models Koç University Zeynep Aksin
© 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.
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
Waiting Lines and Queuing Theory Models
© The McGraw-Hill Companies, Inc., Technical Note 6 Waiting Line Management.
Queuing Systems Chapter 17.
Waiting Line Models And Service Improvement
Chapter 13 Queuing Theory
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
Operations Management Waiting-Line Models Module D
Chapter 9: Queuing Models
Queueing Theory.
Spreadsheet Modeling & Decision Analysis
Introduction to Management Science
MBA 8452 Systems and Operations Management MBA 8452 Systems and Operations Management Product Design & Process Selection —Service.
Queueing Theory Models Training Presentation By: Seth Randall.
McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. Service Processes CHAPTER 5.
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.
Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.
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
Queuing Models.
SERVICE PROCESSES CHAPTER 5. Learning Objectives After completing the chapter you will: Understand the characteristics of service processes and how they.
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.
“QUEUING THEORY”.
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Management of Waiting Lines
Presentation transcript:

Waiting Line Management Technical Note 6 Waiting Line Management

OBJECTIVES Waiting Line Characteristics Suggestions for Managing Queues Examples (Models 1, 2, 3, and 4) 2

Components of the Queuing System Servers Waiting Line Servicing System Queue or Customer Arrivals Exit 3

Customer Service Population Sources Finite Infinite Example: Number of machines needing repair when a company only has three machines. Example: The number of people who could wait in a line for gasoline. 4

Service Pattern Service Pattern Constant Variable Example: Items coming down an automated assembly line. Example: People spending time shopping. 5

The Queuing System Queuing System Length Number of Lines & Queue Discipline Number of Lines & Line Structures Queuing System Service Time Distribution

Examples of Line Structures Single Phase Multiphase One-person barber shop Car wash Hospital admissions Bank tellers’ windows Single Channel Multichannel 6

Degree of Patience No Way! No Way! BALK RENEG 7

Suggestions for Managing Queues 1. Determine an acceptable waiting time for your customers 2. Try to divert your customer’s attention when waiting 3. Inform your customers of what to expect 4. Keep employees not serving the customers out of sight 5. Segment customers 8

Suggestions for Managing Queues (Continued) 6. Train your servers to be friendly 7. Encourage customers to come during the slack periods 8. Take a long-term perspective toward getting rid of the queues 9

Waiting Line Models Source Model Layout Population Service Pattern 1 Single channel Infinite Exponential 2 Single channel Infinite Constant 3 Multichannel Infinite Exponential 4 Single or Multi Finite Exponential These four models share the following characteristics: · Single phase · Poisson arrival · FCFS · Unlimited queue length 10

Notation: Infinite Queuing: Models 1-3

Infinite Queuing Models 1-3 (Continued)

Example: Model 1 Assume a drive-up window at a fast food restaurant. Customers arrive at the rate of 25 per hour. The employee can serve one customer every two minutes. Assume Poisson arrival and exponential service rates. Determine: A) What is the average utilization of the employee? B) What is the average number of customers in line? C) What is the average number of customers in the system? D) What is the average waiting time in line? E) What is the average waiting time in the system? F) What is the probability that exactly two cars will be in the system? 11

Example: Model 1 A) What is the average utilization of the employee? 12

Example: Model 1 B) What is the average number of customers in line? C) What is the average number of customers in the system? 13

Example: Model 1 D) What is the average waiting time in line? E) What is the average waiting time in the system? 14

Example: Model 1 F) What is the probability that exactly two cars will be in the system (one being served and the other waiting in line)? 15

Example: Model 2 An automated pizza vending machine heats and dispenses a slice of pizza in 4 minutes. Customers arrive at a rate of one every 6 minutes with the arrival rate exhibiting a Poisson distribution. Determine: A) The average number of customers in line. B) The average total waiting time in the system. 16

Example: Model 2 A) The average number of customers in line. B) The average total waiting time in the system. 17

Example: Model 3 Recall the Model 1 example: Drive-up window at a fast food restaurant. Customers arrive at the rate of 25 per hour. The employee can serve one customer every two minutes. Assume Poisson arrival and exponential service rates. If an identical window (and an identically trained server) were added, what would the effects be on the average number of cars in the system and the total time customers wait before being served? 18

Example: Model 3 Average number of cars in the system Total time customers wait before being served 19

Notation: Finite Queuing: Model 4

Finite Queuing: Model 4 (Continued)

Example: Model 4 The copy center of an electronics firm has four copy machines that are all serviced by a single technician. Every two hours, on average, the machines require adjustment. The technician spends an average of 10 minutes per machine when adjustment is required. Assuming Poisson arrivals and exponential service, how many machines are “down” (on average)? 20

Example: Model 4 Number of machines down = L + H = .382 machines N, the number of machines in the population = 4 M, the number of repair people = 1 T, the time required to service a machine = 10 minutes U, the average time between service = 2 hours From Table TN6.11, F = .980 (Interpolation) L, the number of machines waiting to be serviced = N(1-F) = 4(1-.980) = .08 machines H, the number of machines being serviced = FNX = .980(4)(.077) = .302 machines Number of machines down = L + H = .382 machines 21

Queuing Approximation This approximation is quick way to analyze a queuing situation. Now, both interarrival time and service time distributions are allowed to be general. In general, average performance measures (waiting time in queue, number in queue, etc) can be very well approximated by mean and variance of the distribution (distribution shape not very important). This is very good news for managers: all you need is mean and standard deviation, to compute average waiting time

Queue Approximation Inputs: S, , , (Alternatively: S, , , variances of interarrival and service time distributions)

Approximation Example Consider a manufacturing process (for example making plastic parts) consisting of a single stage with five machines. Processing times have a mean of 5.4 days and standard deviation of 4 days. The firm operates make-to-order. Management has collected date on customer orders, and verified that the time between orders has a mean of 1.2 days and variance of 0.72 days. What is the average time that an order waits before being worked on? Using our “Waiting Line Approximation” spreadsheet we get: Lq = 3.154 Expected number of orders waiting to be completed. Wq = 3.78 Expected number of days order waits. Ρ = 0.9 Expected machine utilization.

End of Technical Note 6