Citation
Line search method for solving a non-preemptive strictly periodic scheduling problem. In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium, pages 356-371, 2013.
Paper
Abstract
We study a non-preemptive strictly periodic scheduling problem. This problem arises for example in the avionic ?eld 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.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2013-356-371-P, author = {C. Pira and C. Artigues },
title = {Line search method for solving a non-preemptive strictly periodic scheduling problem},
booktitle = {In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium},
year = {2013},
editor = {G. Kendall and B. McCollum and G. {Venden Berghe}},
pages = {356--371},
note = {Paper},
abstract = {We study a non-preemptive strictly periodic scheduling problem. This problem arises for example in the avionic ?eld 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.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2013-356-371-P.pdf} }