Infinitesimal Perturbation Analysis (IPA) is a method for computing a sample path derivative with respect to an input parameter in a discrete event simulation. The IPA algorithm is based on the fact that for certain parameters and any realization of a simulation, the change in parameter can be...

Call centers usually handle several types of calls, but it is usually not possible or cost effective to have every agent be able to handle every type of call. Thus, the agents tend to have different skills, in different combinations. In such an environment, it is challenging to route calls...

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

We model the set of tenure-track faculty members at a university as a queue, where "customers" in queue are faculty members in active careers. Arrivals to the queue are usually young, untenured assistant professors, and departures from the queue are primarily those who do not pass a promotion or...

Applying the technique of smoothed perturbation analysis (SPA) to the GI/G/m queue with first-come, first-served (FCFS) queue discipline, we derive sample path estimators for the second derivative of mean steady-state system time with respect to a parameter of the service time distribution. Such...

We investigate the fixed, sample-size, batch-mean procedure for creating confidence intervals from simulated data obtained from a stochastic queueing system with multiple customer classes. We show that, for a multiclass M/M/1 queue, serial correlation between customers of the same class...