Login / Signup

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

Michele FlamminiGianpiero MonacoLuca MoscardelliHadas ShachnaiMordechai ShalomTami TamirShmuel Zaks
Published in: Theor. Comput. Sci. (2010)
Keyphrases
  • optical networks
  • scheduling problem
  • social networks
  • multi agent systems
  • sensor networks
  • resource allocation
  • scheduling algorithm
  • completion times