MO-Greedy: An Extended Beam-Search Approach for Solving a Multi-criteria Scheduling Problem on Heterogeneous Machines

Louis-Claude Canon, Emmanuel Jeannot. MO-Greedy: An Extended Beam-Search Approach for Solving a Multi-criteria Scheduling Problem on Heterogeneous Machines. In 25th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2011, Anchorage, Alaska, USA, 16-20 May 2011 - Workshop Proceedings. pages 57-69, IEEE, 2011. [doi]

@inproceedings{CanonJ11,
  title = {MO-Greedy: An Extended Beam-Search Approach for Solving a Multi-criteria Scheduling Problem on Heterogeneous Machines},
  author = {Louis-Claude Canon and Emmanuel Jeannot},
  year = {2011},
  doi = {10.1109/IPDPS.2011.127},
  url = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2011.127},
  researchr = {https://researchr.org/publication/CanonJ11},
  cites = {0},
  citedby = {0},
  pages = {57-69},
  booktitle = {25th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2011, Anchorage, Alaska, USA, 16-20 May 2011 - Workshop Proceedings},
  publisher = {IEEE},
  isbn = {978-1-61284-425-1},
}