Kontogiannis, Spyros Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Kontogiannis, S. (2002). Lower Bounds & Competitive Algorithms for Online Scheduling of Unit-Size Tasks to Related Machines. In Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02) (pp. 124-133). New York, USA: ACM.