K. Hesham, J. E. Alfares, and . Bailey, Integrated project task and manpower scheduling, IIE Transactions, vol.29, pp.711-717, 1997.

A. and R. Aggoune, Ordonnancement d'ateliers sous contraintes de disponibilité des machines, 2002.

A. and R. Aggoune, Minimizing the makespan for the flow shop scheduling problem with availability constraints, European Journal of Operational Research, vol.153, issue.3, pp.534-543, 2004.
DOI : 10.1016/S0377-2217(03)00261-3

URL : https://hal.archives-ouvertes.fr/inria-00099940

A. and R. Aggoune, Une procédure par séparation etévaluationet´etévaluation pour l'ordonnancement d'un job-shop sous contraintes de disponibilité, Proceedings of 5e Conférence Francophone de MOdélisation et SIMulation (MOSIM'04), 2004.

A. , C. Artigues, M. Gendreau, L. Rousseau, and A. Vergnaud, Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound, Computers & Operations Research, vol.36, pp.2330-2340, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00105246

. J. Ben62 and . Benders, Partitioning procedures for solving mixed-variables programming problems, Numerische Mathematik, vol.4, issue.4, pp.238-252, 1962.

J. Blazewicz, G. Finke, R. Haupt, and G. Schmidt, New trends in machine scheduling, European Journal of Operational Research, vol.37, issue.3, pp.303-317, 1988.
DOI : 10.1016/0377-2217(88)90192-0

J. Carlier and . Ordonnancementàordonnancement, Ordonnancementà contraintes disjonctives Thèse de 3` eme cycle, p.82, 1975.

J. Carlier, The one-machine sequencing problem, European Journal of Operational Research, vol.11, issue.1, pp.42-47, 1982.
DOI : 10.1016/S0377-2217(82)80007-6

C. Z. Chen, Simultaneous job scheduling and resource allocation on parallel machines An algorithm for solving the job-shop problem CP90. Jacques Carlier andÉricand´andÉric Pinson. A practical use of jackson's preemptive schedule for solving the job-shop problem Adjustement of heads and tails for the job-shop problem, CP89. Jacques Carlier andÉricand´andÉric Pinson CP94. Jacques Carlier andÉricand´andÉric Pinson, pp.135-153164, 1989.

C. , J. Carlier, L. Péridy, E. Pinson, and D. Rivreau, Handbook of scheduling: algorithms , models and performance analysis, chapter 4-Elimination rules for job-shop scheduling problem: overview and extensions, p.94, 2004.

L. Richard, J. B. Daniels, and . Mazzola, Flow shop scheduling with resource flexibility, Operations Research, vol.42, pp.504-522, 1994.

A. T. Ernst, H. Jiang, M. Krishnamoorthy, and D. Sier, Staff scheduling and rostering: A review of applications, methods and models, European Journal of Operational Research, vol.153, issue.1, pp.3-27, 2004.
DOI : 10.1016/S0377-2217(03)00095-X

A. Gharbi and M. Haouari, Optimal parallel machines scheduling with availability constraints, Discrete Applied Mathematics, vol.148, issue.1, pp.63-87, 2005.
DOI : 10.1016/j.dam.2004.12.003

R. Michael, D. S. Garey, and . Johnson, Computers and intractability: a guide to the theory of NP-Completeness, 1979.

G. Olivier-guyon, P. Lemaire, E. Pinson, and D. Rivreau, Cut generation for an integrated employee timetabling and production scheduling problem, European Journal of Operational Research, vol.201, issue.2, pp.557-567, 2010.
DOI : 10.1016/j.ejor.2009.03.013

N. John, G. Hooker, and . Ottosson, Logic based benders decomposition, Mathematical Programming , series A, pp.33-60, 2003.

J. N. Hooker, A Hybrid Method for the Planning and Scheduling, Constraints, vol.20, issue.4, pp.385-401, 2005.
DOI : 10.1007/s10601-005-2812-2

J. N. Hooker, Planning and Scheduling by Logic-Based Benders Decomposition, Operations Research, vol.55, issue.3, pp.588-602, 2007.
DOI : 10.1287/opre.1060.0371

L. Joseph and Y. Leung, Machine scheduling with an availability constraint Handbook of scheduling: algorithms, models and performance analysis Parallel machine scheduling with machine availability and eligibility constraints, Journal of Global Optimization European Journal of Operational Research, vol.9, issue.184, pp.395-416458, 1996.

J. Philippemauguì-ere, J. Billaut, and . Bouquard, New single machine and job-shop scheduling problems with availability constraints, Journal of scheduling, vol.8, pp.211-231, 2005.

Y. Ma, C. Chu, and C. Zuo, A survey of scheduling with deterministic machine availability constraints, Computers & Industrial Engineering, vol.58, issue.2, pp.199-211, 2010.
DOI : 10.1016/j.cie.2009.04.014

P. Martin and D. B. Shmoys, A new approach to computing optimal schedules for the job-shop scheduling problem, Proceedings of the 5th International IPCO conference, pp.389-403, 1996.
DOI : 10.1007/3-540-61310-2_29

M. Pinedo, Scheduling: theory, algorithms and systems, p.99, 2004.

D. Rivreau, Probì emes d'ordonnancement disjonctifs: r` egles d'´ elimination et bornes inférieures, p.76, 1999.

H. G. Alexander and . Kan, Machine scheduling problems: classification, complexity and computation, p.64, 1976.

B. Roy and B. Sussman, Lesprobì emes d'ordonnancement avec contraintes disjonctives, 1964.

W. P. Martin and . Savelsbergh, Preprocessing and probing techniques for mixed integer programming problems, INFORMS Journal on Computing, vol.6, issue.4, pp.445-454, 1994.

G. Schmidt, Scheduling with limited machine availability, Gestion des horaires et affectation du personnel. Presses Internationales Polytechnique, 2005. SS98. ´ Eric Sanlaville and Günter Schmidt, pp.1-15795, 1998.
DOI : 10.1016/S0377-2217(98)00367-1

G. Wang, H. Sun, and C. Chu, Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion Times, Annals of Operations Research, vol.121, issue.1-4, pp.183-192, 2005.
DOI : 10.1007/s10479-004-5032-z

Z. and N. Zribi, Ordonnancement dans un job-shop flexible sous contraintes de disponibilit?? des machines, Journal Europ??en des Syst??mes Automatis??s, vol.41, issue.6, 2005.
DOI : 10.3166/jesa.41.651-671