Citation
Computing Lower Bounds for the Schedule of a Multifunction Radar. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 523-530, 2007.
Paper
Abstract
Among several other tasks, the radar of a fighter has to search, track and identify potential targets. The waveforms used by the radar for each of these tasks are most often incompatible and hence, cannot be processed simultaneously. Moreover, these tasks are repeated several times in a cyclic fashion. Altogether, this defines a complex scheduling problem that impacts a lot on the quality of the radar’s output. In [10], a formal framework has been defined for this real time scheduling problem and we have introduced several techniques to compute efficient schedules for the radar. In order to evalutate the quality of these schedules, we present in this paper, two algorithms that compute high lower bounds for the problem. The first one is based upon a column generation scheme, the other one consists in a relaxation of the time-indexed MIP formulation of the problem.
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{2007-523-530-P, author = {E. Winter and R. Sadykov},
title = {Computing Lower Bounds for the Schedule of a Multifunction Radar},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {523--530},
note = {Paper},
abstract = {Among several other tasks, the radar of a fighter has to search, track and identify potential targets. The waveforms used by the radar for each of these tasks are most often incompatible and hence, cannot be processed simultaneously. Moreover, these tasks are repeated several times in a cyclic fashion. Altogether, this defines a complex scheduling problem that impacts a lot on the quality of the radar’s output. In [10], a formal framework has been defined for this real time scheduling problem and we have introduced several techniques to compute efficient schedules for the radar. In order to evalutate the quality of these schedules, we present in this paper, two algorithms that compute high lower bounds for the problem. The first one is based upon a column generation scheme, the other one consists in a relaxation of the time-indexed MIP formulation of the problem.},
owner = {user},
timestamp = {2012.05.22},
webpdf = {2007-523-530-P.pdf} }