This paper develops methods to determine appropriate staffing levels in call centers and other many-server queueing systems with time-varying arrival rates. The goal is to achieve targeted time-stable performance, even in the presence of significant time variation in the arrival rates. The main...

To provide useful practical insight into the performance of service-oriented (non-revenue-generating) call centers, which often provide low-to-moderate quality of service, this paper investigates the efficiency-driven (ED), many-server heavy-traffic limiting regime for queues with abandonments....

In this paper we describe the mean number of busy servers as a function of time in an M_t/G/\infty queue (having a nonhomogeneous Poisson arrival process) with a sinusoidal arrival rate function. For an M_t/G/\infty model with appropriate initial conditions, it is known that the number of busy...

This paper investigates simple approximations for stochastic point processes. As in several previous studies, the approximating process is a renewal process characterized by the first two moments of the renewal interval. The approximating renewal-interval distribution itself is a convenient...

This paper investigates the possibility of predicting each customer's waiting time in queue before starting service in a multiserver service system with the first-come first-served service discipline, such as a telephone call center. A predicted waiting-time distribution or an appropriate...

This paper investigates the effect upon performance in a service system, such as a telephone call center, of giving waiting customers state information. In particular, the paper studies two M/M/s/r queueing models with balking and reneging. For simplicity, it is assumed that each customer is...

Green, Kolesar and Svoronos (in press) and Green and Kolesar (in press) use numerical methods to investigate the behavior of multiserver Markov queues with a Poisson arrival process having a sinusoidal arrival rate. For this model they propose an approximation for long-run average performance...

We consider a multiserver service system with general nonstationary arrival and service-time processes in which s(t), the number of servers as a function of time, needs to be selected to meet projected loads. We try to choose s(t) so that the probability of a delay (before beginning service)...

Recently Fishburn (Fishburn, P. C. 1978. Stochastic dominance without transitive preferences. Management Sci. 24 1268-1277.) proposed a definition of stochastic dominance for probability measures defined on a set with an intransitive preference-or-indifference relation. A significant feature of...

Simple heuristic formulas are developed to estimate the simulation run lengths required to achieve desired statistical precision in queueing simulations. The formulas are intended to help in the early planning stages before any data have been collected. The queueing simulations considered are...