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.

中文翻译：

---

递归输送机效率的估算和优化

递归输送机的效率在概念上已形式化，可再生资源的最佳分配是通过简化整数线性规划问题来最大化效率来获得的。定义了用于在资源的任意分配下计算过程计划的递归函数。本文的结果可用于设计输送机或在组合调度算法的情况下用于计算边界。