R. Alvarez-valdés and J. Tamarit, The project scheduling prolyhedron: Dimension, facets and lifting theorems, European Journal of Operational Research, vol.67, pp.204-220, 1993.

C. Artigues, P. Michelon, and S. Reusser, Insertion for static and dynamic RCPSP, European Journal of Operational Research, vol.149, pp.249-67, 2003.

S. Dauzère-pérès and J. B. Lasserre, A new mixed-integer formulation of the flow-shop sequencing problem, 2nd Workshop on models and algorithms for planning and scheduling problems, 1995.

M. Gondran, E. Bourreau, and P. Lacomme, Efficient Constraint Programming Approaches for routing problem: a case study for the VRP, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02181527

R. L. Kadri and F. F. Boctor, An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: The single mode case, European Journal of Operational Research, vol.265, issue.2, pp.454-462, 2018.

P. Lacomme, A. Moukrim, A. Quilliot, and M. Vinot, Integration of Routing into Resource Constrained Project Scheduling Problem, EURO Journal on Computational Optimization, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01948603

A. Pritsker and L. Watters, A Zero-One Programming Approach to Scheduling with Limited Resources, 1968.

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