Time optimal algorithm for uncertain resource allocation problem in a complex of operations

An uncertain resource allocation problem in a complex of independent (parallel) operations is considered in order to minimize the total execution time of all operations. Its known deterministic version is generalized towards the uncertain case when values of parameters in models of the operations belong to given intervals, and so different realizations of their values (different scenarios) can occur. Then, a robust optimal resource allocation algorithm is presented and proved taking into account the Hurwicz criterion. The idea of the algorithm consists in reducing the problem with uncertain input data to a known deterministic problem. A numerical example is also given.