Managing Service Systems with an Offline Waiting Option and Customer Abandonment: Companion Note
|
|
- Belinda Rosamond Baker
- 5 years ago
- Views:
Transcription
1 Managing Service Systems with an Offline Waiting Option and Customer Abandonment: Companion Note Vasiliki Kostami Amy R. Ward September 25, 28 The Amusement Park Ride Setting An amusement park ride departs at deterministically spaced intervals, and can carry only a certain number of customers. Hence it is desirable to extend our analysis to include situations in which customers are served in batches at set time intervals. The parameter regime we have considered, in which the arrival and service rates are large, is applicable to most popular amusement park rides, because generally hundreds or thousands of customers arrive to the ride, and board the ride, each hour. Recall that we are considering a system in which the arrival rate becomes large, and the service rate is θ for some θ R. We superscript any process or quantity associated with the system having arrival rate and service rate µ = θ by. The numbering of all the equations in this Companion Note begins after the number of the last equation, 38, in the Technical Appendix. The required modification to the model is the service process definition. In a slight abuse of notation, we use SI and SO to denote the cumulative number of customers that have boarded the ride from the inline and offline queues, even though the service processes are no longer renewal. The reader is to understand that in this Companion Note, SI and S O refer to the processes defined below. Let l 2/3 1, and assume service occurs only at discrete time points l, 2l, 3l,..., which represent ride departure times. At each discrete time il, the number of customers that can enter into service board the ride is n 1/3 1/6 θ. Then, the service rate is µ = n /l = θ customers per hour. The service process is defined recursively as follows. At time, no customers have boarded the ride, so that S I S O. 1
2 Suppose that at discrete time il, there are Q I customers in the inline queue and Q O customers in the offline queue. Then, the number of customers served from each queue that board the ride is and B Oil Hence B I il { [ 1 ] αn + min αn + Q O, QI αn Q I Q I αn Q I < αn { [ αn ] 1 αn + min + Q I, QO 1 αn Q O 1 αn Q O Q O < 1 αn. S I il S I i 1l + B I il S Oil S Oi 1l + B Oil. No customers board the ride in between the discrete time points l, 2l, 3l,..., and so for any t >, S I t = S I t l l and S Ot = S O t l. l The evolution equations for the queue-length process are very similar to 3 and 4 in Section 2 Q I t Q Ot A t i=1 A t i=1 1{w I W t i w OW t i } S I t 39 1{w I W t i > w OW t i } S Ot N γq Osds. 4 The difference is that now, because the service process counts the cumulative number of customers that have boarded the ride and not the number of customers that have departed after riding, the processes Q I and Q O track only the customers waiting to ride and do not include the customers riding or in service. Hence the wait time estimates W I t Q I t µα and W Ot O t µ1 α do not include any customers currently on the ride. This is reasonable because at time t the time remaining until the next ride departs is t/l l t, which becomes negligible as 2
3 increases. Finally, note that the bound on O in 1 is now Q Ot O t Q Ot + N [ t sup s t W γq O s ] + Osds N γq Osds, 41 where WO t represents the actual time a customer arriving to the offline queue at time t must wait to board the ride. We expect that the discrete review system behaves similarly to the continuous time system. The following proposition shows that Theorems 1 and 2, and hence also Corollary 1, remain valid for the discrete review system. Proposition 1 Theorems 1 and 2 remain valid for the model defined through The process Q appearing in Theorems 1 and 2 again solves the stochastic equation 11 but the infinitesimal variance of the Brownian motion X is σ 2 A. We end the body of this Companion Note by showing how to apply Proposition 1 to one popular roller coaster ride at Six Flags Magic Mountain, Tatsu. Suppose the arrival rate has been estimated. To use the approximation, we must determine the parameter θ. Tatsu has capacity for approximately 16 people to ride every hour, and so θ = 16, or θ = 16. The approximation is not very sensitive to l, because Proposition 1 remains valid for any review period of size f for 1/2 < f < 1. The key is that the time between ride departures is roughly on the order of seconds if the number of people that can ride every hour is around one or two thousand which is true for most roller coasters. Proof of Proposition 1 For the proof of Proposition 1 we will need the following lemma whose proof we defer at the end of this Companion Note. This final Lemma states that Lemmas 1-3 remain valid in the modified model in the Amusement Park Ride Setting, in which customers are served in batches at set time intervals. In this setting, as is true for the processes Q I and Q O, the workload processes PI and P O, and the actual waiting time processes W I and W O, refer to the customers waiting to board the ride and do not include the customers currently riding. Furthermore, τ t 1 γq Osds. 3
4 Lemma 4 Lemmas 1-3 also hold when the system evolution equations are specified through Note that in this setting the processes TI, T O, and I no longer appear in the system evolution equations, and so Lemma 1 is modified to state that as, Q, PI, PO, τ,,,, a.s., u.o.c.. 42 We must show the following. i For any T >, sup t T w I α ii As, Q, Ĩ Q, Ĩ. iii As, Proof of i sup WI t W I t and t T Q I t w O 1 α Q O t, in probability, as. sup WO t W O t, in probability. t T Modify the definitions of Ũ 1 and Ũ 2 in the proof of Theorem 1i so that Ũ1 t, s = w O Ã t s 1 α Ã { θ + w I w O α 1 α w O w I + w } O 1 t s 1 α l Ũ2 t, s = w I Ã t s α Ã { θ + w O w I 1 α α w I w O + w } I 1 t s. α l With ξ and ξ defined exactly as in the proof of Theorem 1i, observe that when w I α Q I ξ > w O 1 α Q O ξ, because the inline offline queue does not become empty during [ξ, ξ ], the offline inline queue may become empty, and service occurs in discrete time intervals S I t S I ξ S Ot S O ξ t ξ αn l t ξ 1 αn. l 4
5 Then, substitution of the above bounds into the equivalent of 2 in the proof of Theorem 1i in this setting specifically, replace S I T I t S I T I ξ with S I t S I ξ and SO T O t S O T O ξ with S O t S O ξ shows that for large enough w I α Q I t w O 1 α Q Ot ɛ } {Ũ max 1 t, ξ, Ũ 2 t, ξ + w O 1 t N γq 1 α Osds. Since l 1 = 1/3 as, the remainder of the proof proceeds exactly as the proof of Theorem 1 i, noting that by Lemma 4 as. 1 γq Osds a.s., u.o.c., Proof of ii We first obtain a useful equivalent representation for the process Q O t = Q I t + Q O t. Define so that ɛ t γ 1 αw I Q s Q αw O + 1 αw Os ds, I Q t = A t SI t SOt 1 αw I γ Q sds αw O + 1 αw I +ɛ t N γq Osds + γq Osds. Next we define recursively the process that tracks the cumulative number of empty ride seats I I il I i 1l + [ n Q il ] +. The process I does not increase in between the discrete time points l, 2l, 3l,..., and so for any t >, t I t = I l. l 5
6 Then, SI t + SOt = = and so It follows that t/l i=1 t/l i=1 BI il + BOil n 1{Q il n } + Q il 1{Q il < n }, S I t + S Ot + I t = t n. l where Q t = X t + ɛ t X t A t 1 αw I γ Q sds + I t 43 αw O + 1 αw I t n N γq l Osds + γq Osds. Furthermore, because the ride will depart with empty seats only when no customers are waiting, Q il I il I i 1l =. 44 i=1 By Lemma 4, there exists a convergent subsequence Q i, I i Q, Ĩ i i as i. We show that the limit Q, Ĩ satisfies Q, Ĩ = φ κ, ψ κ X, 45 where X is a Brownian motion with drift θ and variance σa 2. We first show C1 in Definition 1 is satisfied. On the subsequence i, because X i t i = Ã i t Ñ i τ i t + t i t 1 l i the functional central limit theorem shows X i i X. l i t t l i + θt l i t, 6
7 Also on the subsequence i, as in the proof of part ii of Theorem 1 which requires the tighness of Q established in Lemma 4, ɛ i i, as i. We conclude from 43 that the limit Q, Ĩ satisfies Qt = Xt 1 αw I γ Qsds + Ĩt. 46 αw O + 1 αw I For C2, note that on the subsequence i, the definition of the Reimann-Stieltjes integral implies that when we take limits as i on both sides of the equality in 44, QtdĨt =. Since furthermore I i = and I i is non-decreasing, it follows that Ĩ = and Ĩ is nondecreasing. We conclude that 45 is valid. From the representation 18, this is equivalent to the stochastic equation for Q in 11. Since the subsequence i was arbitrary, this part of the proof is complete. Proof of iii The argument is very similar to the proof of Theorem 2 in the Technical Appendix Kostami and Ward 28b, and so is omitted. The exception is that the upper-bound on O in 41 replaces the upper-bound on O in 1. Proof of Lemma 4 We divide the proof of Lemma 4 into three parts, with each part re-proving Lemmas 1, 2, and 3 for the modified model in the Amusement Park Ride Setting, in which customers are served in batches at set time intervals. Proof of 42 Lemma 1 equivalent We require defining the following two comparison systems. Comparison system 1 is the model in the Amusement Park Ride Setting without abandonments. In particular, the inline and offline queue-length processes, Q B,I and Q B,O, satisfy equations 39 and 4 with 7
8 γ =. Under the same arrival sequence, on a sample path basis, Q t Q B,It + Q B,Ot, for all t. Comparison system 2 is a conventional single-server queue with no abandonments and deterministic, non-batched service. In particular, the queue-length process evolution equation is Q Ct A t µ 1{Q Cs > }ds. Under the same arrival sequence, on a sample path basis Q B,Iil + Q B,Oil = Q Cil for every i =, 1, 2,.... We conclude that on a sample path basis Q t Q C t t l + A t A l. 47 l l It is well known that Q C / a.s., u.o.c., as. Furthermore, A t A t l l = A t A t t l + t l, l l and, as, A a.s., u.o.c. and t t/l l. Hence Q a.s., u.o.c., as. It then follows that τ a.s., u.o.c., as. Proof that the sequence { Q, Ĩ } is tight in D Lemma 2 equivalent It is sufficient to verify that the sequence { Q } is tight in D. Tightness of the sequence { Q, Ĩ } then follows from equation 43, because the functional central limit theorem shows the sequence {X / } is tight, and tightness of the sequence {ɛ / } can be established very similarly to Lemma 2. Let T >. We verify conditions and in Theorem 16.8 in Billingsley. B16.17 We must show that for η > arbitrarily small, there exists an a and a large enough 8
9 such that P sup t T Q t a < η,. 48 It is well-known that for Q C defined as in the first part of this proof, Q C / weakly converges to a reflected Brownian motion with drift θ and variance σ 2 A. Furthermore, A t A t l l t = à t à l + t t l. l l The functional central limit theorem implies that à weakly converges to a Brownian motion, and the definition of l implies t t/l l as. Therefore, the condition 48 follows from the bound in 47. B16.18 It is sufficient to show that for γ > and η > arbitrarily small, there exists a δ small enough and a large enough such that P sup sup t T δ v,s [t,t+δ] Q s Q v γ < η,. 49 Without loss of generality, assume s < v. We require an upper and a lower bound on the process Q v Q s. For the upper bound, define a comparison system Q Ct A s + t A s µ By similar reasoning as in the previous paragraph, Q v Q s Q C For the lower bound, since v s l s 1{Q Cζ > }dζ. l + A v A v l l. 5 Q v Q s v v s s = A v A l + A l A s + A l A l l l l l v s SI v + SI s SOv + SOs N γq Oζdζ + N γq Oζdζ, 9
10 and at most n customers are served every l time units, Q v Q s v/l l 1 i= s/l l v N A i + 1l A il n 2n 51 s γq Oζdζ + N γq Oζdζ. Noting that Q O t Q t for all t, 1 A i + 1l A il n = à i + 1l à il 2/3 θ, and 1 v s N γq Oζdζ N γq Oζdζ = Ñ τ v Ñ τ s v s γ Q Oζdζ, it follows from 5 and 51 that where M U Q C M L v s l Q v Q s maxmu, ML, 52 l + à v l l à s l +γv s sup t T Q t v à v à l v + v l l l l + Ñ τ v + Ñ τ s v s + 2/3 θ l l + 2 n. l l The condition 49 follows because every term on the right-hand side of 52 becomes arbitrarily small with high probability as δ converges to, for v s < δ and large enough. In particular, v s/l l v s as, and so, since Q C weakly converges to a continuous limit process a reflected Brownian motion with initial position, it follows that Q C v s/l l can be made arbitrarily small with high probability as δ becomes small. Furthermore, à conveges to a continuous lmiit process and so the terms à v à v l l and à v l l à s l l 1
11 become arbitrarily small with high probability as δ becomes small. The constant terms all converge to, and, because we have shown the convergence in 42 in Lemma 4, which implies 15 remains valid in this setting, Ñ τ weakly converges to. Finally, because we have already shown condition B16.17 is satisfied, the term γv s sup t T Q t becomes arbitrarily small with high probability as δ becomes small. Proof of 16 and 17 Lemma 3 equivalent As in the proof of Lemma 3, it is sufficient to show that as P I αw O 1 αw I + αw O Q and P O 1 αw I 1 αw I + αw O Q. For the inline queue, note that the number of batches required to serve all customers in the inline queue exceeds Q I t/n and is less than Q I t/n. Since each batch requires l time units to process and so Q l I t Q P n I t l I t, n PI t Q l I t l. n Since l as and by parts i and ii of this Proposition the weak convergence in Corollary 1 remains valid, l Q I n = l n Q I αw O 1 αw I + αw O Q. We conclude as. P I αw O 1 αw I + αw O Q Since whenever the number of customers in the offline queue exceeds 1 αn at a discrete review time point, at least 1 αn customers are served, Q O t 1 αn + 1 l exceeds the amount of time required for all customers in the offline queue that do not abandon to be served. Hence the number of customers in the offline queue that eventually do abandon 11
12 must be less than or equal to Therefore, A t N «Q t+ O t 1 αn +1 l N γq Osds. γq Osds Q l O t A t Q P n Ot l O t. n It follows from the observation that Q O t 1 αn + 1 l = Q O t 1 αµ + l as that 1 A as by identical argument as that in the proof of Lemma 3. As in the preceding paragraph, we conclude as. P O 1 αw I 1 αw I + αw O Q 12
The 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 informationPositive Harris Recurrence and Diffusion Scale Analysis of a Push Pull Queueing Network. Haifa Statistics Seminar May 5, 2008
Positive Harris Recurrence and Diffusion Scale Analysis of a Push Pull Queueing Network Yoni Nazarathy Gideon Weiss Haifa Statistics Seminar May 5, 2008 1 Outline 1 Preview of Results 2 Introduction Queueing
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 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 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 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 informationLIMITS FOR QUEUES AS THE WAITING ROOM GROWS. Bell Communications Research AT&T Bell Laboratories Red Bank, NJ Murray Hill, NJ 07974
LIMITS FOR QUEUES AS THE WAITING ROOM GROWS by Daniel P. Heyman Ward Whitt Bell Communications Research AT&T Bell Laboratories Red Bank, NJ 07701 Murray Hill, NJ 07974 May 11, 1988 ABSTRACT We study the
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 informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 22 12/09/2013. Skorokhod Mapping Theorem. Reflected Brownian Motion
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.7J Fall 213 Lecture 22 12/9/213 Skorokhod Mapping Theorem. Reflected Brownian Motion Content. 1. G/G/1 queueing system 2. One dimensional reflection mapping
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 informatione - c o m p a n i o n
OPERATIONS RESEARCH http://dx.doi.org/1.1287/opre.111.13ec e - c o m p a n i o n ONLY AVAILABLE IN ELECTRONIC FORM 212 INFORMS Electronic Companion A Diffusion Regime with Nondegenerate Slowdown by Rami
More informationFLUID LIMITS TO ANALYZE LONG-TERM FLOW RATES OF A STOCHASTIC NETWORK WITH INGRESS DISCARDING
Submitted to the Annals of Applied Probability FLUID LIMITS TO ANALYZE LONG-TERM FLOW RATES OF A STOCHASTIC NETWORK WITH INGRESS DISCARDING By John Musacchio, and Jean Walrand, University of California,
More informationOperations Research Letters. Instability of FIFO in a simple queueing system with arbitrarily low loads
Operations Research Letters 37 (2009) 312 316 Contents lists available at ScienceDirect Operations Research Letters journal homepage: www.elsevier.com/locate/orl Instability of FIFO in a simple queueing
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 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 informationE-Companion to Fully Sequential Procedures for Large-Scale Ranking-and-Selection Problems in Parallel Computing Environments
E-Companion to Fully Sequential Procedures for Large-Scale Ranking-and-Selection Problems in Parallel Computing Environments Jun Luo Antai College of Economics and Management Shanghai Jiao Tong University
More informationPositive Harris Recurrence and Diffusion Scale Analysis of a Push Pull Queueing Network
Positive Harris Recurrence and Diffusion Scale Analysis of a Push Pull Queueing Network Yoni Nazarathy a,1, Gideon Weiss a,1 a Department of Statistics, The University of Haifa, Mount Carmel 31905, Israel.
More informationTOWARDS BETTER MULTI-CLASS PARAMETRIC-DECOMPOSITION APPROXIMATIONS FOR OPEN QUEUEING NETWORKS
TOWARDS BETTER MULTI-CLASS PARAMETRIC-DECOMPOSITION APPROXIMATIONS FOR OPEN QUEUEING NETWORKS by Ward Whitt AT&T Bell Laboratories Murray Hill, NJ 07974-0636 March 31, 199 Revision: November 9, 199 ABSTRACT
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 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 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 informationThe Generalized Drift Skorokhod Problem in One Dimension: Its solution and application to the GI/GI/1 + GI and. M/M/N/N transient distributions
The Generalized Drift Skorokhod Problem in One Dimension: Its solution and application to the GI/GI/1 + GI and M/M/N/N transient distributions Josh Reed Amy Ward Dongyuan Zhan Stern School of Business
More informationDELAY, MEMORY, AND MESSAGING TRADEOFFS IN DISTRIBUTED SERVICE SYSTEMS
DELAY, MEMORY, AND MESSAGING TRADEOFFS IN DISTRIBUTED SERVICE SYSTEMS By David Gamarnik, John N. Tsitsiklis and Martin Zubeldia Massachusetts Institute of Technology 5 th September, 2017 We consider the
More informationFork-Join Networks in Heavy Traffic: Diffusion Approximations and Control. M.Sc. Research Proposal
Fork-Join Networks in Heavy Traffic: Diffusion Approximations and Control M.Sc. Research Proposal Asaf Zviran Advisors: Prof. Rami Atar Prof. Avishai Mandelbaum Faculty of Industrial Engineering and Management
More informationSUMMARY OF RESULTS ON PATH SPACES AND CONVERGENCE IN DISTRIBUTION FOR STOCHASTIC PROCESSES
SUMMARY OF RESULTS ON PATH SPACES AND CONVERGENCE IN DISTRIBUTION FOR STOCHASTIC PROCESSES RUTH J. WILLIAMS October 2, 2017 Department of Mathematics, University of California, San Diego, 9500 Gilman Drive,
More informationAppendix B for The Evolution of Strategic Sophistication (Intended for Online Publication)
Appendix B for The Evolution of Strategic Sophistication (Intended for Online Publication) Nikolaus Robalino and Arthur Robson Appendix B: Proof of Theorem 2 This appendix contains the proof of Theorem
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 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 informationTopics in queueing theory
Graduate Theses and Dissertations Iowa State University Capstones, Theses and Dissertations 217 Topics in queueing theory Keguo Huang Iowa State University Follow this and additional works at: http://lib.dr.iastate.edu/etd
More informationLecture 20: Reversible Processes and Queues
Lecture 20: Reversible Processes and Queues 1 Examples of reversible processes 11 Birth-death processes We define two non-negative sequences birth and death rates denoted by {λ n : n N 0 } and {µ n : n
More informationMulti-class, multi-server queues with non-preemptive priorities
Multi-class, multi-server queues with non-preemptive priorities Andrei Sleptcheno. EURANDOM, Eindhoven University of Technology, P.O. Box 53, 5600MB Eindhoven, The Netherlands. e-mail:sleptcheno@eurandom.tue.nl
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 informationNetwork Calculus Analysis of Feedback Systems with Random Service. Alireza Shekaramiz
Network Calculus Analysis of Feedback Systems with Random Service by Alireza Shekaramiz A thesis submitted in conformity with the requirements for the degree of Master of Applied Science Graduate Department
More informationThe Concert Queueing Game: To Wait or To be Late
The Concert Queueing Game: To Wait or To be Late Rahul Jain, Sandeep Juneja & Nahum Shimkin December 2, 2010 Abstract We introduce the concert (or cafeteria) queueing problem: A finite but large number
More informationThe Passport Control Problem or How to Keep an Unstable Service System Load Balanced?
The Passport Control Problem or How to Keep an Unstable Service System Load Balanced? A. ITAI Computer Science Department, Technion M. RODEH Computer Science Department, Technion H. SHACHNAI Computer Science
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 informationarxiv: v3 [math.pr] 4 Dec 2017
ERGODICITY OF AN SPDE ASSOCIATED WITH A MANY-SERVER QUEUE By Reza Aghajani and Kavita Ramanan arxiv:1512.2929v3 [math.pr] 4 Dec 217 Department of Mathematics, UC San Diego, and Division of Applied Mathematics,
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 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 informationProcess-Based Risk Measures for Observable and Partially Observable Discrete-Time Controlled Systems
Process-Based Risk Measures for Observable and Partially Observable Discrete-Time Controlled Systems Jingnan Fan Andrzej Ruszczyński November 5, 2014; revised April 15, 2015 Abstract For controlled discrete-time
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 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 informationOnline Supplement: Managing Hospital Inpatient Bed Capacity through Partitioning Care into Focused Wings
Online Supplement: Managing Hospital Inpatient Bed Capacity through Partitioning Care into Focused Wings Thomas J. Best, Burhaneddin Sandıkçı, Donald D. Eisenstein University of Chicago Booth School of
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 informationA Review of Basic FCLT s
A Review of Basic FCLT s Ward Whitt Department of Industrial Engineering and Operations Research, Columbia University, New York, NY, 10027; ww2040@columbia.edu September 10, 2016 Abstract We briefly review
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 informationStationary Probabilities of Markov Chains with Upper Hessenberg Transition Matrices
Stationary Probabilities of Marov Chains with Upper Hessenberg Transition Matrices Y. Quennel ZHAO Department of Mathematics and Statistics University of Winnipeg Winnipeg, Manitoba CANADA R3B 2E9 Susan
More informationESTIMATING WAITING TIMES WITH THE TIME-VARYING LITTLE S LAW
ESTIMATING WAITING TIMES WITH THE TIME-VARYING LITTLE S LAW Song-Hee Kim and Ward Whitt Industrial Engineering and Operations Research Columbia University New York, NY, 10027 {sk3116, ww2040}@columbia.edu
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 informationQueuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe
Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem Wade Trappe Lecture Overview Network of Queues Introduction Queues in Tandem roduct Form Solutions Burke s Theorem What
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 informationUniversality of Power-of-$d$ Load Balancing in Many- Server Systems Mukherjee, D.; Borst, S.C.; van Leeuwaarden, J.S.H.; Whiting, P.A.
Universality of Power-of-$d$ Load Balancing in Many- Server Systems Mukherjee, D.; Borst, S.C.; van Leeuwaarden, J.S.H.; Whiting, P.A. Published in: arxiv Published: //6 Document Version Accepted manuscript
More informationSection 1.2: A Single Server Queue
Section 12: A Single Server Queue Discrete-Event Simulation: A First Course c 2006 Pearson Ed, Inc 0-13-142917-5 Discrete-Event Simulation: A First Course Section 12: A Single Server Queue 1/ 30 Section
More informationLarge Deviations for Weakly Dependent Sequences: The Gärtner-Ellis Theorem
Chapter 34 Large Deviations for Weakly Dependent Sequences: The Gärtner-Ellis Theorem This chapter proves the Gärtner-Ellis theorem, establishing an LDP for not-too-dependent processes taking values in
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 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 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 informationFluid Models of Parallel Service Systems under FCFS
Fluid Models of Parallel Service Systems under FCFS Hanqin Zhang Business School, National University of Singapore Joint work with Yuval Nov and Gideon Weiss from The University of Haifa, Israel Queueing
More informationarxiv:math/ v4 [math.pr] 12 Apr 2007
arxiv:math/612224v4 [math.pr] 12 Apr 27 LARGE CLOSED QUEUEING NETWORKS IN SEMI-MARKOV ENVIRONMENT AND ITS APPLICATION VYACHESLAV M. ABRAMOV Abstract. The paper studies closed queueing networks containing
More information1 Introduction. 2 White noise. The content of these notes is also covered by chapter 4 section A of [1].
1 Introduction The content of these notes is also covered by chapter 4 section A of [1]. 2 White noise In applications infinitesimal Wiener increments are represented as dw t = η t The stochastic process
More informationSTAT 331. Martingale Central Limit Theorem and Related Results
STAT 331 Martingale Central Limit Theorem and Related Results In this unit we discuss a version of the martingale central limit theorem, which states that under certain conditions, a sum of orthogonal
More informationLarge number of queues in tandem: Scaling properties under back-pressure algorithm
Queueing Syst (2011) 67: 111 126 DOI 10.1007/s11134-010-9203-0 Large number of queues in tandem: Scaling properties under back-pressure algorithm Alexander L. Stolyar Received: 30 October 2009 / Revised:
More informationIEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 43, NO. 3, MARCH
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 43, NO. 3, MARCH 1998 315 Asymptotic Buffer Overflow Probabilities in Multiclass Multiplexers: An Optimal Control Approach Dimitris Bertsimas, Ioannis Ch. Paschalidis,
More informationOn Dynamic Scheduling of a Parallel Server System with Partial Pooling
On Dynamic Scheduling of a Parallel Server System with Partial Pooling V. Pesic and R. J. Williams Department of Mathematics University of California, San Diego 9500 Gilman Drive La Jolla CA 92093-0112
More informationSimplex Algorithm for Countable-state Discounted Markov Decision Processes
Simplex Algorithm for Countable-state Discounted Markov Decision Processes Ilbin Lee Marina A. Epelman H. Edwin Romeijn Robert L. Smith November 16, 2014 Abstract We consider discounted Markov Decision
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 informationLecture 06 01/31/ Proofs for emergence of giant component
M375T/M396C: Topics in Complex Networks Spring 2013 Lecture 06 01/31/13 Lecturer: Ravi Srinivasan Scribe: Tianran Geng 6.1 Proofs for emergence of giant component We now sketch the main ideas underlying
More informationTime Reversibility and Burke s Theorem
Queuing Analysis: Time Reversibility and Burke s Theorem Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. Yannis A. Korilis. Outline Time-Reversal
More informationNEW FRONTIERS IN APPLIED PROBABILITY
J. Appl. Prob. Spec. Vol. 48A, 209 213 (2011) Applied Probability Trust 2011 NEW FRONTIERS IN APPLIED PROBABILITY A Festschrift for SØREN ASMUSSEN Edited by P. GLYNN, T. MIKOSCH and T. ROLSKI Part 4. Simulation
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 informationANALYSIS OF P2P FILE TRANSFERRING SYSTEM BY STOCHASTIC QUEUE MODELS JI ZHU THESIS
c 2010 Ji Zhu ANALYSIS OF P2P FILE TRANSFERRING SYSTEM BY STOCHASTIC QUEUE MODELS BY JI ZHU THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Electrical
More informationTransitory Queueing Networks
OPERATIONS RESEARCH Vol. 00, No. 0, Xxxxx 0000, pp. 000 000 issn 0030-364X eissn 1526-5463 00 0000 0001 INFORMS doi 10.1287/xxxx.0000.0000 c 0000 INFORMS Authors are encouraged to submit new papers to
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 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 informationBlind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers
Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers Mor Armony Amy R. Ward 2 October 6, 2 Abstract In a call center, arriving customers must be routed to available
More information5 Lecture 5: Fluid Models
5 Lecture 5: Fluid Models Stability of fluid and stochastic processing networks Stability analysis of some fluid models Optimization of fluid networks. Separated continuous linear programming 5.1 Stability
More information1. Stochastic Processes and filtrations
1. Stochastic Processes and 1. Stoch. pr., A stochastic process (X t ) t T is a collection of random variables on (Ω, F) with values in a measurable space (S, S), i.e., for all t, In our case X t : Ω S
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 informationStochastic process. X, a series of random variables indexed by t
Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,
More informationPoint Process Control
Point Process Control The following note is based on Chapters I, II and VII in Brémaud s book Point Processes and Queues (1981). 1 Basic Definitions Consider some probability space (Ω, F, P). A real-valued
More informationIntroduction to Empirical Processes and Semiparametric Inference Lecture 09: Stochastic Convergence, Continued
Introduction to Empirical Processes and Semiparametric Inference Lecture 09: Stochastic Convergence, Continued Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics and
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 informationTHROUGHPUT ANALYSIS OF STOCHASTIC NETWORKS USING FLUID LIMITS. By John Musacchio University of California, Santa Cruz and
Submitted to the Annals of Applied Probability THROUGHPUT ANALYSIS OF STOCHASTIC NETWORKS USING FLUID LIMITS. By John Musacchio University of California, Santa Cruz and By Jean Walrand University of California,
More informationDynkin (λ-) and π-systems; monotone classes of sets, and of functions with some examples of application (mainly of a probabilistic flavor)
Dynkin (λ-) and π-systems; monotone classes of sets, and of functions with some examples of application (mainly of a probabilistic flavor) Matija Vidmar February 7, 2018 1 Dynkin and π-systems Some basic
More informationCHAPTER 5. Interactive Turing Machines
CHAPTER 5 Interactive Turing Machines The interactive Turing machine, which was introduced by Van Leeuwen and Wiedermann[28, 30], is an extension of the classical Turing machine model. It attempts to model
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 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 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 informationCONTINUITY OF A QUEUEING INTEGRAL REPRESENTATION IN THE M 1 TOPOLOGY. Department of Industrial Engineering and Operations Research Columbia University
Submitted to the Annals of Applied Probability CONTINUITY OF A QUEUEING INTEGRAL REPRESENTATION IN THE M 1 TOPOLOGY By Guodong Pang and Ward Whitt Department of Industrial Engineering and Operations Research
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 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 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 Fluid Limit of an Overloaded Processor Sharing Queue
MATHEMATICS OF OPERATIONS RESEARCH Vol. 31, No. 2, May 26, pp. 316 35 issn 364-765X eissn 1526-5471 6 312 316 informs doi 1.1287/moor.15.181 26 INFORMS The Fluid Limit of an Overloaded Processor Sharing
More informationEFFICIENT COMPUTATION OF PROBABILITIES OF EVENTS DESCRIBED BY ORDER STATISTICS AND APPLICATION TO A PROBLEM OFQUEUES
EFFICIENT COMPUTATION OF PROBABILITIES OF EVENTS DESCRIBED BY ORDER STATISTICS AND APPLICATION TO A PROBLEM OFQUEUES Lee K. Jones and Richard C. Larson OR 249-91 May 1991 Efficient Computation of Probabilities
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 informationDynamic Matching Models
Dynamic Matching Models Ana Bušić Inria Paris - Rocquencourt CS Department of École normale supérieure joint work with Varun Gupta, Jean Mairesse and Sean Meyn 3rd Workshop on Cognition and Control January
More informationFair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
OPERATIONS RESEARCH Vol. 58, No. 3, May June 2010, pp. 624 637 issn 0030-364X eissn 1526-5463 10 5803 0624 informs doi 10.1287/opre.1090.0777 2010 INFORMS Fair Dynamic Routing in Large-Scale Heterogeneous-Server
More informationRegularity and optimization
Regularity and optimization Bruno Gaujal INRIA SDA2, 2007 B. Gaujal (INRIA ) Regularity and Optimization SDA2, 2007 1 / 39 Majorization x = (x 1,, x n ) R n, x is a permutation of x with decreasing coordinates.
More informationMotivated by models of tenant assignment in public housing, we study approximating deterministic fluid
MANAGEMENT SCIENCE Vol. 54, No. 8, August 2008, pp. 1513 1527 issn 0025-1909 eissn 1526-5501 08 5408 1513 informs doi 10.1287/mnsc.1080.0868 2008 INFORMS Fluid Models for Overloaded Multiclass Many-Server
More informationOPTIMALITY OF RANDOMIZED TRUNK RESERVATION FOR A PROBLEM WITH MULTIPLE CONSTRAINTS
OPTIMALITY OF RANDOMIZED TRUNK RESERVATION FOR A PROBLEM WITH MULTIPLE CONSTRAINTS Xiaofei Fan-Orzechowski Department of Applied Mathematics and Statistics State University of New York at Stony Brook Stony
More information