An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem

Jérémie Dubois-Lacoste, Federico Pagnozzi, Thomas Stützle. An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem. Computers & OR, 81:160-166, 2017. [doi]

@article{Dubois-LacosteP17,
  title = {An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem},
  author = {Jérémie Dubois-Lacoste and Federico Pagnozzi and Thomas Stützle},
  year = {2017},
  doi = {10.1016/j.cor.2016.12.021},
  url = {http://dx.doi.org/10.1016/j.cor.2016.12.021},
  researchr = {https://researchr.org/publication/Dubois-LacosteP17},
  cites = {0},
  citedby = {0},
  journal = {Computers & OR},
  volume = {81},
  pages = {160-166},
}