Abstraction and control techniques for non-stationary scheduling problems

2009/11/30 by Innocenti, Giacomo, Pretini, Luca
#Adaptation and Self-Organizing Systems (nlin.AO) #Distributed #FOS: Computer and information sciences #FOS: Physical sciences #Parallel #and Cluster Computing (cs.DC)

paper · doi:10.48550/arxiv.0912.0032

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.

Related

• A control-theoretical methodology for the scheduling problem
• Fundamental lemmas for the determination of optimal control strategies\n for a class of single machine family scheduling problems
• A MILP model for single machine family scheduling with sequence-dependent batch setup and controllable processing times
• A Markov Chain Model for the Analysis of Round-Robin Scheduling Scheme
• Revisiting the Schedule Graph Generation for the Exact and Sustainable Analysis of Non-preemptive Scheduling