1. L. Becchetti, S. Leonardi, Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines, ACM Symp. Theorey of Computing, 2001.
2. M. Bender, S. Muthukrishnan, R. Rajaraman, Improved algorithms for stretch scheduling, ACM/SIAM Symp. Discrete Algorithms, 2002, pp. 762–771.
3. Speed is more powerful than clairvoyance;Berman;Nordic J. Comput.,1999
4. M. Crovella, R. Frangioso, M. Harchol-Balter, Connection scheduling in web servers, in: Proc. 1999 USENIX Symp. Internet Technologies and Systems (USITS ’99), October 1999.
5. Scheduling in the dark;Edmonds;Theoret. Comput. Sci.,2000