1. Ballestín, F. (2002). Nuevos métodos de resolución del problema de secuenciación de proyectos con recursos limitados, Unpublished PhD Dissertation, Universidad de Valencia.
2. Blazewicz, J., Lenstra, J.K., and Rinooy Kan, A.H.G. (1983). Scheduling subject to resource constraints: classification and complexity, Discrete Applied Mathematics, 5:11–24.
3. Brucker, P., Drexl, A., Möhring, R., Neumann K. and Pesch, E. (1999). Resource-constrained project scheduling: Notation, classification, models, and methods, European Journal of Operational Research, 112:3–41.
4. Dorigo, M., and Maniezzo, V. (1993). Parallel Genetic Algorithms: Introduction and Overview of Current Research, in: Parallel Genetic Algorithms: Theory & Applications, J. Stenders, ed., IOS Press, Amsterdam, pp. 5–42.
5. Garey, M. R., and Johnson, D. S. (1979). Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company. San Francisco.