Stochastics Seminar :: Tandem Lines with Dedicated and Flexible Servers
Consider a tandem queueing network with $Ngeq 2$ stations, $Mgeq 1$ servers, infinite supply of jobs in front of station 1, infinite room for completed jobs after station $N$, and either a finite or infinite buffer between any two consecutive stations. We study the dynamic allocation of servers to stations with the goal of maximizing the long-run average throughput, assuming that only a subset of the servers are flexible in that they are able to work at several stations, with the remaining servers being dedicated to particular stations.
Authors: Sigrun Andradottir, Hayriye Ayhan, and Douglas G. Down
- Workflow Status: Published
- Created By: Barbara Christopher
- Created: 10/08/2010
- Modified By: Fletcher Moore
- Modified: 10/07/2016