R. Alvarez-valdés and J. M. Tamarit-goerlich, The project scheduling polyhedron: dimension, facets, and lifting theorems, Eur. J. Oper. Res, vol.67, pp.204-220, 1993.

P. Baptiste and S. Demassey, Tight LP bounds for resource constrained project scheduling, OR Spectrum, vol.26, pp.251-262, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00124163

P. Brucker, A. Drexl, R. Möhring, K. Neumann, and E. Pesch, Resource-constrained project scheduling: notation, classification, model, and methods, Eur. J. Oper. Res, vol.112, pp.3-41, 1999.

P. Brucker and S. Knust, A linear programming and constraint propagation-based lower bound for the rcpsp, Eur. J. Oper. Res, vol.127, pp.355-362, 2000.

J. Damay, A. Quilliot, and E. Sanlaville, Linear programming based algorithms for preemptive and non-preemptive rcpsp, Eur. J. Oper. Res, vol.182, pp.1012-1022, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00445417

M. R. Garey and D. S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, 1979.

S. Gualandi and F. Malucelli, Exact solution of graph coloring problems via constraint programming and column generation, INFORMS J. Comput, vol.24, pp.1-20, 2011.

P. Hansen, M. Labbé, and D. Schindl, Set covering and packing formulations of graph coloring: slgorithms and first polyhedral results, Discret. Optim, vol.6, pp.135-147, 2009.

J. R. Hardin, G. L. Nemhauser, and M. W. Savelsbergh, Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements, Discret. Optim, vol.5, pp.19-35, 2008.

W. Herroelen, E. Demeulemeester, and B. De-reyck, An integrated classification scheme for resource scheduling, 1999.

R. Klein, Scheduling of Resource Constraints Projects, 1999.

R. Kolish and A. Sprecher,

E. Malaguti, M. Monaci, and P. Toth, An exact approach for the vertex coloring problem, Discret. Optim, vol.8, pp.174-190, 2010.

A. Mehrotra and M. Trick, A column generation approach for graph coloring, INFORMS J. Comput, vol.8, pp.344-354, 1996.

A. Mingozzi, V. Maniezzo, S. Ricciardelli, and L. Bianco, An exact algorithm for the resource-constrained project scheduling based on a new mathematical formulation, Manag. Sci, vol.44, pp.714-729, 1998.

A. Moukrim, A. Quilliot, and H. Toussaint, Branch and price for preemptive resource constrained project scheduling problem based on interval orders in precedence graphs, 6th Workshop on Computational Optimization, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00943683

J. H. Patterson and W. D. Huber, A horizon-varying, zero-one approach to project scheduling problem, Manag. Sci, vol.20, pp.990-998, 1974.

J. H. Patterson and G. W. Roth, Scheduling a project under multiple resource constraints: a zero-one programming approach, AIIE Trans, vol.8, pp.449-455, 1976.

A. A. Pritsker, L. J. Watters, and P. M. Wolfe, Multi-project scheduling with limited resources: a zero-one programming approach, Manag. Sci, vol.16, pp.93-108, 1969.