Login / Signup

Moderately exponential approximation for makespan minimization on related machines.

Marin BougeretPierre-François DutotDenis Trystram
Published in: Theor. Comput. Sci. (2013)
Keyphrases
  • makespan minimization
  • parallel machines
  • polynomial time approximation
  • flowshop
  • special case
  • genetic algorithm
  • evolutionary algorithm
  • cost function
  • scheduling problem
  • shortest path
  • error bounds
  • processing times