Login / Signup

Parallelized solver based on branch and bound method for task scheduling problems in consideration of communication overhead.

Shibuya TomonoriMunenori Kai
Published in: PACRIM (2015)
Keyphrases
  • communication overhead
  • branch and bound method
  • mixed integer programming
  • lower bound
  • np complete
  • communication cost
  • optimization problems
  • scheduling algorithm
  • reduce the search space