Robustness of Efficient Server Assignment Policies to Service Time Distributions in Finite-Buffered Lines.

The article discusses the study on the assignment of flexible servers in throughput maximization in non-Markovian tandem lines with finite buffers. It states that the study provides theoretical and numerical results and considers various objectives to determine optimal server policy validity. Results verify the robustness of optimal server assignment policy to the service time distributions. It proposes the server assignment heuristics for systems with various service time distributions.