1. Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., et al. (1999) Approximation schemes for minimizing average weighted completion time with release dates. In 40th annual symposium on foundations of computer science, Piscataway: IEEE (pp. 32–43).
2. Baptiste, P., Brucker, P., Knust, S., & Timkovsky, V. G. (2004). Ten notes on equal-processing-time scheduling. Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 2(2), 111–127.
3. Brucker, P., Jurisch, B., & Krämer, A. (1997). Complexity of scheduling problems with multi-purpose machines. Annals of Operations Research, 70, 57–73.
4. Brucker, P., & Kravchenko, S. A. (2005). Scheduling jobs with release times on parallel machines to minimize total tardiness. Fachbereich Mathematik/Informatik: Universität Osnabrück.
5. Brucker, P., & Kravchenko, S. A. (2008). Scheduling jobs with equal processing times and time windows on identical parallel machines. Journal of Scheduling, 11(4), 229–237.