























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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。