Login / Signup

An approximation algorithm for scheduling two parallel machines with capacity constraints.

Heng YangYinyu YeJiawei Zhang
Published in: Discret. Appl. Math. (2003)
Keyphrases
  • parallel machines
  • scheduling problem
  • np hard
  • optimal solution
  • dynamic programming
  • objective function
  • computational complexity
  • cost function
  • upper bound
  • search space
  • parallel computing
  • capacity constraints