Optimal Non-preemptive Semi-online Scheduling on Two Related Machines

Leah Epstein, Lene M. Favrholdt. Optimal Non-preemptive Semi-online Scheduling on Two Related Machines. In Krzysztof Diks, Wojciech Rytter, editors, Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings. Volume 2420 of Lecture Notes in Computer Science, pages 245-256, Springer, 2002. [doi]

@inproceedings{EpsteinF02:1,
  title = {Optimal Non-preemptive Semi-online Scheduling on Two Related Machines},
  author = {Leah Epstein and Lene M. Favrholdt},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2420/24200245.htm},
  researchr = {https://researchr.org/publication/EpsteinF02%3A1},
  cites = {0},
  citedby = {0},
  pages = {245-256},
  booktitle = {Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
  editor = {Krzysztof Diks and Wojciech Rytter},
  volume = {2420},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-44040-2},
}