In this paper we investigate a relatively simple deterministic four-class two-queue multiclass open network of single-server FIFO queues with traffic intensity one at each queue. Our purpose is to better understand the effect of feedback with class-dependent service times at the queues. The...

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

Some sharp bounds and simple approximations are obtained for the Erlang delay formula and for the Erlang loss formula. One of the results is then used to get a simple analytical solution for the Server Allocation Problem.

In this paper we consider perishable inventory systems with two types of demand. Demand may be for either fresh items or for somewhat older items. We model the system with two inventory stages. The first stage holds fresh items and the second stage holds the older items. We approximate the...

A cyclic queue has one server and n nodes, where each node has its own distinct type of customers that arrive from the outside. The server visits the nodes cyclically, serving the customers first at node 1, then at node 2, and so on through node n, and then repeating from node 1 again. Setup...

Call center managers are facing increasing pressure to reduce costs while maintaining acceptable service quality. Consequently, they often face constrained stochastic optimization problems, minimizing cost subject to service-level constraints. Complicating this problem is the fact that...