1. F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S.Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, and M. Sviridenko, ?Approximation schemes for minimizing average weighted completion time withrelease dates? in Proceedingof the40th Annual Symposium on Foundations of Computer Science, New York,1999, pp. 32?43.
2. K.R. Baker, Introduction to Sequencing and Scheduling, Wiley, 1974.
3. P. Brucker, A. Gladky, H. Hoogeveen, M. Kovalyov, C. Potts, T. Tautenhahn, and S. van de Velde, ?Scheduling a batching machine? Journal of Scheduling, vol. 1, pp. 31?54, 1998.
4. V. Chandru, C.Y. Lee, and R. Uzsoy, ?Minimizing total completion time on a batch processing machine with job families? O. R. Lett., vol. 13, pp. 61?65, 1993.
5. M. Cai, X. Deng, H. Feng, G. Li, and G. Liu, ?A PTAS for minimizing total completion time of bounded batch scheduling? Lecture Notes in Computer Science 2337 (IPCO?2002), MIT, pp. 304?314, 2002.