61780
event
1286537945
1475891571
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
]]>
-
-
-
-
-
Barbara Christopher
Industrial and Systems Engineering
Contact Barbara Christopher
404.385.3102]]>
-
-
-
-
-
-
- 1242
-
1795