1. The project scheduling polyhedron: Dimension, facets and lifting theorems;Alvarez-Valdes;European Journal of Operational Research,1993
2. Bellenguez, O., & Néron, E. (2005). Lower bounds for the multi-skill project scheduling problem with hierarchical levels of skills. In Lecture notes in computer science 3616/2005: Practice and theory of automated timetabling V: 5th international conference PATAT 2004, Pittsburgh, PA, USA, August 18–20, 2004, Revised selected papers (pp. 229–243). Springer.
3. Methods to solve multi-skill project scheduling problem;Bellenguez-Morineau;4OR,2008
4. A branch-and-bound method for solving multi-skill project scheduling problem;Bellenguez-Morineau;RAIRO Operations Research,2007
5. Project scheduling with flexible resources: Formulation and inequalities;Correia;OR Spectrum,2012