Best compromise solution for a new multiobjective scheduling problem. Setämaa-Kärkkäinen, A., Miettinen, K., & Vuori, J. Computers & OR, 33:2353-2368, 2006.
Best compromise solution for a new multiobjective scheduling problem. [link]Link  Best compromise solution for a new multiobjective scheduling problem. [link]Paper  bibtex   
@article{journals/cor/Setamaa-KarkkainenMV06,
  added-at = {2006-02-08T00:00:00.000+0100},
  author = {Setämaa-Kärkkäinen, Anne and Miettinen, Kaisa and Vuori, Jarkko},
  biburl = {https://www.bibsonomy.org/bibtex/270b7ea8485f6dc2c6aa89e459464c25f/dblp},
  date = {2006-02-08},
  description = {dblp},
  ee = {http://dx.doi.org/10.1016/j.cor.2005.02.006},
  interhash = {6b8020995c563d64742a3cc586d2845e},
  intrahash = {70b7ea8485f6dc2c6aa89e459464c25f},
  journal = {Computers & OR},
  keywords = {dblp},
  pages = {2353-2368},
  timestamp = {2006-02-08T00:00:00.000+0100},
  title = {Best compromise solution for a new multiobjective scheduling problem.},
  url = {http://dblp.uni-trier.de/db/journals/cor/cor33.html#Setamaa-KarkkainenMV06},
  volume = 33,
  year = 2006
}

Downloads: 0