C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. Savelsbergh, and P. H. Vance, Branch-and-price: Column generation for solving huge integer programs, Operations research, vol.46, pp.316-329, 1998.

J. Blazewicz, J. K. Lenstra, and A. H. Kan, Scheduling subject to resource constraints: classification and complexity, Discrete Applied Mathematics, vol.5, issue.1, pp.90012-90016, 1983.

, Workforce scheduling and routing problems : literature survey and computational study, pp.1-29, 2014.

J. A. Castillo-salazar, D. Landa-silva, and R. Qu, A greedy heuristic for workforce scheduling and routing with time-dependent activities constraints, International Conference on Operations Research and Enterprise Systems, 2015.

E. Choi and D. W. Tcha, A column generation approach to the heterogeneous fleet vehicle routing problem, Computers & Operations Research, vol.34, pp.2080-2095, 2007.

J. F. Cordeau, G. Laporte, F. Pasin, and S. Ropke, Scheduling technicians and tasks in a telecommunications company, Journal of Scheduling, vol.13, pp.393-409, 2010.

M. Desrochers, J. K. Lenstra, and M. W. Savelsbergh, A classification scheme for vehicle routing and scheduling problems, European Journal of Operational Research, vol.46, p.90007, 1990.

J. Desrosiers, Y. Dumas, M. Solomon, and F. Soumis, Time Constrained Routing and Scheduling, Handbooks in Operations Research and Management Science, vol.8, pp.80106-80115, 1995.

A. Dohn, M. S. Rasmussen, and J. Larsen, The vehicle routing problem with time windows and temporal dependencies, Networks, vol.58, pp.273-289, 2011.

M. Dror, Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW, vol.42, pp.977-978, 1994.

D. Feillet, A tutorial on column generation and branch-and-price for vehicle routing problems, A Quarterly Journal of Operations Research, vol.4, issue.4, pp.407-424, 2010.
URL : https://hal.archives-ouvertes.fr/emse-00505959

D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen, An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems, Networks, vol.44, pp.216-229, 2004.

R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Rinnooy-kan, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annals of Discrete Mathematics, vol.5, pp.287-326, 1979.

C. A. Hurkens, Incorporating the strength of MIP modeling in schedule construction, RAIRO -Operations Research, vol.43, 2009.

S. Irnich and G. Desaulniers, Shortest path problems with resource constraints, Column generation, pp.33-65, 2005.

P. Laborie and J. Rogerie, Reasoning with Conditional Time-Intervals, Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, pp.555-560, 2008.

P. Laborie, J. Rogerie, P. Shaw, and P. Vilim, Reasoning with Conditional Time-Intervals. Part II: An Algebraical Model for Resources. FLAIRS Conference, pp.201-206, 2009.

B. J. Lageweg, J. K. Lenstra, E. L. Lawler, and A. H. Rinnooy-kan, Computer-Aided complexity classification of combinational problems, Commun. ACM, vol.25, pp.817-822, 1982.

E. L. Lawler, J. K. Lenstra, A. H. Rinnooy-kan, and D. B. Shmoys, Sequencing and scheduling: Algorithms and complexity, pp.80189-80195, 1993.

J. Lenstra, Personnel scheduling: A literature review, 2013.

S. Pokutta and G. Stauffer, France Telecom workforce scheduling problem: A challenge, RAIRO -Operations Research, vol.43, pp.375-386, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00442261

M. S. Rasmussen, The Home Care Crew Scheduling Problem: PreferenceBased Visit Clustering and Temporal Dependencies, 2010.

M. Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations research, vol.35, pp.254-265, 1987.

M. Solomon and J. Desrosiers, Survey Paper -Time Window Constrained Routing and Scheduling Problems, 1988.

J. N. Tsitsiklis, Special cases of traveling salesman and repairman problems with time windows, Networks, vol.22, pp.263-282, 1992.