arXiv · 0912.0032
Abstraction and control techniques for non-stationary scheduling problems
Abstract
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.
Explore related subjects
Keep this discovery
Giacomo Innocenti, Luca Pretini. 2009-11-30. Abstraction and control techniques for non-stationary scheduling problems. https://arxiv.org/abs/0912.0032
Cite the original work for its findings. Save a collection to share your selection of sources.