Login / Signup

A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machines.

Fariborz JolaiMohsen Sadegh AmalnickMohammad AlinaghianMajid Shakhsi-NiaeiHossein Omrani
Published in: J. Intell. Manuf. (2011)
Keyphrases
  • memetic algorithm
  • unrelated parallel machines
  • tabu search
  • evolutionary computation
  • parallel machines
  • machine learning
  • genetic algorithm
  • vehicle routing problem