Generalizing earlier work on staffing and routing in telephone call centers, we consider a processing network model with large server pools and doubly stochastic input flows. In this model the processing of a job may involve several distinct operations. Alternative processing modes are also...

Brownian networks are a class of linear stochastic control systems that arise as heavy traffic approximations in queuing theory. Such Brownian system models have been used to approximate problems of dynamic routing, dynamic sequencing and dynamic input control for queuing networks. A number of...

Consider the following due-date scheduling problem in a multiclass, acyclic, single-station service system: any class k job arriving at time t must be served by its due date t D_{k}. Equivalently, its delay ¦Ó_{k} must not exceed a given delay or lead-time D_{k}. In a stochastic system the...

Brownian networks are a class of linear stochastic control systems that arise as heavy traffic approximations in queueing theory. Such Brownian system models have been used to approximate problems of dynamic routing, dynamic sequencing and dynamic input control for queueing networks. A number of...

We study a closed, three-station queuing network with general service time distributions and balanced workloads (that is, each station has the same relative traffic intensity). If the customer population is large, then the queue length process of such a network can be approximated by driftless...

We review academic research on dual-sourcing (or dual-mode) dynamic stochastic inventory models, which study the replenishment of inventory from two sources (or two transportation modes) in the presence of demand uncertainty. The classic assumption, also adopted here, is that the two sources...