.png){kind=icon}
.png){kind=icon}
Return
Server allocation for zero buffer tandem queues
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2013.05.029.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we consider the problem of allocating servers to maximize throughput for tandem queues with no buffers. We propose an allocation method that assigns servers to stations based on the mean service times and the current number of servers assigned to each station. A number of simulations are run on different configurations to refine and verify the algorithm. The algorithm is proposed for stations with exponentially distributed service times, but where the service rate at each station may be different. We also provide some initial thoughts on the impact on the proposed allocation method of including service time distributions with different coefficients of variation. (C) 2013 Elsevier B.V. All rights reserved.
Keywords:
Server allocation
Zero buffer
Tandem queue
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W