The M/M/n+G Queue: Summary of Performance Measures
|
|
- Alice Paul
- 5 years ago
- Views:
Transcription
1 The M/M/n+G Queue: Summary of Performance Measures Avishai Mandelbaum and Sergey Zeltyn Faculty of Industrial Engineering & Management Technion Haifa 32 ISRAEL s: January 6 29 Contents M/M/n+G: primitives and building blocks. Special case. Deterministic patience (M/M/n+D Special case. Exponential patience (M/M/n+M Erlang-A Performance measures exact formulae 4 3 Performance measures QED approximations 5 4 Performance measures efficiency-driven approximations 6 5 Guidelines for applications 7 5. Exact formulae: numerical calculations QED approximation Efficiency-driven approximation Acknowledgements. The research of both authors was supported by BSF (Binational Science Foundation grant 2685/2575 ISF (Israeli Science Foundation grants 388/99 26/2 and 46/4 the Niderzaksen Fund and by the Technion funds for the promotion of research and sponsored research.
2 M/M/n+G: primitives and building blocks Primitives: arrival rate µ service rate (= reciprocal of average service time n number of servers G patience distribution (Ḡ = G : survival function. queue arrivals abandonment G agents 2 n µ Building blocks. Define Let H(x = x Ḡ(udu. In addition let and Finally introduce J = exp H(x nµx} dx J = x exp H(x nµx} dx J H = H(x exp H(x nµx} dx. J(t = J H (t = t t E = exp H(x nµx} dx H(x exp H(x nµx} dx. n j ( j! µ j= n. (n! ( µ
3 . Special case. Deterministic patience (M/M/n+D. Patience times equal to a constant D. Then H(x = x x D D x > D. If nµ J H (t = J(t = J = J H = J = nµ nµ(nµ e (nµ D nµ e (nµ t nµ(nµ e (nµ D t < D nµ ed nµt t D (nµ 2 (nµ 2 (nµ 2 + D nµ(nµ e (nµ D (nµ 2 D e (nµ D nµ(nµ e (nµ D (nµ 2 e (nµ t e (nµ D + t nµ e (nµ t D nµ(nµ e (nµ D t < D D nµ ed nµt t D If nµ = J(t = J J = D + nµ D t + nµ t < D nµ ed nµt t D = D2 2 + D nµ + (nµ 2 J H (t = J H = D2 2 + D nµ D 2 t 2 + D 2 nµ t < D D nµ ed nµt t D 2
4 .2 Special case. Exponential patience (M/M/n+M Erlang-A. Patience times are iid exp(θ. Then Define the incomplete Gamma function H(x = θ ( e θx. γ(x y = y t x e t dt x > y. (γ(x y can be calculated in Matlab. Then } J = exp θ θ } J(t = exp θ θ ( ( θ θ nµ γ nµ θ θ ( ( θ θ nµ γ nµ } J H = J θ exp ( θ θ θ 2 } J H (t = J(t exp ( θ θ θ θ 2 θ θ e θt nµ θ + γ ( nµ θ + θ nµ θ + γ ( nµ θ + θ e θt Remark. J cannot be expressed via the incomplete Gamma function. Consequently formulae that involve J (see the next page must be calculated either numerically or by approximations as discussed in the sequel. 3
5 2 Performance measures exact formulae Many important performance measures of the M/M/n+G queue can be conveniently expressed via the building blocks above. Define PAb} probability to abandon PSr} probability to be served Q queue length W waiting time V offered wait (time that a customer with infinite patience would wait. Then PV > } = J E + J PW > } = J E + J Ḡ( PAb} = + ( nµj E + J PSr} = E + nµj E + J EV = J E + J EW = J H E + J EQ = 2 J H E + J EW Ab = J + J H nµj ( nµj + EW Sr = nµj J E + nµj PW > t} = Ḡ(tJ(t E + J EW W > t = J H(t (H(t tḡ(t J(t Ḡ(tJ(t PAb W > t} = nµ exph(t nµt} + Ḡ(t. 4
6 3 Performance measures QED approximations Definitions and assumptions: Patience-time density at the origin is positive: G ( = g >. Arrival rate and the number of agents is given by n = µ + β µ + o( < β <. Let Φ(x cumulative distribution function of the standard normal distribution (mean= std= Φ(x survival function ( Φ = Φ φ(x = Φ (x density h(x = φ(x/ Φ(x hazard rate. Approximation formulae: Use β = PV > } PW > } ( n / µ µ µ ˆβ = β. g g + µ h( ˆβ h( β PAb} h( ˆβ ˆβ µ h( ˆβ + n g h( β EV EW EW Sr h( n g ˆβ ˆβ µ E W P Ab EW Ab n 2 g µ P W > W > W > EQ n µ h( g ˆβ ˆβ t } n t n t } n + g µ n n g µ g µ + g h( ˆβ ˆβ ˆβ µ + g h( ˆβ h( β h( ˆβ h( β h( ˆβ h( β Φ ( ˆβ + g µ t Φ( ˆβ ( h ˆβ + g µ t ˆβ ( h ˆβ + g µ t ˆβ. Remark. For exp(θ patience (Erlang-A simply replace g in the formulae above by θ. (Equivalently let g be the reciprocal of the average service time. 5
7 4 Performance measures efficiency-driven approximations Definitions and assumptions: Arrival rate and the number of agents is given by n = ( γ + o( γ >. µ Assume that the equation G(x = γ has a unique solution x namely G(x = γ or x = G (γ. Approximation formulae. PV > } PW > } PAb} γ PSr} γ EV x EW H(x EW Sr x EW Ab H(x x ( γ γ nµ EQ γ H(x Ḡ(t t < x PW > t} t > x EW W > t t + H(x H(t t < x Ḡ(t PAb W > t} γ G(t t < x. Ḡ(t 6
8 5 Guidelines for applications 5. Exact formulae: numerical calculations The central issue is the computation of the building blocks (see the first page. Calculations for J J and J H require two-stage integration which numerically could be time-consuming. However H(x (the inner integral often has a closed analytical form (as in the Exponential and Deterministic cases and one is left with the external integrals that as a rule are to be evaluated numerically. External integration: requires non-trivial programming for n = s. (We did not go above n =. Special attention should be given to the approximation of integrals with -upperlimit by finite-upper limits. For calculating E define and use recursion ( j kj= j! µ E k = ( k k µ k! E = ; E k = + kµ E k k n ; E = E n. 5.2 QED approximation Can be performed using any software that provides the standard normal distribution (e.g. Excel. This approximation works well for Number of servers n from s to s; Agents highly utilized but not overloaded ( 9-95%; Probability of delay -9%; Probability to abandon: 3-7% for small n -4% for large n. 5.3 Efficiency-driven approximation Requires solving the equation G(x = γ as well as integration (calculating H(x. Both can be performed either numerically or analytically depending on the patience distribution. This works well for Number of servers n. (One can cautiously use n= s if the probability to abandon is large (>%. Agents very highly utilized (>95%; Probability of delay: more than 85%; Probability to abandon: more than 5%. 7
Internet 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationDesign and evaluation of overloaded service systems with skill based routing, under FCFS policies
Design and evaluation of overloaded service systems with skill based routing, under FCFS policies Ivo Adan Marko Boon Gideon Weiss April 2, 2013 Abstract We study an overloaded service system with servers
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 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 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 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 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 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 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 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 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 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 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 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 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 informationStatistical Analysis of a Telephone Call Center
University of Pennsylvania ScholarlyCommons Operations, Information and Decisions Papers Wharton Faculty Research 2005 Statistical Analysis of a Telephone Call Center Lawrence D. Brown University of Pennsylvania
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 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 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 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 informationRandom Walk on a Graph
IOR 67: Stochastic Models I Second Midterm xam, hapters 3 & 4, November 2, 200 SOLUTIONS Justify your answers; show your work.. Random Walk on a raph (25 points) Random Walk on a raph 2 5 F B 3 3 2 Figure
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 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 informationStatistical Analysis of a Telephone Call Center: A Queueing-Science Perspective
Statistical Analysis of a Telephone Call Center: A Queueing-Science Perspective Lawrence Brown, Noah Gans, Avishai Mandelbaum, Anat Sakov, Haipeng Shen, Sergey Zeltyn and Linda Zhao November 9, 2002 Corresponding
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 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 informationControl of Fork-Join Networks in Heavy-Traffic
in Heavy-Traffic Asaf Zviran Based on MSc work under the guidance of Rami Atar (Technion) and Avishai Mandelbaum (Technion) Industrial Engineering and Management Technion June 2010 Introduction Network
More informationStatistical Analysis of a Telephone Call Center: A Queueing-Science Perspective
Statistical Analysis of a Telephone Call Center: A Queueing-Science Perspective Lawrence BROWN, Noah GANS, Avishai MANDELBAUM, Anat SAKOV, Haipeng SHEN, Sergey ZELTYN, and Linda ZHAO A call center is a
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 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 informationDefinition 1.1 (Parametric family of distributions) A parametric distribution is a set of distribution functions, each of which is determined by speci
Definition 1.1 (Parametric family of distributions) A parametric distribution is a set of distribution functions, each of which is determined by specifying one or more values called parameters. The number
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 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 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 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 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 informationNitzan Carmeli. MSc Advisors: Prof. Haya Kaspi, Prof. Avishai Mandelbaum Empirical Support: Dr. Galit Yom-Tov
Nitzan Carmeli MSc Advisors: Prof. Haya Kaspi, Prof. Avishai Mandelbaum Empirical Support: Dr. Galit Yom-Tov Industrial Engineering and Management Technion 23.06.2014 1 Introduction o Interactive Voice
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 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 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 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 informationIntroduction to Queuing Networks Solutions to Problem Sheet 3
Introduction to Queuing Networks Solutions to Problem Sheet 3 1. (a) The state space is the whole numbers {, 1, 2,...}. The transition rates are q i,i+1 λ for all i and q i, for all i 1 since, when a bus
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 informationSOLUTIONS IEOR 3106: Second Midterm Exam, Chapters 5-6, November 8, 2012
SOLUTIONS IEOR 3106: Second Midterm Exam, Chapters 5-6, November 8, 2012 This exam is closed book. YOU NEED TO SHOW YOUR WORK. Honor Code: Students are expected to behave honorably, following the accepted
More informationWAITING TIME IN THE M/M/m FCFS NONPREEMPTIVE PRIORITY QUEUE WITH IMPATIENT CUSTOMERS
International Journal of Pure and Applied Mathematics Volume 97 No. 3 2014, 311-344 ISSN: 1311-8080 printed version); ISSN: 1314-3395 on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v97i3.5
More information2905 Queueing Theory and Simulation PART III: HIGHER DIMENSIONAL AND NON-MARKOVIAN QUEUES
295 Queueing Theory and Simulation PART III: HIGHER DIMENSIONAL AND NON-MARKOVIAN QUEUES 16 Queueing Systems with Two Types of Customers In this section, we discuss queueing systems with two types of customers.
More informationContinuous-Time Markov Chain
Continuous-Time Markov Chain Consider the process {X(t),t 0} with state space {0, 1, 2,...}. The process {X(t),t 0} is a continuous-time Markov chain if for all s, t 0 and nonnegative integers i, j, x(u),
More information2905 Queueing Theory and Simulation PART IV: SIMULATION
2905 Queueing Theory and Simulation PART IV: SIMULATION 22 Random Numbers A fundamental step in a simulation study is the generation of random numbers, where a random number represents the value of a random
More informationWait-Time Predictors for Customer Service Systems with Time-Varying Demand and Capacity
OPERATIONS RESEARCH Vol. 59, No. 5, September October 211, pp. 116 1118 issn 3-364X eissn 1526-5463 11 595 116 http://dx.doi.org/1.1287/opre.111.974 211 INFORMS Wait-Time Predictors for Customer Service
More informationA Simple Solution for the M/D/c Waiting Time Distribution
A Simple Solution for the M/D/c Waiting Time Distribution G.J.Franx, Universiteit van Amsterdam November 6, 998 Abstract A surprisingly simple and explicit expression for the waiting time distribution
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 informationThe effect of probabilities of departure with time in a bank
International Journal of Scientific & Engineering Research, Volume 3, Issue 7, July-2012 The effect of probabilities of departure with time in a bank Kasturi Nirmala, Shahnaz Bathul Abstract This paper
More informationQueuing Theory. Using the Math. Management Science
Queuing Theory Using the Math 1 Markov Processes (Chains) A process consisting of a countable sequence of stages, that can be judged at each stage to fall into future states independent of how the process
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 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 informationErlang-S: A Data-Based Model of Servers in Queueing Networks
Erlang-S: A Data-Based Model of Servers in Queueing Networks David Azriel, Paul D. Feigin, Avishai Mandelbaum. January 15, 2017 Abstract Classical queueing theory has typically focused on customers, while
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 informationISE/OR 762 Stochastic Simulation Techniques
ISE/OR 762 Stochastic Simulation Techniques Topic 0: Introduction to Discrete Event Simulation Yunan Liu Department of Industrial and Systems Engineering NC State University January 9, 2018 Yunan Liu (NC
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 Abstract Motivated by interest in making delay announcements in service systems, we study real-time
More informationRare-Event Simulation
Rare-Event Simulation Background: Read Chapter 6 of text. 1 Why is Rare-Event Simulation Challenging? Consider the problem of computing α = P(A) when P(A) is small (i.e. rare ). The crude Monte Carlo estimator
More informationEE 368. Weeks 3 (Notes)
EE 368 Weeks 3 (Notes) 1 State of a Queuing System State: Set of parameters that describe the condition of the system at a point in time. Why do we need it? Average size of Queue Average waiting time How
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 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 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 informationIntroduction to Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Jain@eecs.berkeley.edu or Jain@wustl.edu A Mini-Course offered at UC Berkeley, Sept-Oct 2012 These slides and audio/video recordings
More informationOther properties of M M 1
Other properties of M M 1 Přemysl Bejda premyslbejda@gmail.com 2012 Contents 1 Reflected Lévy Process 2 Time dependent properties of M M 1 3 Waiting times and queue disciplines in M M 1 Contents 1 Reflected
More informationIEOR 4106: Spring Solutions to Homework Assignment 7: Due on Tuesday, March 22.
IEOR 46: Spring Solutions to Homework Assignment 7: Due on Tuesday, March. More of Chapter 5: Read the rest of Section 5.3, skipping Examples 5.7 (Coupon Collecting), 5. (Insurance claims)and Subsection
More informationQ = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days?
IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2005, Professor Whitt, Second Midterm Exam Chapters 5-6 in Ross, Thursday, March 31, 11:00am-1:00pm Open Book: but only the Ross
More informationNUMERICAL ANALYSIS PROBLEMS
NUMERICAL ANALYSIS PROBLEMS JAMES KEESLING The problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.. Solving Equations Problem.
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 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 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 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 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 informationGeneralized Exponential Random Graph Models: Inference for Weighted Graphs
Generalized Exponential Random Graph Models: Inference for Weighted Graphs James D. Wilson University of North Carolina at Chapel Hill June 18th, 2015 Political Networks, 2015 James D. Wilson GERGMs for
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 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 information4.7 Finite Population Source Model
Characteristics 1. Arrival Process R independent Source All sources are identical Interarrival time is exponential with rate for each source No arrivals if all sources are in the system. OR372-Dr.Khalid
More informationDynamic Control of a Tandem Queueing System with Abandonments
Dynamic Control of a Tandem Queueing System with Abandonments Gabriel Zayas-Cabán 1 Jungui Xie 2 Linda V. Green 3 Mark E. Lewis 1 1 Cornell University Ithaca, NY 2 University of Science and Technology
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 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 informationQUEUING SYSTEM. Yetunde Folajimi, PhD
QUEUING SYSTEM Yetunde Folajimi, PhD Part 2 Queuing Models Queueing models are constructed so that queue lengths and waiting times can be predicted They help us to understand and quantify the effect of
More informationProbability Midterm Exam 2:15-3:30 pm Thursday, 21 October 1999
Name: 2:15-3:30 pm Thursday, 21 October 1999 You may use a calculator and your own notes but may not consult your books or neighbors. Please show your work for partial credit, and circle your answers.
More informationMaximizing Service Reward for Queues with Deadlines
1 Maximizing Service Reward for Queues with Deadlines Li-on Raviv, Amir Leshem arxiv:1805.11681v3 [cs.pf] 23 Aug 2018 Abstract In this paper we consider a real time queuing system with rewards and deadlines.
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 informationQueues in Hospitals: Queueing Networks with ReEntering Customers in the QED Regime
Queues in Hospitals: Queueing Networks with ReEntering Customers in the QED Regime QED = Quality- and Efficiency-Driven Galit Bracha Yom-Tov Queues in Hospitals: Stochastic Networks with ReEntering Customers
More information