117 research outputs found

    A General Framework to Compare Announcement Accuracy: Static vs LES-based Announcement

    Get PDF
    Service providers often share delay information, in the form of delay announcements, with their customers. In practice, simple delay announcements, such as average waiting times or a weighted average of previously delayed customers, are often used. Our goal in this paper is to gain insight into when such announcements perform well. Specifically, we compare the accuracies of two announcements: (i) a static announcement that does not exploit real-time information about the state of the system and (ii) a dynamic announcement, specifically the last-to-enter-service (LES) announcement, which equals the delay of the last customer to have entered service at the time of the announcement. We propose a novel correlation-based approach that is theoretically appealing because it allows for a comparison of the accuracies of announcements across different queueing models, including multiclass models with a priority service discipline. It is also practically useful because estimating correlations is much easier than fitting an entire queueing model. Using a combination of queueing-theoretic analysis, real-life data analysis, and simulation, we analyze the performance of static and dynamic announcements and derive an appropriate weighted average of the two which we demonstrate has a superior performance using both simulation and data from a call center.

    Does the Past Predict the Future? The Case of Delay Announcements in Service Systems

    Get PDF
    Motivated by the recent interest in making delay announcements in large service systems, such as call centers, we investigate the accuracy of announcing the waiting time of the Last customer to Enter Service (LES). In practice, customers typically respond to delay announcements by either balking or by becoming more or less impatient, and their response alters system performance. We study the accuracy of the LES announcement in single-class multi-server Markovian queueing models with announcement-dependent customer behavior. We show that, interestingly, even in this stylized setting, the LES announcement may not always be accurate. This motivates the need to study its accuracy carefully, and to determine conditions under which it is accurate. Since the direct analysis of the system with customer response is prohibitively difficult, we focus on many-server heavy-traffic analysis instead. We consider the quality-and-efficiency-driven (QED) and the efficiency-driven (ED) many-server heavy-traffic regimes and prove, under both regimes, that the LES prediction is asymptotically accurate if, and only if, asymptotic fluctuations in the queue length process are small as long as some regulatory conditions apply. This result provides an easy check for the accuracy of LES in practice. We supplement our theoretical results with an extensive simulation study to generate practical managerial insights

    Staffing a Call Center with Uncertain Arrival Rate and Absenteeism

    Get PDF
    This paper proposes simple methods for staffing a single-class call center with uncertain arrival rate and uncertain staffing due to employee absenteeism. The arrival rate and the proportion of servers present are treated as random variables. The basic model is a multi-server queue with customer abandonment, allowing non-exponential service-time and time-to-abandon distributions. The goal is to maximize the expected net return, given throughput benefit and server, customer-abandonment and customer-waiting costs, but attention is also given to the standard deviation of the return. The approach is to approximate the performance and the net return, conditional on the random model-parameter vector, and then uncondition to get the desired results. Two recently-developed approximations are used for the conditional performance measures: first, a deterministic fluid approximation and, second, a numerical algorithm based on a purely Markovian birth-and-death model, having state-dependent death rates
    corecore