In the design and operation of service systems, it is important to determine an appropriate level of server utilization (the proportion of time each server should be working). In a multi-server queue with unlimited waiting space, the appropriate server utilization typically increases as the...

An important design problem for queueing systems is to determine the best order for two or more service stations in series. For given external arrival process and given service-time distributions, the object is to determine the order of the stations (to be used by all customers) that minimizes...

This paper discusses an approximation for single-class departure processes from multi-class queues: If the arrival rate of one class upon one visit to the queue is a small proportion of the total arrival rate there, then the departure process for that class from that visit should be nearly the...

We propose an enhancement to the parametric-decomposition method for calculating approximate steady-state performance measures of open queueing networks with non-Poisson arrival processes and nonexponential service-time distributions. Instead of using a variability parameter c_a² for each arrival...

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

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