Sensitivity analysis of scheduling algorithms

Sensitivity analysis of scheduling algorithms

0.00 Avg rating0 Votes
Article ID: iaor20021691
Country: Netherlands
Volume: 134
Issue: 3
Start Page Number: 606
End Page Number: 615
Publication Date: Nov 2001
Journal: European Journal of Operational Research
Authors: , ,
Keywords: combinatorial analysis
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.