On choice of the queue scheduling discipline by the minimax criterion

The customer service queue scheduling problem in a time-sharing computing center is stated as that of search for a minimax-optimal service discipline in a multi-flow service system. An effective priority assignment algorithm is proposed and proved sound.