1. Alcaraz, J., & Maroto, C. (2001). A robust algorithm for resource allocation in project scheduling. Annals of Operations Research, 102, 83–109.
2. Aubin, J., & Ferland, J. A. (1989). A large scale timetabling problem. Computers and Operations Research, 16, 67–77.
3. Baar, T., Brucker, P., & Knust, S. (1998). Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem. In S. Voss, S. Martello, I. Osman, & C. Roucairol (Eds.), Meta-heuristics: advances and trends in local search paradigms for optimization (pp. 1–18). Dordrecht: Kluwer Academic.
4. Baptiste, P., Le Pape, C., & Nuijten, W. (1999). Satisfiability and time-bound adjustments for cumulative scheduling problems. Annals of Operations Research, 92, 305–333.
5. Blazewicz, J. (1978). Complexity of computer scheduling algorithms under resources constraints. In Proceedings first meeting AFCET-SMF on applied mathematics (pp. 169–178), Palaiseau, Poland.