Smooth scheduling under variable rates or the analog-digital confinement game (Q733734)

A non-terminating scheduling problem is dealt and analyzed. Especially, the attention is focused on a server system in which multiple resources serve clients having variable needs, and in each time-slot every resource may serve at most one client. In such a system, the schedule is to respect the demands of its smoothness, and the main contribution of the presented paper is the construction of online smooth schedulers for arbitrarily variable rates of needs of clients under the restriction that each client is served at least once in each time-slot. Moreover, a complete information two-players game is constructed, by means of which the comparison of analog and digital player strategies are compared. The achieved results demonstrate the convenience of such a game for approximation of an analog serving process by a digital one.