SearcharxivSearch

arXiv · 1812.00341

Many Server Queueing Models with Heterogeneous Servers and Parameter Uncertainty with Customer Contact Centre Applications

Abstract

In this thesis, we study the queueing systems with heterogeneous servers and service rate uncertainty under the Halfin-Whitt heavy traffic regime. First, we analyse many server queues with abandonments when service rates are i.i.d. random variables. We derive a diffusion approximation using a novel method. The diffusion has a random drift, and hence depending on the realisations of service rates, the system can be in Quality Driven (QD), Efficiency Driven (ED) or Quality-Efficiency-Driven (QED) regime. When the system is under QD or QED regime, the abandonments are negligible in the fluid limit, but when it is under ED regime, the probability of abandonment will converge to a non-zero value. We then analyse the optimal staffing levels to balance holding costs with staffing costs combining these three regimes. We also analyse how the variance of service rates influence abandonment rate. Next, we focus on the state space collapse (SSC) phenomenon. We prove that under some assumptions, the system process will collapse to a lower dimensional process without losing essential information. We first formulate a general method to prove SSC results inside pools for heavy traffic systems using the hydrodynamic limit idea. Then we work on the SSC in multi-class queueing networks under the Halfin-Whitt heavy traffic when service rates are i.i.d. random variables within pools. For such systems, exact analysis provides limited insight on the general properties. Alternatively, asymptotic analysis by diffusion approximation proves to be effective. Further, limit theorems, which state the diffusively scaled system process weakly converges to a diffusion process, are usually the central part in such asymptotic analysis. The SSC result is key to proving such a limit. We conclude by giving examples on how SSC is applied to the analysis of systems.

Explore related subjects

Keep this discovery

BibTeXRIS

Wenyi Qin. 2018-12-02. Many Server Queueing Models with Heterogeneous Servers and Parameter Uncertainty with Customer Contact Centre Applications. https://arxiv.org/abs/1812.00341

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR