1. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows. Theory, algorithms, and applications. Englewood Cliffs: Prentice Hall.
2. Alvarez-Valdes, R., & Tamarit, J. M. (1989). Heuristic algorithms for resource constrained project scheduling: A review and empirical analysis. In R. Slowinski & J. Weglarz (Eds.), Advances in project scheduling (pp. 113–134). Amsterdam: Elsevier.
3. Baroum, S. M. (1992). An exact solution procedure for maximizing the net present value of resource-constrained projects, Unpublished PhD Dissertation, Indiana University.
4. Beşikci, U., Bilge, Ü., & Ulusoy, G. (2012). Resource dedication problem in a multi-project environment.
5. Bianco, L., Dell’Olmo, P., & Speranza, M. G. (1998). Heuristics for multi-mode scheduling problems with dedicated resources. European Journal of Operational Research, 107, 260–271.