Citation

Pira, C. and Artigues, C. Line search method for solving a non-preemptive strictly periodic scheduling problem. Journal of Scheduling, 19 (3): 227-243, 2016.

Selected


Abstract

We study a non-preemptive strictly periodic scheduling problem. This problem arises for example in the avionic field where a set of periodic tasks (measure of a sensor, data presentation, etc.) has to be scheduled on 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. This iterative process continues until an equilibrium is reached. We present a new method to compute the best response which significantly improves the previously proposed heuristic, and compares favorably with MILP solutions.


pdf

There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)


doi

The doi for this publication is 10.1007/s10951-014-0389-6 You can link directly to the original paper, via the doi, from here

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

@ARTICLE{2016-227-243-SI, author = {Pira, Clement and Artigues, Christian},
title = {{Line search method for solving a non-preemptive strictly periodic scheduling problem}},
journal = {Journal of Scheduling},
year = {2016},
volume = {{19}},
pages = {227--243},
number = {3},
note = {Selected},
abstract = {{We study a non-preemptive strictly periodic scheduling problem. This problem arises for example in the avionic field where a set of periodic tasks (measure of a sensor, data presentation, etc.) has to be scheduled on 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. This iterative process continues until an equilibrium is reached. We present a new method to compute the best response which significantly improves the previously proposed heuristic, and compares favorably with MILP solutions.}},
doi = {{10.1007/s10951-014-0389-6}},
eissn = {{1099-1425}},
issn = {{1094-6136}},
owner = {Graham},
timestamp = {2017.01.18},
unique-id = {{ISI:000377606100003}} }