Basic Queuing Insights Nico M. van Dijk “Why queuing never vanishes” European Journal of Operational Research 99 (1997) 463-476.

Slides:



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

S. D. Deshmukh OM V. Capacity Planning in Services u Matching Supply and Demand u The Service Process u Performance Measures u Causes of Waiting u Economics.
S. Chopra/Operations/Managing Services1 Operations Management: Capacity Management in Services Module u Why do queues build up? u Process attributes and.
Operations Management Waiting Lines. 2 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines1  Understanding the phenomenon of waiting  Measures.
Queueing Theory: Recap
Nur Aini Masruroh Queuing Theory. Outlines IntroductionBirth-death processSingle server modelMulti server model.
Queuing Models Basic Concepts
Previously Optimization Probability Review Inventory Models Markov Decision Processes.
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
Operations Management Waiting Lines. 2 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  Questions: Can we process the orders? How many.
Queuing Models Economic Analyses. ECONOMIC ANALYSES Each problem is different Examples –To determine the minimum number of servers to meet some service.
ECS 152A Acknowledgement: slides from S. Kalyanaraman & B.Sikdar
Queuing Systems Chapter 17.
Operations Management Waiting Lines. 2 Ardavan Asef-Vaziri Dec-2010Operations Management: Waiting Lines1  Questions: Can we process the orders? How many.
Waiting Line Models And Service Improvement
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
Waiting Line Analysis OPIM 310-Lecture 3 Instructor: Jose Cruz.
Data Communication and Networks Lecture 13 Performance December 9, 2004 Joseph Conron Computer Science Department New York University
MGTSC 352 Lecture 23: Congestion Management Introduction: Asgard Bank example Simulating a queue Types of congested systems, queueing template Ride’n’Collide.
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Terminology: The characteristics of a queuing system is captured by five parameters:
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.

Queuing Theory (Waiting Line Models)
Queuing Networks. Input source Queue Service mechanism arriving customers exiting customers Structure of Single Queuing Systems Note: 1.Customers need.
Introduction to Management Science
1 Chapter 16 Applications of Queuing Theory Prepared by: Ashraf Soliman Abuhamad Supervisor by : Dr. Sana’a Wafa Al-Sayegh University of Palestine Faculty.
Introduction to Queuing Theory
1 Chapter 5 Flow Lines Types Issues in Design and Operation Models of Asynchronous Lines –Infinite or Finite Buffers Models of Synchronous (Indexing) Lines.
Introduction to Queueing Theory
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
4/11: Queuing Models Collect homework, roll call Queuing Theory, Situations Single-Channel Waiting Line System –Distribution of arrivals –Distribution.
Project 2: ATM’s & Queues. ATM’s & Queues  Certain business situations require customers to wait in line for a service Examples:  Waiting to use an.
Chapter 20 Queuing Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
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.
18 Management of Waiting Lines.
1 Queuing Systems (2). Queueing Models (Henry C. Co)2 Queuing Analysis Cost of service capacity Cost of customers waiting Cost Service capacity Total.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Approximating the Performance of Call Centers with Queues using Loss Models Ph. Chevalier, J-Chr. Van den Schrieck Université catholique de Louvain.
Chapter 20 Queuing Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
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...
CSCI1600: Embedded and Real Time Software Lecture 19: Queuing Theory Steven Reiss, Fall 2015.
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.
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.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
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.
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.
Introduction Definition M/M queues M/M/1 M/M/S M/M/infinity M/M/S/K.
Delays  Deterministic Assumes “error free” type case Delay only when demand (known) exceeds capacity (known)  Stochastic Delay may occur any time Random.
OPSM 301: Operations Management Session 13-14: Queue management Koç University Graduate School of Business MBA Program Zeynep Aksin
Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
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.
1 BIS 3106: Business Process Management (BPM) Lecture Nine: Quantitative Process Analysis (2) Makerere University School of Computing and Informatics Technology.
Queueing Theory/Waiting Line: Models and Analysis Navneet Vidyarthi
Simulation of single server queuing systems
Module D Waiting Line Models.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 18 Management of Waiting Lines.
Lin/Operations/Managing Services1 Capacity Management in Services Module u Queuing processes and performance measures u Why do queues build up? u Performance.
OPERATING SYSTEMS CS 3502 Fall 2017
CPSC 531: System Modeling and Simulation
Introduction Notation Little’s Law aka Little’s Result
Chapter 20 Queuing Theory
Variability 8/24/04 Paul A. Jensen
COMP60611 Fundamentals of Parallel and Distributed Systems
COMP60621 Designing for Parallelism
Presentation transcript:

Basic Queuing Insights Nico M. van Dijk “Why queuing never vanishes” European Journal of Operational Research 99 (1997)

Main Points Simple questions such as “should separate queues be pooled?” do not have straightforward answers. Continuous contention between customer and system perspectives. Capacity and variation are the two most important factors in determining performance. An inaccurate system model may be OK for design purposes.

Customer vs. system perspectives Customer service Minimize expected waiting time Minimize probability of waiting more than a given length of time System efficiency Maximize output per unit of capacity = X/ Y X = number of services actually completed per unit time Y = maximum number of services that could be completed per unit time These objectives tend to conflict!

Example of System/Customer Conflict 1. Single server with arrival rate = 20/hr, service rate  = 30/hr 2.Two servers with total arrival rate 2  40/hr, combined service rate 2  = 60/hr Equivalent from system perspective but customers much prefer the second arrangement!

Factors That Influence Delay C = Capacity = maximum number of service completions per unit time (if all servers continuously busy)  2 = Variation = variance of service time distribution Also define: – A = arrival rate (customers per unit time) – R = average residual service time of a customer in service at an arbitrary instant. – S = expected service time – W = mean waiting time

Single server with random arrivals Deterministic service times Exponential service times Fixed variation

Supermarket case Flexible capacity: number of cashiers depends on arrival rate If customer cannot find a check-out with < 3 customers waiting, they get items free – Probability of this occurring with 5 check-outs is 1/3000 – Probability with 1 check-out is 1/5 Guarantee costs 2% of sales but gross sales increased by 20%: guarantee of short waiting time.

Pool or not? Two types of customers: – Type 1: 50/hr arrive, fixed service time = 1 min. – Type 2: 5/hr arrive, fixed service time = 10 min. Two dedicated servers: W 1 = 2.5 min., W 2 = 25 min., W = (10* *25)/11 = 4.55 min. Single queue for two servers: S = 1.82 min.,  2 = 6.69 min 2, W = 7.14 min.

Postal office case Short and long jobs Banking and postal services 5 servers with a single queue Recommendation: – 2 counters for short banking jobs – 1 counter for long banking jobs – 2 counters for postal jobs – Some cross-traffic with priority

General rules to lower total process times Reduce variation in arrivals Reduce variation in service times Use capacity flexibly Pool jobs of approximately equal durations Specialize servers to jobs of different durations Parallelize independent tasks Combine dependent tasks Prioritize