Skip to main content
Article thumbnail
Location of Repository

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

By Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir and Shmuel Zaks


International audienc

Topics: [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]
Publisher: Elsevier
Year: 2010
OAI identifier: oai:HAL:inria-00530961v1
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.