Scheduling in the presence of processor networks : complexity and approximation
Year of publication: |
2012
|
---|---|
Authors: | Boudet, Vincent ; Cohen, Johanne ; Giroudeau, Rodolphe ; König, Jean-Claude |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 46.2012, 1, p. 1-22
|
Subject: | scheduling | non-approximability | processor network model | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Unternehmensnetzwerk | Business network | Netzwerk | Network | Durchlaufzeit | Lead time |
-
Incremental network design with maximum flows
Kalinowski, Thomas, (2015)
-
Modeling and solving the multi-period disruptions scheduling problem on urban networks
Coco, Amadeu A., (2020)
-
Optimal proactive monitor placement & scheduling for IoT networks
Mostafa, Basma, (2022)
- More ...
-
Some complexity and approximation results for coupled-tasks scheduling problem according to topology
Darties, Benoit, (2016)
-
A Heuristic for a Scheduling Problem with Communication Delays
Munier, Alix, (1997)
-
Hernandez, Florent, (2016)
- More ...