Erlang-C = M/M/N. agents. queue ACD. arrivals. busy ACD. queue. abandonment BACK FRONT. lost calls. arrivals. lost calls
|
|
- Denis Dean
- 5 years ago
- Views:
Transcription
1 Erlang-C = M/M/N agents arrivals ACD queue Erlang-A <4CallCenters> lost calls FRONT BACK arrivals busy ACD queue abandonment lost calls
2
3 Erlang-C = M/M/N agents arrivals ACD queue
4 Rough Performance Analysis Peak 10:00 10:30 a.m., with 100 agents 400 calls 3:45 minutes average service time 2 seconds ASA (Average Speed of Answer)
5 Rough Performance Analysis Peak 10:00 10:30 a.m., with 100 agents 400 calls 3:45 minutes average service time 2 seconds ASA Offered load R = λ E(S) = 400 3:45 = 1500 min./30 min. = 50 Erlangs Occupancy ρ = R/N = 50/100 = 50%
6 Rough Performance Analysis Peak 10:00 10:30 a.m., with 100 agents 400 calls 3:45 minutes average service time 2 seconds ASA Offered load R = λ E(S) = 400 3:45 = 1500 min./30 min. = 50 Erlangs Occupancy ρ = R/N = 50/100 = 50% Quality-Driven Operation Classical Queueing Theory (Light-Traffic) (M/G/N approximations) Above: R = 50, N = R + 50, all served immediately. Rule of Thumb: N = R + δ R, > 0 δ service-grade.
7 Quality-driven: 100 agents, 50% utilization Can increase offered load - by how much? Erlang-C N=100 E(S) = 3:45 min. λ/hr ρ E(W q ) = ASA % Wait = % 0 100%
8 Quality-driven: 100 agents, 50% utilization Can increase offered load - by how much? Erlang-C N=100 E(S) = 3:45 min. λ/hr ρ E(W q ) = ASA % Wait = % 0 100% % 0:02 min. 88% % 0:48 min. 35% % 2:34 min. 15% % 3:34 min. 12%
9 Quality-driven: 100 agents, 50% utilization Can increase offered load - by how much? Erlang-C N=100 E(S) = 3:45 min. λ/hr ρ E(W q ) = ASA % Wait = % 0 100% % 0:02 min. 88% % 0:48 min. 35% % 2:34 min. 15% % 3:34 min. 12% Efficiency-driven Operation (Heavy Traffic) W q W q 1 ρ W 0 N q > = E( S) E( S) N 1 ρ N = 3:45! N( 1 ρ ) = 1, ρ 1 N Above: R = 99, N = R + 1, all delayed. N Rule of Thumb: N = R + γ, γ > 0 service grade.
10 Changing N (Staffing) in Erlang-C E(S) = 3:45 λ/hr N OCC ASA % Wait = % 3:34 12%
11 Changing N (Staffing) in Erlang-C E(S) = 3:45 λ/hr N OCC ASA % Wait = % 3:34 12% % 59:33 0%
12 Changing N (Staffing) in Erlang-C E(S) = 3:45 λ/hr N OCC ASA % Wait = % 3:34 12% % 59:33 0% % 3:06 13% % 1:24 24% % 0:23 50%
13 Changing N (Staffing) in Erlang-C E(S) = 3:45 λ/hr N OCC ASA % Wait = % 3:34 12% % 59:33 0% % 3:06 13% % 1:24 24% % 0:23 50% New Rationalized Operation Efficiently driven, in the sense that OCC > 95%; Quality-Driven, 50% answered immediately QED Regime = Quality- and Efficiency-Driven Regime Economies of Scale in a Frictionless Environment Above: R = 100, N = R + 5, 50% delayed. Safety-Staffing N = R + β R, β > 0.
14 QED Theorem (Halfin-Whitt, 1981) Consider a sequence of M/M/N models, N=1,2,3, Then the following 3 points of view are equivalent: Customer Server lim N lim N P N {Wait > 0} =, 0 < < 1; N (1 ), 0 < < ; N Manager N R R, R E(S) large; Here 1 ( ) 1 ( ), where ( ) / ( ) is the standard normal density/distribution. Extremes: Everyone waits: 1 0 Efficiency-driven Quality-driven 0 No one waits:
15 Safety-Staffing: Performance R = λ E(S) Offered load (Erlangs) N = R + 1 β 23 R β = service-grade > 0 = R + safety-staffing Expected Performance: ( ) % Delayed P( ) βφ β β = 1 +, > 0 ( ) β Erlang-C ϕ β 1 Congestion index = E Wait E(S) Wait > 0 = 1 ASA % Wait E(S) > T Wait > 0 = -T e TSF Servers Utilization = R N β 1 Occupancy N 38
16 The Halfin-Whitt Delay Function P( ) Alpha Beta 19
17 Rules-of-Thumb in an "Erlang-C World" R = Offered Load (not small) Efficiency-Driven: N = R + 2 (or 3, or ); Expect that essentially all customers are delayed in queue, that average delay is about 1/2 (or 1/3, or ) average service-time, and that agents utilization is extremely high (close to 100%). Quality-Driven: N = R + (10% - 20%) R Expect essentially no delays of customers. QED: N = R R Expect that about half of the customers are not delayed in queue, that average delay is about one-order less than average service-time (seconds vs. minutes), and that agents utilization is high (90-95%). Can determine regime scientifically: Strategy: Retain performance levels under Pooling (4CC demo) Economics: Minimize agent salaries + congestion cost, or Satisfization: Least Number of Agents s.t. Constraints 39
18 Strategy: Sustain Regime under Pooling Base: λ = 300/hr, AHT = 5 min, N = 30 agents OCC = 83.3%, ASA = 15 sec, %{Wait>0} = 25% 4 CC: λ = 1200, AHT = 5 min, N=? Quality-Driven: maintain OCC at 83.3%. N = 120, ASA =.5 sec Efficiency-Driven: N = 107, OCC = 93.5% maintain ASA at 15 sec. QED: maintain %{Wait>0}) at 25% N = = 110, OCC = 91%, ASA = 7 sec 9 CC: λ = 2700, AHT = 5, R = 225 Q: N = 270 E: N = 233 QED: N = = 240, OCC = 94%, ASA = 4.7 sec 40
19 Economics: Quality vs. Efficiency (Dimensioning: with S. Borst and M. Reiman) Quality D(t) delay cost (t = delay time) Efficiency C(N) staffing cost (N = # agents) Optimization: N* minimizes Total Costs C >> D : Efficiency-driven C << D : Quality-driven C D : Rationalized - QED Satisfization: N* minimal s.t. Service Constraint Eg. %Delayed <. 1 : Efficiency-driven 0 : Quality-driven 0 < < 1 : Rationalized - QED Framework: Asymptotic theory of M/M/N, N
20 Figure 12: Mean Service Time (Regular) vs. Time-of-day (95% CI) (n = 42613) Mean Service Time Time of Day 30 29
21 Predictable Variability Arrivals Queues Waiting 1
22 Service Time Survival curve, by Types Means (In Seconds) NW (New) = 111 PS (Regular) = 181 Survival NE (Stocks) = 269 IN (Internet) = 381 Time 32 31
23 33 14
24 Operational Aspects of Impatience Recall earlier Q, E and QED Scenarios (E(S) = 3:45): /hr N OCC ASA % Wait = % 59:33 1% % 0:23 51% % infinity 0% BUT with Patience=E(S) % 0:09 50% AND could have %Abandon % 0: % % 0:23 6.5% % 0:23 3.4% QED with (Im)patient Customers: The "fittest" survive and wait less much less! Erlang-A: Erlang-C with Exponential Patience / Abandonment Downloadable implementation: 4CallCenters(.com)
25 Operational Aspects of Impatience Recall earlier Q, E and QED Scenarios (E(S) = 3:45): /hr N OCC ASA % Wait = % 59:33 1% % 0:23 51% % infinity 0% BUT with Patience=E(S) % 0:09 50% AND could have %Abandon % 0: % % 0:23 6.5% % 0:23 3.4% QED with (Im)patient Customers: The "fittest" survive and wait less much less! Erlang-A: Erlang-C with Exponential Patience / Abandonment Downloadable implementation: 4CallCenters(.com)
26 Operational Aspects of Impatience Recall earlier Q, E and QED Scenarios (E(S) = 3:45): /hr N OCC ASA % Wait = % 59:33 1% % 0:23 51% % infinity 0% BUT with Patience=E(S) % 0:09 50% AND could have %Abandon % 0: % % 0:23 6.5% % 0:23 3.4% QED with (Im)patient Customers: The "fittest" survive and wait less much less! Erlang-A: Erlang-C with Exponential Patience / Abandonment Downloadable implementation: 4CallCenters(.com)
27 Operational Aspects of Impatience Recall earlier Q, E and QED Scenarios (E(S) = 3:45): /hr N OCC ASA % Wait = % 59:33 1% % 0:23 51% % infinity 0% BUT with Patience=E(S) % 0:09 50% AND could have %Abandon % 0: % % 0:23 6.5% % 0:23 3.4% QED with (Im)patient Customers: The "fittest" survive and wait less much less! Erlang-A: Erlang-C with Exponential Patience / Abandonment Downloadable implementation: 4CallCenters(.com)
28 Erlang-A (with G-Patience): M/M/N+G lost calls FRONT arrivals busy ACD queue abandonment lost calls
29 QED Theorem (Garnett, M. and Reiman '02; Zeltyn '03) Consider a sequence of M/M/N+G models, N=1,2,3, Then the following points of view are equivalent: QED %{Wait > 0} α, 0 < α < 1 ; Customers %{Abandon} γ N, 0 < γ ; Agents OCC β + γ 1 < β < ; N Managers N R + β R, R = λ E(S) not small; QED performance (ASA,...) is easily computable, all in terms of β (the square-root safety staffing level) see later. Covers also the Extremes: α = 1 : N = R - γ R α = 0 : N = R + γ R Efficiency-driven Quality-driven
30 QED Approximations (Zeltyn) λ arrival rate, µ service rate, N number of servers, G patience distribution, g 0 patience density at origin (g 0 = θ, if exp(θ)). N = λ µ + β λµ + o( λ), <β<. P{Ab} { P W> T } N { P Ab W> T } N Here ˆβ = µ β g 0 Φ(x) = 1 Φ(x), 1 [h(ˆβ) ˆβ ] [ µ + h(ˆβ) ] 1, N g 0 h( β) [ ] 1 g0 1+ µ h(ˆβ) Φ (ˆβ + g 0 µ T ) h( β) Φ( ˆβ) 1 g0 N µ [h (ˆβ + g 0 µ T ) ˆβ ]., h(x) = φ(x)/ Φ(x), hazard rate of N(0, 1). Generalizing Garnett, M., Reiman (2002) (Palm ) No Process Limits
31 Erlang-A: P{Wait>0}= vs. (N=R+ R) P{Wait>0} Halfin-Whitt GMR(0.1) GMR(0.5) GMR(1) GMR(2) GMR(5) GMR(10) GMR(20) GMR(50) GMR(100) GMR(x) describes the asymptotic probability of delay as a function of when x. Here, and µ are the abandonment and service rate, respectively.
32 Erlang-A: P{Abandon}* N vs P{Abandon}* N GMR(0.1) GMR(0.5) GMR(1) GMR(2) GMR(5) GMR(10) GMR(20) GMR(50) GMR(100)
33 Forecasting the Arrival Function Theoretical & Empirical Prob. of Delay vs Garnett Empirical 1
Dynamic Control of Parallel-Server Systems
Dynamic Control of Parallel-Server Systems Jim Dai Georgia Institute of Technology Tolga Tezcan University of Illinois at Urbana-Champaign May 13, 2009 Jim Dai (Georgia Tech) Many-Server Asymptotic Optimality
More informationAbandonment and Customers Patience in Tele-Queues. The Palm/Erlang-A Model.
Sergey Zeltyn February 25 zeltyn@ie.technion.ac.il STAT 991. Service Engineering. The Wharton School. University of Pennsylvania. Abandonment and Customers Patience in Tele-Queues. The Palm/Erlang-A Model.
More informationDesigning a Telephone Call Center with Impatient Customers
Designing a Telephone Call Center with Impatient Customers with Ofer Garnett Marty Reiman Sergey Zeltyn Appendix: Strong Approximations of M/M/ + Source: ErlangA QEDandSTROG FIAL.tex M/M/ + M System Poisson
More informationClass 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.
Service Engineering Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. G/G/1 Queue: Virtual Waiting Time (Unfinished Work). GI/GI/1: Lindley s Equations
More informationCall Centers Queueing. Service Engineering
Call Centers Queueing Theory, Science, Practice Service Engineering Madrid, July 3, 2002 e.mail : avim@tx.technion.ac.il Tool : http://4callcenters.com (register & use) Course : http://ie.technion.ac.il/serveng
More informationService Engineering January Laws of Congestion
Service Engineering January 2004 http://ie.technion.ac.il/serveng2004 Laws of Congestion The Law for (The) Causes of Operational Queues Scarce Resources Synchronization Gaps (in DS PERT Networks) Linear
More informationLecture 9: Deterministic Fluid Models and Many-Server Heavy-Traffic Limits. IEOR 4615: Service Engineering Professor Whitt February 19, 2015
Lecture 9: Deterministic Fluid Models and Many-Server Heavy-Traffic Limits IEOR 4615: Service Engineering Professor Whitt February 19, 2015 Outline Deterministic Fluid Models Directly From Data: Cumulative
More informationClassical Queueing Models.
Sergey Zeltyn January 2005 STAT 99. Service Engineering. The Wharton School. University of Pennsylvania. Based on: Classical Queueing Models. Mandelbaum A. Service Engineering course, Technion. http://iew3.technion.ac.il/serveng2005w
More informationThe Palm/Erlang-A Queue, with Applications to Call Centers
The Palm/Erlang-A Queue, with Applications to Call Centers Contents Avishai Mandelbaum and Sergey Zeltyn Faculty of Industrial Engineering & Management Technion, Haifa 32000, ISRAEL emails: avim@tx.technion.ac.il,
More informationThe M/M/n+G Queue: Summary of Performance Measures
The M/M/n+G Queue: Summary of Performance Measures Avishai Mandelbaum and Sergey Zeltyn Faculty of Industrial Engineering & Management Technion Haifa 32 ISRAEL emails: avim@tx.technion.ac.il zeltyn@ie.technion.ac.il
More informationStaffing many-server queues with impatient customers: constraint satisfaction in call centers
Staffing many-server queues with impatient customers: constraint satisfaction in call centers Avishai Mandelbaum Faculty of Industrial Engineering & Management, Technion, Haifa 32000, Israel, avim@tx.technion.ac.il
More informationOn Priority Queues with Impatient Customers: Stationary and Time-Varying Analysis
On Priority Queues with Impatient Customers: Stationary and Time-Varying Analysis RESEARCH THESIS SUBMITTED IN PARTIAL FULFILLMENT OF REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE IN OPERATIONS RESEARCH
More informationStaffing Many-Server Queues with Impatient Customers: Constraint Satisfaction in Call Centers
OPERATIONS RESEARCH Vol. 57, No. 5, September October 29, pp. 1189 125 issn 3-364X eissn 1526-5463 9 575 1189 informs doi 1.1287/opre.18.651 29 INFORMS Staffing Many-Server Queues with Impatient Customers:
More informationOn Priority Queues with Impatient Customers: Stationary and Time-Varying Analysis
On Priority Queues with Impatient Customers: Stationary and Time-Varying Analysis RESEARCH THESIS SUBMITTED IN PARTIAL FULFILLMENT OF REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE IN OPERATIONS RESEARCH
More informationEconomy of Scale in Multiserver Service Systems: A Retrospective. Ward Whitt. IEOR Department. Columbia University
Economy of Scale in Multiserver Service Systems: A Retrospective Ward Whitt IEOR Department Columbia University Ancient Relics A. K. Erlang (1924) On the rational determination of the number of circuits.
More informationThe Offered-Load Process: Modeling, Inference and Applications. Research Thesis
The Offered-Load Process: Modeling, Inference and Applications Research Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science in Statistics Michael Reich Submitted
More informationInternet Supplement to Call centers with impatient customers: many-server asymptotics of the M/M/n+G queue
Internet Supplement to Call centers with impatient customers: many-server asymptotics of the M/M/n+G queue Sergey Zeltyn and Avishai Mandelbaum Faculty of Industrial Engineering & Management Technion Haifa
More informationThe Offered-Load Process: Modeling, Inference and Applications. Research Thesis
The Offered-Load Process: Modeling, Inference and Applications Research Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science in Statistics Michael Reich Submitted
More informationRouting and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers
OPERATIONS RESEARCH Vol. 59, No. 1, January February 2011, pp. 50 65 issn 0030-364X eissn 1526-5463 11 5901 0050 informs doi 10.1287/opre.1100.0878 2011 INFORMS Routing and Staffing in Large-Scale Service
More informationWhat You Should Know About Queueing Models To Set Staffing Requirements in Service Systems
What You Should Know About Queueing Models To Set Staffing Requirements in Service Systems by Ward Whitt Department of Industrial Engineering and Operations Research Columbia University 304 S. W. Mudd
More informationQueueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "
Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals
More informationBRAVO for QED Queues
1 BRAVO for QED Queues Yoni Nazarathy, The University of Queensland Joint work with Daryl J. Daley, The University of Melbourne, Johan van Leeuwaarden, EURANDOM, Eindhoven University of Technology. Applied
More informationec1 e-companion to Liu and Whitt: Stabilizing Performance
ec1 This page is intentionally blank. Proper e-companion title page, with INFORMS branding and exact metadata of the main paper, will be produced by the INFORMS office when the issue is being assembled.
More informationENGINEERING SOLUTION OF A BASIC CALL-CENTER MODEL
ENGINEERING SOLUTION OF A BASIC CALL-CENTER MODEL by Ward Whitt Department of Industrial Engineering and Operations Research Columbia University, New York, NY 10027 Abstract An algorithm is developed to
More informationThe Performance Impact of Delay Announcements
The Performance Impact of Delay Announcements Taking Account of Customer Response IEOR 4615, Service Engineering, Professor Whitt Supplement to Lecture 21, April 21, 2015 Review: The Purpose of Delay Announcements
More informationOne billion+ terminals in voice network alone
Traffic Engineering Traffic Engineering One billion+ terminals in voice networ alone Plus data, video, fax, finance, etc. Imagine all users want service simultaneously its not even nearly possible (despite
More informationSENSITIVITY OF PERFORMANCE IN THE ERLANG-A QUEUEING MODEL TO CHANGES IN THE MODEL PARAMETERS
SENSITIVITY OF PERFORMANCE IN THE ERLANG-A QUEUEING MODEL TO CHANGES IN THE MODEL PARAMETERS by Ward Whitt Department of Industrial Engineering and Operations Research Columbia University, New York, NY
More informationRouting and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers 1
Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers 1 Mor Armony 2 Avishai Mandelbaum 3 June 25, 2008 Abstract Motivated by call centers,
More informationClass 9 Stochastic Markovian Service Station in Steady State - Part I: Classical Queueing Birth & Death Models
Service Engineering Class 9 Stochastic Markovian Service Station in Steady State - Part I: Classical Queueing Birth & Death Models Service Engineering: Starting to Close the Circle. Workforce Management
More informationIntroduction to queuing theory
Introduction to queuing theory Claude Rigault ENST claude.rigault@enst.fr Introduction to Queuing theory 1 Outline The problem The number of clients in a system The client process Delay processes Loss
More informationCopyright by Jing Zan 2012
Copyright by Jing Zan 2012 The Dissertation Committee for Jing Zan certifies that this is the approved version of the following dissertation: Staffing Service Centers Under Arrival-rate Uncertainty Committee:
More informationA Fluid Approximation for Service Systems Responding to Unexpected Overloads
Submitted to Operations Research manuscript 28-9-55.R2, Longer Online Version 6/28/1 A Fluid Approximation for Service Systems Responding to Unexpected Overloads Ohad Perry Centrum Wiskunde & Informatica
More informationDesign, staffing and control of large service systems: The case of a single customer class and multiple server types. April 2, 2004 DRAFT.
Design, staffing and control of large service systems: The case of a single customer class and multiple server types. Mor Armony 1 Avishai Mandelbaum 2 April 2, 2004 DRAFT Abstract Motivated by modern
More informationQueueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA
1 / 24 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/6/16 2 / 24 Outline 1 Introduction 2 Queueing Notation 3 Transient
More informationDesigning load balancing and admission control policies: lessons from NDS regime
Designing load balancing and admission control policies: lessons from NDS regime VARUN GUPTA University of Chicago Based on works with : Neil Walton, Jiheng Zhang ρ K θ is a useful regime to study the
More informationClass 8 Customers (Im)Patience & Abandonment; Hazard Rates
Service Engineering Class 8 Customers (Im)Patience & Abandonment; Hazard Rates 14-Years Modeling Gallery. Customers (Im)Patience: Introduction. Understanding (Im)Patience: Observing, Describing, Managing,
More informationA STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL
A STAFFING ALGORITHM FOR CALL CENTERS WITH SKILL-BASED ROUTING: SUPPLEMENTARY MATERIAL by Rodney B. Wallace IBM and The George Washington University rodney.wallace@us.ibm.com Ward Whitt Columbia University
More informationState Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems. J. G. Dai. Tolga Tezcan
State Space Collapse in Many-Server Diffusion imits of Parallel Server Systems J. G. Dai H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia
More informationQueueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA
1 / 26 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/25/17 2 / 26 Outline 1 Introduction 2 Queueing Notation 3 Transient
More informationMODELING WEBCHAT SERVICE CENTER WITH MANY LPS SERVERS
MODELING WEBCHAT SERVICE CENTER WITH MANY LPS SERVERS Jiheng Zhang Oct 26, 211 Model and Motivation Server Pool with multiple LPS servers LPS Server K Arrival Buffer. Model and Motivation Server Pool with
More informationManaging Call Centers with Many Strategic Agents
Managing Call Centers with Many Strategic Agents Rouba Ibrahim, Kenan Arifoglu Management Science and Innovation, UCL YEQT Workshop - Eindhoven November 2014 Work Schedule Flexibility 86SwofwthewqBestwCompanieswtowWorkwForqwofferw
More informationA How Hard are Steady-State Queueing Simulations?
A How Hard are Steady-State Queueing Simulations? ERIC CAO NI and SHANE G. HENDERSON, Cornell University Some queueing systems require tremendously long simulation runlengths to obtain accurate estimators
More informationNon Markovian Queues (contd.)
MODULE 7: RENEWAL PROCESSES 29 Lecture 5 Non Markovian Queues (contd) For the case where the service time is constant, V ar(b) = 0, then the P-K formula for M/D/ queue reduces to L s = ρ + ρ 2 2( ρ) where
More informationChapter 5: Special Types of Queuing Models
Chapter 5: Special Types of Queuing Models Some General Queueing Models Discouraged Arrivals Impatient Arrivals Bulk Service and Bulk Arrivals OR37-Dr.Khalid Al-Nowibet 1 5.1 General Queueing Models 1.
More informationSolutions to COMP9334 Week 8 Sample Problems
Solutions to COMP9334 Week 8 Sample Problems Problem 1: Customers arrive at a grocery store s checkout counter according to a Poisson process with rate 1 per minute. Each customer carries a number of items
More informationA Semi-parametric Bayesian Framework for Performance Analysis of Call Centers
Proceedings 59th ISI World Statistics Congress, 25-30 August 2013, Hong Kong (Session STS065) p.2345 A Semi-parametric Bayesian Framework for Performance Analysis of Call Centers Bangxian Wu and Xiaowei
More informationMarkovian N-Server Queues (Birth & Death Models)
Markovian -Server Queues (Birth & Death Moels) - Busy Perio Arrivals Poisson (λ) ; Services exp(µ) (E(S) = /µ) Servers statistically ientical, serving FCFS. Offere loa R = λ E(S) = λ/µ Erlangs Q(t) = number
More informationOnline Supplement to Delay-Based Service Differentiation with Many Servers and Time-Varying Arrival Rates
Online Supplement to Delay-Based Service Differentiation with Many Servers and Time-Varying Arrival Rates Xu Sun and Ward Whitt Department of Industrial Engineering and Operations Research, Columbia University
More informationQueues with Many Servers and Impatient Customers
MATHEMATICS OF OPERATIOS RESEARCH Vol. 37, o. 1, February 212, pp. 41 65 ISS 364-765X (print) ISS 1526-5471 (online) http://dx.doi.org/1.1287/moor.111.53 212 IFORMS Queues with Many Servers and Impatient
More informationA DIFFUSION APPROXIMATION FOR THE G/GI/n/m QUEUE
A DIFFUSION APPROXIMATION FOR THE G/GI/n/m QUEUE by Ward Whitt Department of Industrial Engineering and Operations Research Columbia University, New York, NY 10027 July 5, 2002 Revision: June 27, 2003
More informationBIRTH DEATH PROCESSES AND QUEUEING SYSTEMS
BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS Andrea Bobbio Anno Accademico 999-2000 Queueing Systems 2 Notation for Queueing Systems /λ mean time between arrivals S = /µ ρ = λ/µ N mean service time traffic
More informationA Diffusion Approximation for the G/GI/n/m Queue
OPERATIONS RESEARCH Vol. 52, No. 6, November December 2004, pp. 922 941 issn 0030-364X eissn 1526-5463 04 5206 0922 informs doi 10.1287/opre.1040.0136 2004 INFORMS A Diffusion Approximation for the G/GI/n/m
More informationStabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals
Submitted to Operations Research manuscript OPRE-29-6-259; OPRE-211-12-597.R1 Stabilizing Customer Abandonment in Many-Server Queues with -Varying Arrivals Yunan Liu Department of Industrial Engineering,
More informationA multi-class fluid model for a contact center with skill-based routing
Int. J. Electron. Commun. (AEÜ) ( ) www.elsevier.de/aeue A multi-class fluid model for a contact center with skill-based routing Ward Whitt Department of Industrial Engineering and Operations Research,
More informationA Fluid Approximation for Service Systems Responding to Unexpected Overloads
OPERATIONS RESEARCH Vol. 59, No. 5, September October 2011, pp. 1159 1170 issn 0030-364X eissn 1526-5463 11 5905 1159 http://dx.doi.org/10.1287/opre.1110.0985 2011 INFORMS A Fluid Approximation for Service
More informationStabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals
OPERATIONS RESEARCH Vol. 6, No. 6, November December 212, pp. 1551 1564 ISSN 3-364X (print) ISSN 1526-5463 (online) http://dx.doi.org/1.1287/opre.112.114 212 INFORMS Stabilizing Customer Abandonment in
More informationFigure 10.1: Recording when the event E occurs
10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable
More informationStochastic Networks and Parameter Uncertainty
Stochastic Networks and Parameter Uncertainty Assaf Zeevi Graduate School of Business Columbia University Stochastic Processing Networks Conference, August 2009 based on joint work with Mike Harrison Achal
More informationService-Level Differentiation in Many-Server Service Systems: A Solution Based on Fixed-Queue-Ratio Routing
Service-Level Differentiation in Many-Server Service Systems: A Solution Based on Fixed-Queue-Ratio Routing Itay Gurvich Ward Whitt October 13, 27 Abstract Motivated by telephone call centers, we study
More informationWe study a capacity sizing problem in a service system that is modeled as a single-class queue with multiple
MANAGEMENT SCIENCE Vol. 56, No. 1, October 21, pp. 1668 1686 issn 25-199 eissn 1526-551 1 561 1668 informs doi 1.1287/mnsc.11.123 21 INFORMS Capacity Sizing Under Parameter Uncertainty: Safety Staffing
More informationContact Centers with a Call-Back Option and Real-Time Delay Information
OPERATIOS RESEARCH Vol. 52, o. 4, July August 2004, pp. 527 545 issn 0030-364X eissn 526-5463 04 5204 0527 informs doi 0.287/opre.040.023 2004 IFORMS Contact Centers with a Call-Back Option and Real-Time
More informationLink Models for Circuit Switching
Link Models for Circuit Switching The basis of traffic engineering for telecommunication networks is the Erlang loss function. It basically allows us to determine the amount of telephone traffic that can
More informationMaking Delay Announcements
Making Delay Announcements Performance Impact and Predicting Queueing Delays Ward Whitt With Mor Armony, Rouba Ibrahim and Nahum Shimkin March 7, 2012 Last Class 1 The Overloaded G/GI/s + GI Fluid Queue
More informationOn First Come, First Served Queues with Two Classes of Impatient Customers
Noname manuscript No. (will be inserted by the editor) On First Come, First Served Queues with Two Classes of Impatient Customers Ivo Adan Brett Hathaway Vidyadhar G. Kulkarni Received: date / Accepted:
More informationDesign heuristic for parallel many server systems under FCFS-ALIS Adan, I.J.B.F.; Boon, M.A.A.; Weiss, G.
Design heuristic for parallel many server systems under FCFS-ALIS Adan, I.J.B.F.; Boon, M.A.A.; Weiss, G. Published in: arxiv Published: 04/03/2016 Document Version Accepted manuscript including changes
More informationExercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010
Exercises Stochastic Performance Modelling Hamilton Institute, Summer Instruction Exercise Let X be a non-negative random variable with E[X ]
More informationElectronic Companion Fluid Models for Overloaded Multi-Class Many-Server Queueing Systems with FCFS Routing
Submitted to Management Science manuscript MS-251-27 Electronic Companion Fluid Models for Overloaded Multi-Class Many-Server Queueing Systems with FCFS Routing Rishi Talreja, Ward Whitt Department of
More informationDataMOCCA. Data MOdels for Call Center Analysis
4 The SEE Center - Project DataMOCCA Page 1 of 1 DataMOCCA Data MOdels for Call Center Analysis Project Collaborators: Technion: Wharton: Companies: Paul Feigin, Avi Mandelbaum Technion SEElab: Valery
More informationWe consider how two networked large-scale service systems that normally operate separately, such as call
MANAGEMENT SCIENCE Vol. 55, No. 8, August 2009, pp. 1353 1367 issn 0025-1909 eissn 1526-5501 09 5508 1353 informs doi 10.1287/mnsc.1090.1025 2009 INFORMS Responding to Unexpected Overloads in Large-Scale
More informationCS418 Operating Systems
CS418 Operating Systems Lecture 14 Queuing Analysis Textbook: Operating Systems by William Stallings 1 1. Why Queuing Analysis? If the system environment changes (like the number of users is doubled),
More informationFluid Limit of A Many-Server Queueing Network with Abandonment
Fluid Limit of A Many-Server Queueing Networ with Abandonment Weining Kang Guodong Pang October 22, 213 Abstract This paper studies a non-marovian many-server queueing networ with abandonment, where externally
More informationPerformance Evaluation of Queuing Systems
Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems
More informationQueuing Theory. 3. Birth-Death Process. Law of Motion Flow balance equations Steady-state probabilities: , if
1 Queuing Theory 3. Birth-Death Process Law of Motion Flow balance equations Steady-state probabilities: c j = λ 0λ 1...λ j 1 µ 1 µ 2...µ j π 0 = 1 1+ j=1 c j, if j=1 c j is finite. π j = c j π 0 Example
More informationBeyond heavy-traffic regimes: Universal bounds and controls for the single-server (M/GI/1+GI) queue
1 / 33 Beyond heavy-traffic regimes: Universal bounds and controls for the single-server (M/GI/1+GI) queue Itai Gurvich Northwestern University Junfei Huang Chinese University of Hong Kong Stochastic Networks
More informationService-Level Differentiation in Many-Server Service Systems Via Queue-Ratio Routing
Submitted to Operations Research manuscript (Please, provide the mansucript number!) Service-Level Differentiation in Many-Server Service Systems Via Queue-Ratio Routing Itay Gurvich Kellogg School of
More informationModeling Service Networks with Time-Varying Demand
Modeling Service with Time-Varying Demand - Performance Approximations and Staffing Controls (with Beixiang He, Liam Huang, Korhan Aras, Ward Whitt) Department of Industrial and Systems Engineering NC
More informationSingle-Server Service-Station (G/G/1)
Service Engineering July 997 Last Revised January, 006 Single-Server Service-Station (G/G/) arrivals queue 000000000000 000000000000 departures Arrivals A = {A(t), t 0}, counting process, e.g., completely
More informationDynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement
Submitted to imanufacturing & Service Operations Management manuscript MSOM-11-370.R3 Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement (Authors names blinded
More informationStein s Method for Steady-State Approximations: Error Bounds and Engineering Solutions
Stein s Method for Steady-State Approximations: Error Bounds and Engineering Solutions Jim Dai Joint work with Anton Braverman and Jiekun Feng Cornell University Workshop on Congestion Games Institute
More informationREAL-TIME DELAY ESTIMATION BASED ON DELAY HISTORY IN MANY-SERVER SERVICE SYSTEMS WITH TIME-VARYING ARRIVALS
REAL-TIME DELAY ESTIMATION BASED ON DELAY HISTORY IN MANY-SERVER SERVICE SYSTEMS WITH TIME-VARYING ARRIVALS by Rouba Ibrahim and Ward Whitt IEOR Department Columbia University 500 West 120th Street 313
More informationLoad Balancing in Distributed Service System: A Survey
Load Balancing in Distributed Service System: A Survey Xingyu Zhou The Ohio State University zhou.2055@osu.edu November 21, 2016 Xingyu Zhou (OSU) Load Balancing November 21, 2016 1 / 29 Introduction and
More informationAsymptotic Coupling of an SPDE, with Applications to Many-Server Queues
Asymptotic Coupling of an SPDE, with Applications to Many-Server Queues Mohammadreza Aghajani joint work with Kavita Ramanan Brown University March 2014 Mohammadreza Aghajanijoint work Asymptotic with
More informationSTAFFING A CALL CENTER WITH UNCERTAIN ARRIVAL RATE AND ABSENTEEISM
STAFFING A CALL CENTER WITH UNCERTAIN ARRIVAL RATE AND ABSENTEEISM by Ward Whitt Department of Industrial Engineering and Operations Research Columbia University, New York, NY 10027 6699 Abstract This
More informationλ λ λ In-class problems
In-class problems 1. Customers arrive at a single-service facility at a Poisson rate of 40 per hour. When two or fewer customers are present, a single attendant operates the facility, and the service time
More informationLecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking
Lecture 7: Simulation of Markov Processes Pasi Lassila Department of Communications and Networking Contents Markov processes theory recap Elementary queuing models for data networks Simulation of Markov
More information1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours)
1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours) Student Name: Alias: Instructions: 1. This exam is open-book 2. No cooperation is permitted 3. Please write down your name
More informationAppendix. A. Simulation study on the effect of aggregate data
36 Article submitted to Operations Research; manuscript no. Appendix A. Simulation study on the effect of aggregate data One of the main limitations of our data are that they are aggregate at the annual
More informationOverflow Networks: Approximations and Implications to Call-Center Outsourcing
Overflow Networks: Approximations and Implications to Call-Center Outsourcing Itai Gurvich (Northwestern University) Joint work with Ohad Perry (CWI) Call Centers with Overflow λ 1 λ 2 Source of complexity:
More informationP (L d k = n). P (L(t) = n),
4 M/G/1 queue In the M/G/1 queue customers arrive according to a Poisson process with rate λ and they are treated in order of arrival The service times are independent and identically distributed with
More informationLittle s result. T = average sojourn time (time spent) in the system N = average number of customers in the system. Little s result says that
J. Virtamo 38.143 Queueing Theory / Little s result 1 Little s result The result Little s result or Little s theorem is a very simple (but fundamental) relation between the arrival rate of customers, average
More informationAdvanced Computer Networks Lecture 3. Models of Queuing
Advanced Computer Networks Lecture 3. Models of Queuing Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/13 Terminology of
More informationTHE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS. S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974
THE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS by S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT This note describes a simulation experiment involving
More informationQueueing Theory (Part 4)
Queueing Theory (Part 4) Nonexponential Queueing Systems and Economic Analysis Queueing Theory-1 Queueing Models with Nonexponential Distributions M/G/1 Model Poisson input process, general service time
More informationDELAY PREDICTORS FOR CUSTOMER SERVICE SYSTEMS WITH TIME-VARYING PARAMETERS. Rouba Ibrahim Ward Whitt
Proceedings of the 21 Winter Simulation Conference B. Johansson, S. Jain, J. Montoya-Torres, J. Hugan, and E. Yücesan, eds. DELAY PREDICTORS FOR CUSTOMER SERVICE SYSTEMS WITH TIME-VARYING PARAMETERS Rouba
More informationSince D has an exponential distribution, E[D] = 0.09 years. Since {A(t) : t 0} is a Poisson process with rate λ = 10, 000, A(0.
IEOR 46: Introduction to Operations Research: Stochastic Models Chapters 5-6 in Ross, Thursday, April, 4:5-5:35pm SOLUTIONS to Second Midterm Exam, Spring 9, Open Book: but only the Ross textbook, the
More informationQueueing Theory II. Summary. ! M/M/1 Output process. ! Networks of Queue! Method of Stages. ! General Distributions
Queueing Theory II Summary! M/M/1 Output process! Networks of Queue! Method of Stages " Erlang Distribution " Hyperexponential Distribution! General Distributions " Embedded Markov Chains M/M/1 Output
More informationλ, µ, ρ, A n, W n, L(t), L, L Q, w, w Q etc. These
Queuing theory models systems with servers and clients (presumably waiting in queues). Notation: there are many standard symbols like λ, µ, ρ, A n, W n, L(t), L, L Q, w, w Q etc. These represent the actual
More informationHEAVY-TRAFFIC LIMITS VIA AN AVERAGING PRINCIPLE FOR SERVICE SYSTEMS RESPONDING TO UNEXPECTED OVERLOADS OHAD PERRY
HEAVY-TRAFFIC LIMITS VIA AN AVERAGING PRINCIPLE FOR SERVICE SYSTEMS RESPONDING TO UNEXPECTED OVERLOADS OHAD PERRY Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy
More informationDynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement
Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement Wyean Chan DIRO, Université de Montréal, C.P. 6128, Succ. Centre-Ville, Montréal (Québec), H3C 3J7, CANADA,
More informationBlind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers
OPERATIONS RESEARCH Vol. 6, No., January February 23, pp. 228 243 ISSN 3-364X (print) ISSN 526-5463 (online) http://dx.doi.org/.287/opre.2.29 23 INFORMS Blind Fair Routing in Large-Scale Service Systems
More information