1. New algorithms for an ancient scheduling problem;Bartal,1992
2. On the on-line scheduling algorithm RLS;Chen,1993
3. New lower and upper bounds for on-line scheduling;Chen,1993
4. On the performance of on-line algorithms for partition problems;Faigle;Acta Cybernetica,1989
5. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979