非平稳排序问题的抽象与控制技术
Abstraction and control techniques for non-stationary scheduling problems
摘要：
本文从一个新的角度来看待调度问题，试图弥合经典的启发式方法和系统识别和控制策略之间的差距。为了这个目的，一个完整的数学公式的一般调度过程的推导，从非常广泛的假设。这允许更大的操作自由度，并保证识别（和控制）技术的分辨率。一个自适应和切换策略，提出了一个简单的轮循算法的性能。
英文摘要：
The paper faces the problem of scheduling from a new perspective, trying to bridge the gap between classical heuristic approaches and system identification and control strategies. To this aim, a complete mathematical formulation of a general scheduling process is derived, beginning from very broad assumptions. This allows a greater freedom of manipulation and guarantee the resolution of the identification (and control) techniques. Both an adaptive and a switching strategies are presented in relation to the performances of a simple Round Robin algorithm.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
