Login / Signup

A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties.

Javad BehnamianMostafa Zandieh
Published in: Expert Syst. Appl. (2011)
Keyphrases
  • objective function
  • scheduling problem
  • flowshop scheduling
  • optimal solution
  • computational complexity
  • cost function
  • special case
  • np hard
  • combinatorial optimization
  • single machine scheduling problem