Managing Re-Enterable Resources on Net Graphs with Uniform Intensity Functions

The article studies optimum distribution of resources assigned to a certain set of interconnected operations by the criterion of minimizing time necessary to accomplish all the operations. In contrast to the traditional resource of separable type a resource of re-enterable type was shown, i. e. the type permitting repeated use. Formalization of the task in dynamic setting was provided. For cases of uniform linear productivity functions analytical solution was given and substantiated. Non-optimal character of certain heuristic algorithms was shown. Geometric criterion of optimum character for cases of two independent operations was highlighted. On this basis the case of complete internal resources switching was built.