Login / Signup

Minimizing the makespan for Unrelated Parallel Machines.

Yunsong GuoAndrew LimBrian RodriguesLiang Yang
Published in: Int. J. Artif. Intell. Tools (2007)
Keyphrases
  • unrelated parallel machines
  • scheduling problem
  • parallel machines
  • setup times
  • open shop
  • flowshop
  • scheduling jobs
  • processing times
  • lower bound
  • np hard
  • tabu search
  • steady state
  • precedence constraints