##
**Optimal server allocation in a system of multi-server stations.**
*(English)*
Zbl 0636.90034

Consider a closed queueing network with a set of stations. The service rate at each station is an increasing concave function of the number of jobs at that station. Suppose there also exists a station that has c (\(\geq 1)\) parallel servers, each of which has a fixed service rate. We show that the throughput of this network is an increasing concave function with respect to c. This result is then applied to solve the optimal server allocation problem in a system of multi-server stations with a fixed buffer capacity (for the total number of jobs) at each station. For a single-station system, the simultaneous optimal allocation of both servers and buffer capacity is also studied.

### MSC:

90B22 | Queues and service in operations research |

60K25 | Queueing theory (aspects of probability theory) |