Minimizing total busy time in parallel scheduling with application to optical networks. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2010

Minimizing total busy time in parallel scheduling with application to optical networks.

Michele Flammini
  • Function : Author
  • PersonId : 881315
Gianpiero Monaco
  • Function : Author
  • PersonId : 881316
Luca Moscardelli
  • Function : Author
  • PersonId : 881317
Hadas Shachnai
  • Function : Author
  • PersonId : 881318
Mordechai Shalom
  • Function : Author
  • PersonId : 881319
Tami Tamir
  • Function : Author
  • PersonId : 881320
Shmuel Zaks
  • Function : Author
  • PersonId : 867179
No file

Dates and versions

inria-00530961 , version 1 (31-10-2010)

Identifiers

  • HAL Id : inria-00530961 , version 1

Cite

Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, et al.. Minimizing total busy time in parallel scheduling with application to optical networks.. Theoretical Computer Science, 2010, 411 (40-42), pp.3553-3562. ⟨inria-00530961⟩
29 View
0 Download

Share

Gmail Facebook X LinkedIn More