1. A.C.F. Alvim and C.C. Ribeiro. A hybrid bin-packing heuristic to multiprocessor scheduling. In C.C. Ribeiro and S.L. Martins, editors, Lecture Notes in Computer Science, volume 3059, pages 1–13. Springer-Verlag, Berlin, 2004.
2. L. Babel, H. Kellerer, and V. Kotov. The k-partitioning problem. Mathematical Methods of Operations Research, 47:59–82, 1998.
3. P. Brucker. Scheduling Algorithms. Springer-Verlag, New York, 2001.
4. S. Cahon, N. Melab, and E.-G. Talbi. Paradiseo: A framework for the reusable design of parallel and distributed meta-heuristics. Journal of Heuristics, 10(3):357–380, 2004.
5. B. Chen. Parallel scheduling for early completion. In J.Y.T. Leung, editor, Handbook of Scheduling: Algorithms, Models, and Performance Analysis, chapter 9, pages 175–184. CRC Press, Boca Raton, FL, 2004.