5,072 research outputs found

    Multiclass multiserver queueing system in the Halfin-Whitt heavy traffic regime. Asymptotics of the stationary distribution

    Get PDF
    We consider a heterogeneous queueing system consisting of one large pool of O(r)O(r) identical servers, where r→∞r\to\infty is the scaling parameter. The arriving customers belong to one of several classes which determines the service times in the distributional sense. The system is heavily loaded in the Halfin-Whitt sense, namely the nominal utilization is 1−a/r1-a/\sqrt{r} where a>0a>0 is the spare capacity parameter. Our goal is to obtain bounds on the steady state performance metrics such as the number of customers waiting in the queue Qr(∞)Q^r(\infty). While there is a rich literature on deriving process level (transient) scaling limits for such systems, the results for steady state are primarily limited to the single class case. This paper is the first one to address the case of heterogeneity in the steady state regime. Moreover, our results hold for any service policy which does not admit server idling when there are customers waiting in the queue. We assume that the interarrival and service times have exponential distribution, and that customers of each class may abandon while waiting in the queue at a certain rate (which may be zero). We obtain upper bounds of the form O(r)O(\sqrt{r}) on both Qr(∞)Q^r(\infty) and the number of idle servers. The bounds are uniform w.r.t. parameter rr and the service policy. In particular, we show that lim sup⁡rEexp⁡(θr−1/2Qr(∞))<∞\limsup_r E \exp(\theta r^{-1/2}Q^r(\infty))<\infty. Therefore, the sequence r−1/2Qr(∞)r^{-1/2}Q^r(\infty) is tight and has a uniform exponential tail bound. We further consider the system with strictly positive abandonment rates, and show that in this case every weak limit Q^(∞)\hat{Q}(\infty) of r−1/2Qr(∞)r^{-1/2}Q^r(\infty) has a sub-Gaussian tail. Namely E[exp⁡(θ(Q^(∞))2)]0E[\exp(\theta (\hat{Q}(\infty))^2)]0.Comment: 21 page

    Fluid Approximation of a Call Center Model with Redials and Reconnects

    Get PDF
    In many call centers, callers may call multiple times. Some of the calls are re-attempts after abandonments (redials), and some are re-attempts after connected calls (reconnects). The combination of redials and reconnects has not been considered when making staffing decisions, while ignoring them will inevitably lead to under- or overestimation of call volumes, which results in improper and hence costly staffing decisions. Motivated by this, in this paper we study call centers where customers can abandon, and abandoned customers may redial, and when a customer finishes his conversation with an agent, he may reconnect. We use a fluid model to derive first order approximations for the number of customers in the redial and reconnect orbits in the heavy traffic. We show that the fluid limit of such a model is the unique solution to a system of three differential equations. Furthermore, we use the fluid limit to calculate the expected total arrival rate, which is then given as an input to the Erlang A model for the purpose of calculating service levels and abandonment rates. The performance of such a procedure is validated in the case of single intervals as well as multiple intervals with changing parameters

    Statistical Analysis of a Telephone Call Center: A Queueing-Science Perspective

    Get PDF
    A call center is a service network in which agents provide telephone-based services. Customers that seek these services are delayed in tele-queues. This paper summarizes an analysis of a unique record of call center operations. The data comprise a complete operational history of a small banking call center, call by call, over a full year. Taking the perspective of queueing theory, we decompose the service process into three fundamental components: arrivals, customer abandonment behavior and service durations. Each component involves different basic mathematical structures and requires a different style of statistical analysis. Some of the key empirical results are sketched, along with descriptions of the varied techniques required. Several statistical techniques are developed for analysis of the basic components. One of these is a test that a point process is a Poisson process. Another involves estimation of the mean function in a nonparametric regression with lognormal errors. A new graphical technique is introduced for nonparametric hazard rate estimation with censored data. Models are developed and implemented for forecasting of Poisson arrival rates. We then survey how the characteristics deduced from the statistical analyses form the building blocks for theoretically interesting and practically useful mathematical models for call center operations. Key Words: call centers, queueing theory, lognormal distribution, inhomogeneous Poisson process, censored data, human patience, prediction of Poisson rates, Khintchine-Pollaczek formula, service times, arrival rate, abandonment rate, multiserver queues.

    Critically loaded multi-server queues with abandonments, retrials, and time-varying parameters

    Full text link
    In this paper, we consider modeling time-dependent multi-server queues that include abandonments and retrials. For the performance analysis of those, fluid and diffusion models called "strong approximations" have been widely used in the literature. Although they are proven to be asymptotically exact, their effectiveness as approximations in critically loaded regimes needs to be investigated. To that end, we find that existing fluid and diffusion approximations might be either inaccurate under simplifying assumptions or computationally intractable. To address that concern, this paper focuses on developing a methodology by adjusting the fluid and diffusion models so that they significantly improve the estimation accuracy. We illustrate the accuracy of our adjusted models by performing a number of numerical experiments
    • …
    corecore