Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm

Shih-Wei Lin, Kuo-Ching Ying. Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm. Computers & OR, 40(6):1625-1647, 2013. [doi]

@article{LinY13-3,
  title = {Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm},
  author = {Shih-Wei Lin and Kuo-Ching Ying},
  year = {2013},
  doi = {10.1016/j.cor.2011.08.009},
  url = {http://dx.doi.org/10.1016/j.cor.2011.08.009},
  researchr = {https://researchr.org/publication/LinY13-3},
  cites = {0},
  citedby = {0},
  journal = {Computers & OR},
  volume = {40},
  number = {6},
  pages = {1625-1647},
}