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

J. Behnamian, M. Zandieh. A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties. Expert Syst. Appl., 38(12):14490-14498, 2011. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.