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...

Large-scale service systems, where many servers respond to high demand, are appealing because they can provide great economy of scale, producing a high quality of service with high efficiency. Customer waiting times can be short, with a majority of customers served immediately upon arrival,...

We consider a two-station network with two types of jobs: type 0 jobs require service at station 1 only and type 1 jobs require service both at station 1 and 2 in sequence. Each station has a single server. The problem is to schedule the server at station 1 between the two types of jobs in order...

We consider a two-station network with two types of jobs: type 0 jobs require service at station 1 only and type 1 jobs require service both at station 1 and 2 in sequence. Each station has a single server. The problem is to schedule the server at station 1 between the two types of jobs in order...

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....

We address the performance optimization problem in a single-station multiclass queueing network with changeover times by means of the achievable region approach. This approach seeks to obtain performance bounds and scheduling policies from the solution of a mathematical program over a relaxation...

We argue the importance both of developing simple sufficient conditions for the stability of general multiclass queueing networks and also of assessing such conditions under a range of assumptions on the weight of the traffic flowing between service stations. To achieve the former, we review a...

Consider a continuous time finite state irreducible Markov chain whose jump transitions are partitioned into one group that is regulated and the other group that is not. The regulated transitions are only allowed to occur if there is a token available. We collect the tokens in a buer and allow a...

In this paper the steady-state queue size behavior of single-server queues with bulk-arrival and batch-service, referred to as bulk queues, is approximated by a diffusion process using the instantaneous return approach. Diffusion approximation solutions for various queue size statistics are...

We propose some new two-stage stopping procedures to construct absolute-width and relative-width confidence intervals for a simulation estimator of the steady-state mean of a stochastic process. The procedures are based on the method of standardized time series proposed by Schruben and on...