*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************
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
