Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communications Delays - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Reports (Research Report) Year : 2005

Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communications Delays

Rodolphe Giroudeau
Algorithmes et Performance des Réseaux
CV
Jean-Claude König
Algorithmes et Performance des Réseaux
CV
Feryal Windal
Jérôme Palaysi
  • Function : Author
  • PersonId : 938554
Algorithmes et Performance des Réseaux

Abstract

Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communications Delays

Keywords

ORDONNANCEMENT

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
D503.PDF (294.79 Ko) Télécharger le fichier

Christine Carvalho De Matos  : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00106681

Submitted on : Monday, October 16, 2006-9:50:32 AM

Last modification on : Friday, March 24, 2023-2:52:48 PM

Long-term archiving on : Tuesday, April 6, 2010-5:49:15 PM

Download

Dates and versions

lirmm-00106681 , version 1 (16-10-2006)

Identifiers

  • HAL Id : lirmm-00106681 , version 1

Cite

Rodolphe Giroudeau, Jean-Claude König, Feryal Windal, Jérôme Palaysi. Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communications Delays. [Research Report] 05025, LIRMM. 2005. ⟨lirmm-00106681⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS LIRMM APR APR-LIRMM LARA MIPS UNIV-MONTPELLIER
72 View
640 Download

Share

More