1. New algorithms for an ancient scheduling problem;Bartal;Proc. 24th ACM Symp. on Theory of Computing,1992
2. On the power of randomization in on-line algorithms;Ben-David;Proc. 22nd Ann. Symp. on Theory of Computing,1990
3. An optimal algorithm for preemptive on-line scheduling;Chen,1994
4. Bounds for certain multiprocessing anomalies;Graham;Bell System Tech. J.,1966