1. S. Chakrabarti, C. Phillips, A.S. Schulz, D. Shmoys, C. Stein, J. Wein, Improved approximation algorithms for minsum criteria, in: Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. 1099, F. Meyer auf der Heide, B. Monien (Ed.), Springer, Berlin, 1996, pp. 646–657.
2. A supermodular relaxation for scheduling with release dates;Goemans,1996
3. M.X. Goemans, Improved approximation algorithms for scheduling with release dates, Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 591–598.
4. Scheduling to minimize average completion time: Off-line and on-line approximation algorithms;Hall;Math. Oper. Res.,1997
5. Preemptive scheduling of uniform machines subject to release dates;Labetoulle,1984