Some complexity and approximation results for coupled-tasks scheduling problem according to topology
Year of publication: |
October-December 2016
|
---|---|
Authors: | Darties, Benoit ; Giroudeau, Rodolphe ; König, Jean-Claude ; Simonin, Gilles |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 50.2016, 4/5, p. 781-795
|
Subject: | coupled-task scheduling model | complexity | polynomial-time approximation algorithm | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el, (2018)
-
Hochbaum, Dorit S., (2019)
-
Energetic reasoning for energy-constrained scheduling with a continuous resource
Artigues, Christian, (2015)
- More ...
-
Scheduling in the presence of processor networks : complexity and approximation
Boudet, Vincent, (2012)
-
A Heuristic for a Scheduling Problem with Communication Delays
Munier, Alix, (1997)
-
Hernandez, Florent, (2016)
- More ...