On one problem of choosing the optimal control in multiprogramming systems

The problem of optimal planning of performaing a specified set of interrelated tasks is solved under the assumption that the number of tasks performed simultaneously is random. In the algorithm the process is represented as successive tackling of independent (in the sense of the specified interrelations) compositions of tasks. In this way the selection is significantly reduced and the planning process automated.