Optimal priorities in GI|Gn|1 queue

A polynomial-time algorithm based on reduction to a polyhedron minimization problem is proposed for minimizing a given function F(W₁,...,W_n) that depends on the mean waiting times in the Gl|G_n|l queue.Translated from Kibernetika, No. 2, pp. 80–85, March–April, 1991.