Recursive Refinement of Lower Bounds in the Multiprocessor Scheduling Problem

Satoshi Fujita, Masayuki Masukawa, Shigeaki Tagashira. Recursive Refinement of Lower Bounds in the Multiprocessor Scheduling Problem. In Harald Kosch, László Böszörményi, Hermann Hellwagner, editors, Euro-Par 2003. Parallel Processing, 9th International Euro-Par Conference, Klagenfurt, Austria, August 26-29, 2003. Proceedings. Volume 2790 of Lecture Notes in Computer Science, pages 201-205, Springer, 2003. [doi]

@inproceedings{FujitaMT03:0,
  title = {Recursive Refinement of Lower Bounds in the Multiprocessor Scheduling Problem},
  author = {Satoshi Fujita and Masayuki Masukawa and Shigeaki Tagashira},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2790&spage=201},
  tags = {refinement},
  researchr = {https://researchr.org/publication/FujitaMT03%3A0},
  cites = {0},
  citedby = {0},
  pages = {201-205},
  booktitle = {Euro-Par 2003. Parallel Processing, 9th International Euro-Par Conference, Klagenfurt, Austria, August 26-29, 2003. Proceedings},
  editor = {Harald Kosch and László Böszörményi and Hermann Hellwagner},
  volume = {2790},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-40788-X},
}