Skip to Main content Skip to Navigation
Journal articles

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

Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/inria-00530961
Contributor : Gianpiero Monaco <>
Submitted on : Sunday, October 31, 2010 - 3:45:38 PM
Last modification on : Friday, January 8, 2021 - 11:22:05 AM

Identifiers

  • HAL Id : inria-00530961, version 1

Citation

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, Elsevier, 2010, 411 (40-42), pp.3553-3562. ⟨inria-00530961⟩

Share

Metrics

Record views

115