Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem

Leandro Resende Mundim, Thiago Alves de Queiroz. Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem. Electronic Notes in Discrete Mathematics, 66:127-134, 2018. [doi]

@article{MundimQ18,
  title = {Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem},
  author = {Leandro Resende Mundim and Thiago Alves de Queiroz},
  year = {2018},
  doi = {10.1016/j.endm.2018.03.017},
  url = {https://doi.org/10.1016/j.endm.2018.03.017},
  researchr = {https://researchr.org/publication/MundimQ18},
  cites = {0},
  citedby = {0},
  journal = {Electronic Notes in Discrete Mathematics},
  volume = {66},
  pages = {127-134},
}