Line search method for solving a non-preemptive strictly periodic scheduling problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Scheduling Année : 2016

Line search method for solving a non-preemptive strictly periodic scheduling problem

Résumé

We study a non-preemptive strictly periodic scheduling problem. This problem arises for example in the avionic field where a set of N periodic tasks (measure of a sensor, data presentation, etc.) has to be scheduled on P processors distributed on the plane. In this article, we consider an existing heuristic which is based on the notion of equilibrium. Following a game theory analogy, each task tries successively to optimize its own schedule and therefore to produce the best response, given the other schedules. We present a new method to compute the best response, and a propagation mechanism for non-overlapping constraints, which signi cantly improves this heuristic. These improvements allow the heuristic to compare favorably with MILP solutions.
Fichier principal
Vignette du fichier
LAAS-report-Version.pdf (571.99 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00866050 , version 1 (25-09-2013)
hal-00866050 , version 2 (28-02-2017)

Identifiants

Citer

Clément Pira, Christian Artigues. Line search method for solving a non-preemptive strictly periodic scheduling problem. Journal of Scheduling, 2016, 19 (3), pp.227-243. ⟨10.1007/s10951-014-0389-6⟩. ⟨hal-00866050v2⟩
302 Consultations
263 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More