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 Access content directly
Reports (Research Report) Year : 2005

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

Rodolphe Giroudeau
Jean-Claude König
Feryal Windal
Jérôme Palaysi
  • Function : Author
  • PersonId : 938554

Abstract

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

Keywords

Domains

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

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⟩
65 View
632 Download

Share

Gmail Facebook X LinkedIn More