Optimization of the fluid model of scheduling: local predictions

In this research a continuous model for resource allocations in a queuing system is considered and a local prediction on the system behavior is developed. As a result we obtain a set of possible cases, some of which lead to quite clear optimization problems. Currently, the main result of this research direction is an algorithm delivering an explicit solution to the problem of minimization of the sum of all queues mean delays (which is not the overall mean delay) in the case of the so-called uniform steadiness. Basically, in this case we deal with convex optimization on a polytope.