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]

@article{BehnamianZ11,
  title = {A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties},
  author = {J. Behnamian and M. Zandieh},
  year = {2011},
  doi = {10.1016/j.eswa.2011.04.241},
  url = {http://dx.doi.org/10.1016/j.eswa.2011.04.241},
  researchr = {https://researchr.org/publication/BehnamianZ11},
  cites = {0},
  citedby = {0},
  journal = {Expert Syst. Appl.},
  volume = {38},
  number = {12},
  pages = {14490-14498},
}