Login / Signup

Improved Lower Bounds on Time and Processors for Scheduling Procedence Graphs on Multicomputer Systems.

Kamal Kumar JainV. Rajaraman
Published in: J. Parallel Distributed Comput. (1995)
Keyphrases
  • lower bound
  • upper bound
  • scheduling problem
  • management system
  • parallel algorithm
  • complex systems
  • parallel processing
  • resource allocation
  • branch and bound
  • lower and upper bounds
  • graph theoretic