A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties
Keywords: Hybrid flowshops scheduling; Limited waiting time; Colonial competitive algorithm; Mixed integer linear programming; Earliness and tardiness penalties