Abstract:
The paper shows how to find the service order to minimize the loss function $F(W_1,\ldots, W_n)$ in a $GI_n/M/1$ queueing system, where $(W_1,\ldots, W_n)$ are queueing times. The set of possible values of $(W_1,\ldots, W_n)$ is proved to make a polyhedron which is the face of a polymatroid.