Sensitivity Analysis of Scheduling Algorithms

Bernard Penz (1) , Christophe Rapine (1) , Denis Trystram (2, 3, 4, 5)

1 G-SCOP_ROSP - Recherche Opérationnelle pour les Systèmes de Production
2 ID-IMAG - Informatique et Distribution
3 APACHE - Parallel algorithms and load sharing
4 LMC - IMAG - Laboratoire de Modélisation et Calcul
5 MOAIS - PrograMming and scheduling design fOr Applications in Interactive Simulation

We are interested in this work in studying the performances of static scheduling policies in presence of on-line disturbances. In the general case, the sensitivity of the schedules, i.e., the degradation of the performance of the solution due to the disturbances, is linear in the magnitude of the perturbation. Our main result within this paper is to show that in some scheduling contexts, namely the case of independent tasks, the sensitivity can be guaranteed not to exceed the square root of the magnitude of the perturbation.

Mots clés: Scheduling; Sensitivity analysis; Performance guarantee; On-line disturbances; Independent tasks; Makespan and flowtime criteria

Domaines: Recherche opérationnelle [math.OC]

Bernard Penz, Christophe Rapine, Denis Trystram. Sensitivity Analysis of Scheduling Algorithms. European Journal of Operational Research, 2001, 127 (3), pp.148-157. ⟨10.1016/S0377-2217(00)00281-2⟩. ⟨hal-00239335⟩