Abstract:
The efficiency of a recursive conveyor is conceptually formalized, and the optimal allocation of renewable resources is obtained by maximizing efficiency via reduction to an integer linear programming problem. The recursive functions for calculating the process schedule under an arbitrary allocation of resources are defined. The results of this paper can be used for designing conveyors or for calculating bounds in the case of combinatorial scheduling algorithms.