Designing a Telephone Call Center with Impatient Customers
|
|
- Brendan Copeland
- 6 years ago
- Views:
Transcription
1 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
2 M/M/ + M System Poisson arrivals-rate λ Service times exp(µ statistically identical agents attending to single queue Service policy FCFS Customers patience: exp(θ Q = {Q(t, t } - number of customers in the system Birth & Death: transition diagram Everything calculable via stationary distribution (λ/µ k π k k! π k = k ( λ (λ/µ π k > µ + (j θ! j=+ where π = (λ/µ k k ( λ (λ/µ + k! µ + (j θ! k= k=+ j=+ 2
3 M/M/ + M Characteristics otation: P {Ab} - abandonment probability (fraction P {W ait > } - waiting probability (fraction P {Block} - blocking probability in an M/M// system. Stationary distribution always exists (Sandwiched between infinite-server models 2. P {Ab} = θ E[W ait] Proof: λp {Ab} = θ E[umber in queue], now use Little. 3. P {Ab} increases monotonically in θ, λ P {Ab} decreases monotonically in, µ (Bhattacharya and Ephremides (99 4. P {Ab} P {Block} (Boxma and de Waal ( lim P {Ab} = ( lim ρ 3
4 Exact Calculations V - virtual waiting time = waiting time of a customer with infinite patience (test customer. X - customer s patience (X exp(θ, independent of V. Wait V X - actual waiting time. Performance measures of the form E[f(V, X]: Calculable, in numerically stable procedures (4CallCenters. f(v, x E[f(V, X] {v>x} P {V > X} = P {Ab} (t, (v x P {W ait > t} (t, (v x {v>x} P {W ait > t; Ab} (v x {v>x} E[W ait; Ab] (v x (t, (v x {v>x} E[W ait; W ait > t; Ab] g(v x E[g(W ait] From these obtain more natural measures, for example P {Ab W ait > t} = P {W ait > t; Ab} P {W ait > t} 4
5 QED M/M/ + M (θ θ Following Halfin-Whitt (98 and Flemming-Simon-Stolyar (996 Theorem: Let α lim P {W ait > } β lim ( ρ λ µ + β λ µ γ lim P {Ab} P {Ab} γ Then > α > iff > β > iff > γ > in which case α = w( β, µ/θ [ ] γ = θ/µ h(β µ/θ β α Here w(x, y = h(x = [ + h( xy ], yh(x φ(x, hazard rate of std. normal Φ(x 5
6 Designing a QED Call Center (Zeltyn (Approximate Performance Measures P {W ait > } [ ] W ait E E[S] W ait > [ + h(rβ ] µ, r = rh( β θ r [h(rβ rβ] P {Ab} P {Ab W ait > } h(rβ rβ r h(rβ rβ r [ + h(rβ rh( β ] P { W ait E[S] > P { Ab t } W ait > W ait E[S] > t } [ ] W ait E E[S] Ab Φ (rβ + t/r Φ(rβ h(rβ + t/r rβ r [ ] 2 h(rβ rβ rβ r Here Φ(x = Φ(x, h(x = φ(x/ Φ(x, hazard rate of (,. 6
7 ew Operational Regimes (M/M/ + ρ P {Wait > } P {Ab} Efficiency driven Quality driven R ɛr + ɛ ɛ R + ɛr ɛ QED R + β R β α(β < β < < α < (β Compare with Previous (M/M/, Halfin-Whitt E R + ɛ ɛ Q R + ɛr + ɛ QED R + β R β α(β < β < < α < 7
8 Sequence of M/M/ + M, =, 2,... Motivation: Focus: Insight, umerical stability Large Call Centers λ, large. Framework: Sequence of M/M/ + M systems, indexed by Q = {Q (t, t }: total number in system; V = {V (t, t }: virtual wait of an infinite-patience customer Parameters λ, µ, θ θ θ θ θ impatient patient rational Offered load R = λ µ (ρ = R / Approximations of Process and Stationary Distribution ˆQ (t = [Q (t ], t ˆV (t = V (t 8
9 Approximating Queueing and Waiting Q = {Q (t, t } : Q (t = number in system at t. ˆQ = { ˆQ (t, t } : stochastic process obtained by centering and rescaling: ˆQ = Q ˆQ ( : stationary distribution of ˆQ ˆQ = { ˆQ(t, t } : process defined by: ˆQ (t d ˆQ(t. ˆQ (t t ˆQ ( ˆQ(t t Q( Approximating (Virtual Waiting Time ˆV = V ˆV = [ ] + µ ˆQ (Puhalskii, 994 9
10 Weak Convergence of Stationary Distribution Assume lim ( ρ = β, < β <. Allow θ to vary with. ˆQ ( converges iff at least one of the following prevails:. θ θ or θ 2. β > in which case ˆQ ( d ˆQ(, where Density function f(x of ˆQ( : θ, β > f(x = θ θ f(x = { A φ(β + x x A 2 exp( βx x > B φ(β + x x ( B 2 φ β µ/θ + x θ/µ x > θ f(x = { Cφ(β + x x x >
11 Weak Convergence of Processes ρ β ; λ µ + β λ µ Theorem: ˆQ d ˆQ if ˆQ ( d ˆQ(. Theorem: ˆV d ˆV d = µ ˆQ +. θ Patient d ˆQ(t = f( ˆQdt + 2µ db(t { µ(β + x x f(x = µβ x > ( OU ˆQ BM ˆQ > M/M/ Erlang C θ Impatient d ˆQ(t = µ(β + ˆQ(tdt + 2µ db(t dy (t Y ( =, Y, ˆQ dy = (ROU ˆQ M/M// Erlang B θ fixed Rational d ˆQ(t = f( ˆQdt + 2µ db(t { µ(β + x x f(x = (µβ + θx x > ( OU ˆQ OU ˆQ > (B - standard Brownian Motion (β - as before
12 Designing a Call Center - Selecting a Model Very impatient customers - M/M// model Very patient customers - M/M/ model Balanced abandoning - M/M/ + M, θ fixed What if General Patience with distribution function G? Steady-state formulae prevail with θ G (. 2
13 M/M/+G System Customers patience: general distribution G, with g = G (. Steady-State Results Baccelli & Hebuterne (98 - virtual wait, abandon probability. Brandt & Brandt (999, 22 - stationary-queue distribution. QED Regime Main Case: G( =, g > (no balking. µ Use M/M/ + M formulae: θ g, r =. g Hence, P{Ab} g E[W ]. Special Cases: Balking (G( >, g > ; g = : k-th derivative of G at zero positive, k 2 (Erlang, Phase-type; g = : Delayed patience distributions (const, c+exp(θ. Asymptotic analysis possible for all special cases, which yields varying convergence rates. 3
14 Appendix M/M/ + M : Strong Approximations Parameters: λ, µ, θ, Building Blocks: A i, independent Poisson ( processes Model: Q = {Q(t, t } total number in system Q(t = Q( +A (λt arrivals ( A 2 µ [Q(u ]du services ( A 3 θ [Q(u ] + du abandons Strong Approximations: on the same probability space with A i s, there are SBM B i s such that A i (t = t + B i (t + O(log t, t. Approximate Q by substituting above A i (t t + B i (t. 4
15 Approximation: Q(t = Q(t + o (, u.o.c., via A i (t t + B i (t Q(t = Q( + λt + B (λt ( µ [ Q(u ]du B 2 µ [ Q(u ]du ( θ [ Q(u ] + du B 3 θ [ Q(u ] + du Insight? Limit theorems (FSLL, FCLT as, for Q, hence for Q : For example, Q (t = Q (t + o(. 5
16 QED M/M/ + : Approximations, Limits For simplicity Q ( : all servers busy, no queue. Recall λ = µ µb, µ, θ Theorem: Strong Approximation. Q (t = + ˆQ(t + o ( u.o.c., as or [Q(t ] d ˆQ(t t, where d ˆQ(t = [ µβ + µ ˆQ (t θ ˆQ + (t ] dt + 2µ db(t ; namely ˆQ is a diffusion with µ(x = { µβ θx x µβ µx x, σ2 (x 2µ. FSLL Q (t u.o.c., a.s. FCLT [ Q ] = [Q ] d ˆQ 6
17 QED M/M/ + : FSLL Q (t = + λ t + B (λ t ( µ [ Q (u ]du B 2 µ [ Q (u ]du FSLL:... µ θ [ Q (u ] + du B 3 ( Q (t = + λ t + ( B λ t [ ] Q (u du ( [ ] B 2 µ Q (u du Observe and λ t µt B i(t since λ = µ µβ FSLL for SBM. If indeed Q (t Q(t, then Q(t = + µt µ [Q(u ]du θ which has a unique solution Q(t, t. [Q(u ] + du Theorem (FSL: As, Q (t u.o.c. a.s. Proof: Gronwall s inequality 7
18 QED M/M/: FCLT Q (t = + λ t + B (λ t ( µ [ Q (u]du B 2 µ [ Q (u]du θ [ Q (u ] + du B 3 ( FCLT ˆQ (t = [ Q (t ] = consists of the following ingredients:. µβt + ( B [µ β ] t 2. +µ t µ = µ 3. θ ˆQ (udu B 2 (µ [ ] Q (t [ ] Q (u du B 2 ( ˆQ + (udu B 3 ( θ [ Q (u Q + (udu ] du 8
19 Basic Properties of Brownian Motion Let B d = Standard Brownian Motion. Then, Self-similarity B(t d = B(t Additivity ( B i (C i t = d B C i t i i d = i C i B(t, if B i independent SBM Time-Change B( τ (t d B(τ(t, if τ d τ and, say, τ is continuous deterministic. 9
20 Recall. µβt + B [µ 2. +µ t µ = µ 3. θ ( β ] t ˆQ (udu B 2 (µ [ ] Q (u du B 2 ( ˆQ + (udu B 3 ( θ [ Q (u Q + (udu ] du If indeed ˆQ d ˆQ, then. d µβt + B (µt 2. d µ ˆQ (udu B 2 (µt 3. d θ ˆQ + (udu B 3 ( Theorem (FCLT As, ˆQ d ˆQ, where d ˆQ(t = [ µβ + µ ˆQ (t θ ˆQ + (t]dt + 2µ db(t 2
21 Customer-Focused Queueing Theory 2 abandonment in Direct-Banking ot scientific Reason to Abandon Actual Abandon Perceived Abandon Perception Time (sec Time (sec Ratio Fed up waiting (77% ot urgent (% Forced to (4% Something came up (6% Expected call-back (3% Rational Abandonment from Invisible Queues (with Shimkin. 2
Markovian 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 informationErlang-C = M/M/N. agents. queue ACD. arrivals. busy ACD. queue. abandonment BACK FRONT. lost calls. arrivals. lost calls
Erlang-C = M/M/N agents arrivals ACD queue Erlang-A lost calls FRONT BACK arrivals busy ACD queue abandonment lost calls Erlang-C = M/M/N agents arrivals ACD queue Rough Performance Analysis
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 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 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 informationDynamic 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationA Diffusion Approximation for Stationary Distribution of Many-Server Queueing System In Halfin-Whitt Regime
A Diffusion Approximation for Stationary Distribution of Many-Server Queueing System In Halfin-Whitt Regime Mohammadreza Aghajani joint work with Kavita Ramanan Brown University APS Conference, Istanbul,
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 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 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 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 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 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 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 informationMonotonicity Properties for Multiserver Queues with Reneging and Finite Waiting Lines
Monotonicity Properties for Multiserver Queues with Reneging and Finite Waiting Lines Oualid Jouini & Yves Dallery Laboratoire Génie Industriel, Ecole Centrale Paris Grande Voie des Vignes, 92295 Châtenay-Malabry
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 informationTechnical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance
Technical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance In this technical appendix we provide proofs for the various results stated in the manuscript
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 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 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 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 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 informationThe G/GI/N Queue in the Halfin-Whitt Regime I: Infinite Server Queue System Equations
The G/GI/ Queue in the Halfin-Whitt Regime I: Infinite Server Queue System Equations J. E Reed School of Industrial and Systems Engineering Georgia Institute of Technology October 17, 27 Abstract In this
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 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 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 informationTechnical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance
Technical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance In this technical appendix we provide proofs for the various results stated in the manuscript
More informationIEOR 6711, HMWK 5, Professor Sigman
IEOR 6711, HMWK 5, Professor Sigman 1. Semi-Markov processes: Consider an irreducible positive recurrent discrete-time Markov chain {X n } with transition matrix P (P i,j ), i, j S, and finite state space.
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 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 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 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 informationANALYTICAL AND EMPIRICAL INVESTIGATIONS OF TICKET QUEUES: IMPLICATIONS FOR SYSTEM PERFORMANCE, CUSTOMER PERCEPTIONS AND BEHAVIOR
The Pennsylvania State University The Graduate School The Smeal College of Business ANALYTICAL AND EMPIRICAL INVESTIGATIONS OF TICKET QUEUES: IMPLICATIONS FOR SYSTEM PERFORMANCE, CUSTOMER PERCEPTIONS AND
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 informationGI/M/1 and GI/M/m queuing systems
GI/M/1 and GI/M/m queuing systems Dmitri A. Moltchanov moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2716/ OUTLINE: GI/M/1 queuing system; Methods of analysis; Imbedded Markov chain approach; Waiting
More informationThe G t /GI/s t + GI Many-Server Fluid Queue: Longer Online Version with Appendix
Queueing Systems manuscript No. (will be inserted by the editor) January 4, 22 The G t /GI/s t + GI Many-Server Fluid Queue: Longer Online Version with Appendix Yunan Liu Ward Whitt Received: date / Accepted:
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 informationAuthor's personal copy
Queueing Syst (29) 63: 13 32 DOI 1.17/s11134-9-9132-y INVITED PAPER Heavy-traffic extreme value limits for Erlang delay models Guodong Pang Ward Whitt Received: 17 March 29 / Revised: 17 June 29 / Published
More informationIEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.
IEOR 6711: Stochastic Models I, Fall 23, Professor Whitt Solutions to Final Exam: Thursday, December 18. Below are six questions with several parts. Do as much as you can. Show your work. 1. Two-Pump Gas
More informationService Level Agreements in Call Centers: Perils and Prescriptions
Service Level Agreements in Call Centers: Perils and Prescriptions Joseph M. Milner Joseph L. Rotman School of Management University of Toronto Tava Lennon Olsen John M. Olin School of Business Washington
More informationOn the Resource/Performance Tradeoff in Large Scale Queueing Systems
On the Resource/Performance Tradeoff in Large Scale Queueing Systems David Gamarnik MIT Joint work with Patrick Eschenfeldt, John Tsitsiklis and Martin Zubeldia (MIT) High level comments High level comments
More informationCritically Loaded Time-Varying Multi-Server Queues: Computational Challenges and Approximations
Critically Loaded Time-Varying Multi-Server Queues: Computational Challenges and Approximations Young Myoung Ko Sabre Holdings, 315 Sabre Drive, Southlake, Texas 7692, USA, YoungMyoung.Ko@sabre.com Natarajan
More informationQueuing Theory. Richard Lockhart. Simon Fraser University. STAT 870 Summer 2011
Queuing Theory Richard Lockhart Simon Fraser University STAT 870 Summer 2011 Richard Lockhart (Simon Fraser University) Queuing Theory STAT 870 Summer 2011 1 / 15 Purposes of Today s Lecture Describe general
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 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 informationQueueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements
Queueing Systems: Lecture 3 Amedeo R. Odoni October 18, 006 Announcements PS #3 due tomorrow by 3 PM Office hours Odoni: Wed, 10/18, :30-4:30; next week: Tue, 10/4 Quiz #1: October 5, open book, in class;
More informationDelay Announcements. Predicting Queueing Delays for Delay Announcements. IEOR 4615, Service Engineering, Professor Whitt. Lecture 21, April 21, 2015
Delay Announcements Predicting Queueing Delays for Delay Announcements IEOR 4615, Service Engineering, Professor Whitt Lecture 21, April 21, 2015 OUTLINE Delay Announcements: Why, What and When? [Slide
More informationAnalysis of a Two-Phase Queueing System with Impatient Customers and Multiple Vacations
The Tenth International Symposium on Operations Research and Its Applications (ISORA 211) Dunhuang, China, August 28 31, 211 Copyright 211 ORSC & APORC, pp. 292 298 Analysis of a Two-Phase Queueing System
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 informationMANY-SERVER HEAVY-TRAFFIC LIMIT FOR QUEUES WITH TIME-VARYING PARAMETERS 1
The Annals of Applied Probability 214, Vol. 24, No. 1, 378 421 DOI: 1.1214/13-AAP927 Institute of Mathematical Statistics, 214 MANY-SERVER HEAVY-TRAFFIC LIMIT FOR QUEUES WITH TIME-VARYING PARAMETERS 1
More informationWAITING TIME ANALYSIS OF MULTI-CLASS QUEUES WITH IMPATIENT CUSTOMERS
WAITING TIME ANALYSIS OF MULTI-CLASS QUEUES WITH IMPATIENT CUSTOMERS Vahid Sarhangian University of Toronto, Joseph L. Rotman School of Management 15 St. George Street, Toronto, M5S 3E6, CANADA, vahid.sarhangian11@rotman.utoronto.ca
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 informationAPPENDIX to Stabilizing Performance in Many-Server Queues with Time-Varying Arrivals and Customer Feedback
APPENDIX to Stabilizing Performance in Many-Server Queues with -Varying Arrivals and Customer Feedback Yunan Liu and Ward Whitt Department of Industrial Engineering North Carolina State University Raleigh,
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 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 informationIntroduction to Markov Chains, Queuing Theory, and Network Performance
Introduction to Markov Chains, Queuing Theory, and Network Performance Marceau Coupechoux Telecom ParisTech, departement Informatique et Réseaux marceau.coupechoux@telecom-paristech.fr IT.2403 Modélisation
More informationPart I Stochastic variables and Markov chains
Part I Stochastic variables and Markov chains Random variables describe the behaviour of a phenomenon independent of any specific sample space Distribution function (cdf, cumulative distribution function)
More informationMany-Server Loss Models with Non-Poisson Time-Varying Arrivals
Many-Server Loss Models with Non-Poisson Time-Varying Arrivals Ward Whitt, Jingtong Zhao Department of Industrial Engineering and Operations Research, Columbia University, New York, New York 10027 Received
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 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 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 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 informationIntroduction to queuing theory
Introduction to queuing theory Queu(e)ing theory Queu(e)ing theory is the branch of mathematics devoted to how objects (packets in a network, people in a bank, processes in a CPU etc etc) join and leave
More informationData analysis and stochastic modeling
Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt
More informationStability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk
Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk ANSAPW University of Queensland 8-11 July, 2013 1 Outline (I) Fluid
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 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 informationStationary Analysis of a Multiserver queue with multiple working vacation and impatient customers
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 932-9466 Vol. 2, Issue 2 (December 207), pp. 658 670 Applications and Applied Mathematics: An International Journal (AAM) Stationary Analysis of
More information(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?
IEOR 3106: Introduction to Operations Research: Stochastic Models Fall 2006, Professor Whitt SOLUTIONS to Final Exam Chapters 4-7 and 10 in Ross, Tuesday, December 19, 4:10pm-7:00pm Open Book: but only
More informationAuthor's personal copy
Queueing Syst (215) 81:341 378 DOI 1.17/s11134-15-9462-x Stabilizing performance in a single-server queue with time-varying arrival rate Ward Whitt 1 Received: 5 July 214 / Revised: 7 May 215 / Published
More informationCross-Selling in a Call Center with a Heterogeneous Customer Population. Technical Appendix
Cross-Selling in a Call Center with a Heterogeneous Customer opulation Technical Appendix Itay Gurvich Mor Armony Costis Maglaras This technical appendix is dedicated to the completion of the proof of
More informationStatistics 150: Spring 2007
Statistics 150: Spring 2007 April 23, 2008 0-1 1 Limiting Probabilities If the discrete-time Markov chain with transition probabilities p ij is irreducible and positive recurrent; then the limiting probabilities
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 informationStochastic grey-box modeling of queueing systems: fitting birth-and-death processes to data
Queueing Syst (2015) 79:391 426 DOI 10.1007/s11134-014-9429-3 Stochastic grey-box modeling of queueing systems: fitting birth-and-death processes to data James Dong Ward Whitt Received: 8 January 2014
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 informationOn Multiple-Priority Multi-Server Queues with Impatience
On Multiple-Priority Multi-Server Queues with Impatience Oualid Jouini 1 & Alex Roubos 2 1 Ecole Centrale Paris, Laboratoire Génie Industriel, Grande Voie des Vignes, 92290 Châtenay-Malabry, France 2 VU
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 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 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 informationWAITING TIME IN THE M/M/m/(m + c) QUEUE WITH IMPATIENT CUSTOMERS
International Journal of Pure and Applied Mathematics Volume 9 No. 4 214, 519-559 ISSN: 1311-88 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/1.12732/ijpam.v9i4.13
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 informationNew Perspectives on the Erlang-A Queue
New Perspectives on the Erlang-A Queue arxiv:1712.8445v1 [math.pr] 22 Dec 217 Andrew Daw School of Operations Research and Information Engineering Cornell University 257 Rhodes Hall, Ithaca, NY 14853 amd399@cornell.edu
More information