 | 2011 |
| 20 |  | Gilles Simonin,
Rodolphe Giroudeau,
Jean-Claude König,
Benoît Darties:
Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph.
ICAPS 2011 |
| 19 |  | Rodolphe Giroudeau,
Jean-Claude König,
B. Valery:
Erratum to: Scheduling UET-tasks on a star network: complexity and approximation.
4OR 9(1): 111 (2011) |
| 18 |  | Rodolphe Giroudeau,
Jean-Claude König,
B. Valery:
Scheduling UET-tasks on a star network: complexity and approximation.
4OR 9(1): 29-48 (2011) |
| 17 |  | Marwane Bouznif,
Rodolphe Giroudeau:
Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks.
Adv. Operations Research 2011: (2011) |
| 16 |  | Gilles Simonin,
Rodolphe Giroudeau,
Jean-Claude König:
Complexity and approximation for scheduling problem for a torpedo.
Computers & Industrial Engineering 61(2): 352-356 (2011) |
| 15 |  | Gilles Simonin,
Benoît Darties,
Rodolphe Giroudeau,
Jean-Claude König:
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor.
J. Scheduling 14(5): 501-509 (2011) |
| 2010 |
| 14 |  | Gilles Simonin,
Rodolphe Giroudeau,
Jean-Claude König:
Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks.
Electronic Notes in Discrete Mathematics 36: 647-654 (2010) |
| 2008 |
| 13 |  | Rodolphe Giroudeau,
Jean-Claude König:
General scheduling non-approximability results in presence of hierarchical communications.
European Journal of Operational Research 184(2): 441-457 (2008) |
| 12 |  | Rodolphe Giroudeau:
Seuil d'approximation pour le modèle UET-UCT en présence d'une infinité de processeurs. Une preuve alternative.
Technique et Science Informatiques 27(5): 571-588 (2008) |
| 11 |  | Rodolphe Giroudeau,
Jean-Claude König,
Farida Kamila Moulai,
Jérôme Palaysi:
Complexity and approximation for precedence constrained scheduling problems with large communication delays.
Theor. Comput. Sci. 401(1-3): 107-119 (2008) |
| 2005 |
| 10 |  | Rodolphe Giroudeau,
Jean-Claude König,
Feryal-Kamila Moulaï,
Jérôme Palaysi:
Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communication Delays.
Euro-Par 2005: 252-261 |
| 9 |  | Rodolphe Giroudeau:
Seuil d'approximation pour un problème d'ordonnancement en présence de communications hiérarchiques.
Technique et Science Informatiques 24(1): 95-114 (2005) |
| 2004 |
| 8 |  | Rodolphe Giroudeau,
Jean-Claude König:
General Non-Approximability Results in Presence of Hierarchical Communications.
ISPDC/HeteroPar 2004: 312-319 |
| 7 |  | Evripidis Bampis,
Rodolphe Giroudeau,
Alexander Kononov:
Scheduling Tasks with Small Communication Delays for Clusters of Processors.
Annals OR 129(1-4): 47-63 (2004) |
| 2003 |
| 6 |  | Evripidis Bampis,
Rodolphe Giroudeau,
Jean-Claude König:
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
Theor. Comput. Sci. 290(3): 1883-1895 (2003) |
| 2002 |
| 5 |  | Eric Angel,
Evripidis Bampis,
Rodolphe Giroudeau:
Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters.
Euro-Par 2002: 217-224 |
| 2001 |
| 4 |  | Evripidis Bampis,
Rodolphe Giroudeau,
Alexander Kononov:
Scheduling tasks with small communication delays for clusters of processors.
SPAA 2001: 314-315 |
| 2000 |
| 3 |  | Evripidis Bampis,
Rodolphe Giroudeau,
Jean-Claude König:
An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications.
STACS 2000: 443-454 |
| 2 |  | Evripidis Bampis,
Rodolphe Giroudeau,
Jean-Claude König:
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications.
Parallel Processing Letters 10(1): 133-140 (2000) |
| 1999 |
| 1 |  | Evripidis Bampis,
Rodolphe Giroudeau,
Jean-Claude König:
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications.
Euro-Par 1999: 369-372 |