H. Allaoui and A. Artiba, Scheduling two-stage hybrid flow shop with availability constraints, Computers & Operations Research, vol.33, issue.5, pp.1399-1419, 2006.
DOI : 10.1016/j.cor.2004.09.034

A. [. Allaoui, S. E. Artiba, F. Elmaghraby, and . Riane, Scheduling of a two-machine flow shop with availability constaints on the first machine, International Journal of Production Economics, vol.99, pp.1-2, 2006.

H. Allaoui, H. Artiba, and F. Riane, Scheduling of two-machine flow-shops with availability constraints, Proceedings of 18th ORBEL conference, 2003.

J. [. Adiri, E. Bruno, A. H. Frostig, and . Kan, Single machine flow-time scheduling with a single breakdown, Acta Informatica, vol.37, issue.7, pp.679-696, 1989.
DOI : 10.1007/BF00288977

D. Applegate and W. Cook, A Computational Study of the Job-Shop Scheduling Problem, ORSA Journal on Computing, vol.3, issue.2, pp.149-156, 1991.
DOI : 10.1287/ijoc.3.2.149

J. [. Akers and . Friedman, A Non-Numerical Approach to Production Scheduling Problems, Journal of the Operations Research Society of America, vol.3, issue.4, pp.429-442, 1955.
DOI : 10.1287/opre.3.4.429

]. R. Agg02 and . Aggoune, Ordonnancement d'ateliers sous contraintes de disponibilités des machines, Thèse de PhD, 2002.

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

J. M. Van-den-akker, C. A. Hurkens, and M. W. Savelbergh, Time-Indexed Formulations for Machine Scheduling Problems: Column Generation, INFORMS Journal on Computing, vol.12, issue.2, pp.111-124, 2000.
DOI : 10.1287/ijoc.12.2.111.11896

R. Aggoune and M. C. Portmann, Flow shop scheduling problem with limited machine availability: A heuristic approach, International Journal of Production Economics, vol.99, issue.1-2, pp.4-15, 2006.
DOI : 10.1016/j.ijpe.2004.12.002
URL : https://hal.archives-ouvertes.fr/inria-00099826

]. K. Bak74 and . Baker, Introduction to Sequencing and Scheduling, 1974.

J. Blazewicz, J. Breit, P. Formanowicz, W. Kubiak, and G. Schmidt, Heuristic algorithms for the two-machine flowshop with limited machine availability, Omega, vol.29, issue.6, pp.599-608, 2001.
DOI : 10.1016/S0305-0483(01)00048-2

J. Blazewicz, M. Drozdowski, P. Formanowicz, W. Kubiak, and G. Schmidt, Scheduling preemptable tasks on parallel processors with limited availability, Parallel Computing, vol.26, issue.9, pp.1195-1211, 2000.
DOI : 10.1016/S0167-8191(00)00035-1

P. [. Blazewicz, M. Dell-'olmo, P. Drozdowski, and . Maczka, Scheduling multiprocessor tasks on parallel processors with limited availability, European Journal of Operational Research, vol.149, issue.2, pp.377-389, 2003.
DOI : 10.1016/S0377-2217(02)00760-9

]. R. Bel57 and . Bellman, Dynamic Programming, 1957.

F. Benbouzid, Une Contribution l'´ etude de la performance et de la robustesse des ordonnancements conjoints Production/Maintenance -Cas Flow-Shop, Thèse de PhD, 2005.

K. [. Blazewicz, E. Ecker, G. Pesch, J. Schmidt, and . Weglarz, Scheduling Computer and Manufacturing Processes, Journal of the Operational Research Society, vol.48, issue.6, 1996.
DOI : 10.1057/palgrave.jors.2600793

J. Blazewicz, K. H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Handbook on scheduling from Theory to Applications, 2007.

J. Blazewicz, P. Formanowicz, W. Kubiak, M. Przysucha, and G. Schmidt, Parallel Branch and Bound Algorithms for the Two-machine Flow Shop Problem with Limited Machine Availability, Bulletin of the Polish Academy of Sciences, vol.48, issue.1, pp.105-115, 2000.

E. [. Barnhart, G. L. Johnson, M. W. Nemhauser, P. H. Savelsbergh, and . Vance, Branch-and-Price: Column Generation for Solving Huge Integer Programs, Operations Research, vol.46, issue.3, pp.316-329, 1998.
DOI : 10.1287/opre.46.3.316
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.197.7390

T. [. Braun, G. Lai, Y. N. Schmidt, and . Sotskov, Stability of Johnson's schedule with respect to limited machine availability, International Journal of Production Research, vol.50, issue.17, pp.4381-4400, 2002.
DOI : 10.1016/S0305-0483(97)00012-1

G. [. Balas, P. Lancia, A. Serafini, and . Vazacopoulos, Job shop scheduling with deadlines, Journal of Combinatorial Optimization, vol.1, issue.4, pp.329-353, 1998.
DOI : 10.1023/A:1009750409895

J. Breit, Heuristische Ablaufplanungsverfahren fr Flowshops und Openshops mit beschrnkt verfgbaren Prozessoren, 2000.

J. Breit, An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint, Information Processing Letters, vol.90, issue.6, pp.273-278, 2004.
DOI : 10.1016/j.ipl.2004.03.004

J. Breit, A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint, Computers & Operations Research, vol.33, issue.8, pp.2143-2153, 2006.
DOI : 10.1016/j.cor.2005.01.004

]. P. Bru98 and . Brucker, Scheduling Algorithms, 1998.

]. O. Bss01a, G. Braun, Y. Schmidt, and . Sotskov, Stability of Jonson's Schedule with limited Machine availability, Actes de la 3e conférence francophone de MOdélisation et de SIMulation (MOSIM'01) analyse et gestion des systèmes industriels, pp.683-687, 2001.

J. Breit, G. Schmidt, and V. A. Strusevich, Two-machine open shop scheduling with an availability constraint, Operations Research Letters, vol.29, issue.2, pp.65-77, 2001.
DOI : 10.1016/S0167-6377(01)00079-7

J. Breit, G. Schmidt, and V. A. Strusevich, Non-preemptive two-machine open shop scheduling with non-availability constraints, Mathematical Methods of Operations Research (ZOR), vol.57, issue.2, pp.217-234, 2003.
DOI : 10.1007/s001860200267

C. Canon, J. Billaut, and J. Bouquard, The one-machine sequencing problem with availability constraints, 2003.

J. Carlier and P. Chretienne, LesProbì emes dordonnancement, 1988.

A. Colorni, M. Dorigo, and V. Maniezzo, An Investigation of Some Properties of an Ant Algorithm, Parallel Problem Solving from Nature 2, R. Mnner and B. Manderick eds, pp.509-520, 1991.

W. J. Chen, Minimizing total flow time in the single-machine scheduling problem with periodic maintenance, Journal of the Operational Research Society, vol.50, issue.4, pp.410-415, 2006.
DOI : 10.1057/palgrave.jors.2600791

W. J. Chen, Scheduling of jobs and maintenance in a textile company, The International Journal of Advanced Manufacturing Technology, vol.114, issue.7-8, pp.737-742, 2007.
DOI : 10.1007/s00170-005-0253-0

]. T. Cl03a, Z. Cheng, and . Liu, 3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints, Information Processing Letters, vol.88, pp.161-165, 2003.

T. C. Cheng and Z. Liu, Approximability of two-machine no-wait flowshop scheduling with availability constraints, Operations Research Letters, vol.31, issue.4, pp.319-322, 2003.
DOI : 10.1016/S0167-6377(02)00230-4

W. [. Conway, L. W. Maxwell, and . Miller, Theory of Scheduling, 1967.

S. A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

T. C. Cheng and G. Wang, Two-machine flowshop scheduling with consecutive availability constraints, Information Processing Letters, vol.71, issue.2, pp.49-54, 1999.
DOI : 10.1016/S0020-0190(99)00094-0

T. C. Cheng and G. Wang, An improved heuristic for two-machine flowshop scheduling with an availability constraint, Operations Research Letters, vol.26, issue.5, pp.223-229, 2000.
DOI : 10.1016/S0167-6377(00)00033-X

F. T. Chan, T. C. Wong, and L. Y. Chan, Flexible job-shop scheduling problem under resource constraints, International Journal of Production Research, vol.44, issue.11, pp.2071-2089, 2006.
DOI : 10.1007/s00366-003-0260-4

S. Demassey, C. Artigues, . Ph, and . Michelon, Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem, INFORMS Journal on Computing, vol.17, issue.1, pp.52-65, 2003.
DOI : 10.1287/ijoc.1030.0043

G. B. Dantzig, Application of the simplex method to a transportation problem, in Activity analysis of production and allocation, pp.359-373, 1951.

G. B. Dantzig, R. Fulkerson, and S. Johnson, Solution of a large-scale travelingsalesman problem, Operational Research, vol.2, pp.393-410, 1954.

M. L. Espinouse, P. Formanowicz, and B. Penz, Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability, Computers & Industrial Engineering, vol.37, issue.1-2, pp.497-500, 1999.
DOI : 10.1016/S0360-8352(99)00127-8
URL : https://hal.archives-ouvertes.fr/hal-00239343

M. L. Espinouse, P. Formanowicz, and B. Penz, Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability, Journal of the Operational Research Society, vol.52, issue.1, pp.116-121, 1999.
DOI : 10.1057/palgrave.jors.2601025

J. Erscher and C. Merce, Consistency of the Disaggregation Process in Hierarchical Planning, Operations Research, vol.34, issue.3, pp.464-469, 1985.
DOI : 10.1287/opre.34.3.464

B. [. Fisher, J. K. Lageweg, A. H. Lenstra, and . Kan, Surrogate duality relaxation for job shop scheduling, Discrete Applied Mathematics, vol.5, issue.1, 1983.
DOI : 10.1016/0166-218X(83)90016-1
URL : http://doi.org/10.1016/0166-218x(83)90016-1

]. S. Fre82 and . French, Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, 1982.

S. Gawiejnowicz, Scheduling deteriorating jobs subject to job or machine availability constraints, European Journal of Operational Research, vol.180, issue.1, pp.472-478, 2007.
DOI : 10.1016/j.ejor.2006.04.021

J. Gao, M. Gen, and L. Sun, Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm, Journal of Intelligent Manufacturing, vol.167, issue.2, pp.493-507, 2006.
DOI : 10.1007/s10845-005-0021-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

M. R. Garey and M. R. Johnson, Computers and intractability: A guide to the theory of NP-completeness, 1979.

G. H. Graves and C. Y. Lee, Scheduling maintenance and semiresumable jobs on a single machine, Naval Research Logistics, vol.6, issue.7, pp.845-863, 1999.
DOI : 10.1002/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-#

E. [. Graham, J. K. Lawler, A. H. Lenstra, and . Kan, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annals Discrete Math, vol.5, pp.287-326, 1979.
DOI : 10.1016/S0167-5060(08)70356-X

F. Glover, HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS, Decision Sciences, vol.15, issue.1, pp.156-166, 1977.
DOI : 10.1093/comjnl/16.2.135

F. Glover, Future paths for integer programming and links to artificial intelligence, Computers & Operations Research, vol.13, issue.5, pp.533-549, 1986.
DOI : 10.1016/0305-0548(86)90048-1

M. Gondran and M. Minoux, Graphs and Algorithms, 1984.
URL : https://hal.archives-ouvertes.fr/hal-01304880

D. E. Goldberg, Genetic Algorithms in Search: Optimisation and Machine Learning, 1989.

M. Gen, T. Tsujimura, and E. Kubota, Solving job-shop problem using genetic algorithm, proceeding of the 16th International Conference on computers and Industrial Engineering, pp.576-579, 1994.

Y. Harrath, ContributionàContributionà l'ordonnancement conjoint de la production et de la maintenance : application au cas d'un Job Shop, Thèse de PhD, 2003.
URL : https://hal.archives-ouvertes.fr/tel-00260243

M. Haouari and A. Gharbi, An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines, Operations Research Letters, vol.31, issue.1, pp.31-4952, 2003.
DOI : 10.1016/S0167-6377(02)00177-3

J. Holland, Adaptive in Natural and Artificial Systems, 1975.

J. R. Jackson, Scheduling a Production Line to Minimise Maximum Tardiness, Research Report, vol.43, 1955.

J. Jungwattanakit, M. Reodecha, P. Chaowalitwongse, and F. Werner, A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria, Computers & Operations Research, vol.36, issue.2, 2008.
DOI : 10.1016/j.cor.2007.10.004

J. Kaabi, Ordonnancement multicritère des job-shops flexibles : formulation, bornes inférieures et approché evolutionniste coopérative, Thèse de PhD, 2004.

N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, vol.244, issue.S, pp.373-395, 1984.
DOI : 10.1007/BF02579150

]. R. Kar72 and . Karp, Reducibility Among Combinatorial Problems, Complexity of Computer Computations, pp.85-104, 1972.

J. [. Kubiak, P. Blazewicz, J. Formanowicz, G. Breit, and . Schmidt, Two-machine flow shops with limited machine availability, European Journal of Operational Research, vol.136, issue.3, pp.528-540, 2002.
DOI : 10.1016/S0377-2217(01)00083-2

]. I. Kc08a, C. Kacem, and . Chu, Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint, International Journal of Production Economics, vol.112, issue.1, pp.138-150, 2008.

I. Kacem and C. Chu, Minimizing the weighted flow time on a single machine with the resumable availability constraint: worst case of the WSPT heuristic, International Journal of Computer Integrated Manufacturing, vol.50, issue.4, pp.388-395, 2008.
DOI : 10.1016/0377-2217(93)E0142-K

C. [. Kacem, A. Chu, and . Souissi, Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times, Computers & Operations Research, vol.35, issue.3, pp.827-844, 2008.
DOI : 10.1016/j.cor.2006.04.010

C. [. Kirkpatrick, M. P. Gellatt, and . Vecchi, Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671

L. G. Khachiyan, Polynomial algorithms in linear programming, USSR Computational Mathematics and Mathematical Physics, vol.20, issue.1, pp.191-194, 1979.
DOI : 10.1016/0041-5553(80)90061-0

C. [. Kraemer and . Lee, COMMON DUE-WINDOW SCHEDULING, Production and Operations Management, vol.25, issue.4, pp.262-275, 1993.
DOI : 10.1111/j.1937-5956.1993.tb00102.x

M. Kaspi and B. Montreuil, On the scheduling of identical parallel processes with arbitrary initial processor available time, 1988.

M. A. Kubzin, C. N. Potts, and V. A. Strusevich, Approximation results for flow shop scheduling problems with machine availability constraints, Computers & Operations Research, vol.36, issue.2, pp.379-390, 2009.
DOI : 10.1016/j.cor.2007.10.013

M. A. Kubzin and V. A. Strusevich, Two-machine flow shop no-wait scheduling with machine maintenance, 4OR, vol.3, issue.4, pp.303-313, 2005.
DOI : 10.1007/s10288-005-0070-1

M. A. Kubzin and V. A. Strusevich, Planning Machine Maintenance in Two-Machine Shop Scheduling, Operations Research, vol.54, issue.4, pp.789-800, 2006.
DOI : 10.1287/opre.1060.0301

V. [. Kubzin, J. Strusevich, G. Breit, and . Schmidt, Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints, Naval Research Logistics, vol.42, issue.1, pp.16-23, 2005.
DOI : 10.1002/nav.20122

]. T. Lbb02a, J. C. Lorigeon, J. L. Billaut, and . Bouquard, Availability Constraint for a Single Machine Problem with Heads and Tails, Project Management and Scheduling, 2002.

T. Lorigeon, J. C. Billaut, and J. L. Bouquard, A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint, Journal of the Operational Research Society, vol.53, issue.11, pp.1239-1246, 2002.
DOI : 10.1057/palgrave.jors.2601421

W. Li and J. Cao, Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities, Operations Research Letters, vol.18, issue.2, pp.81-91, 1995.
DOI : 10.1016/0167-6377(95)00033-2

C. Y. Lee, Parallel machines scheduling with nonsimultaneous machine available time, Discrete Applied Mathematics, vol.30, issue.1, pp.53-61, 1991.
DOI : 10.1016/0166-218X(91)90013-M

C. Y. Lee, Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint, Operations Research Letters, vol.20, issue.3, pp.129-139, 1997.
DOI : 10.1016/S0167-6377(96)00041-7

C. Y. Lee, Two-machine flowshop scheduling with availability constraints, European Journal of Operational Research, vol.114, issue.2, pp.420-429, 1999.
DOI : 10.1016/S0377-2217(97)00452-9

G. Levitin, Multistate series-parallel system expansion-scheduling subject to availability constraints, IEEE Transactions on Reliability, vol.49, issue.1, pp.71-79, 2000.
DOI : 10.1109/24.855538

]. S. Lim91 and . Liman, Scheduling with Capacities and Due-Dates, 1991.

C. Y. Lee and S. D. Liman, Single machine flow-time scheduling with scheduled maintenance, Acta Informatica, vol.13, issue.4, pp.375-382, 1992.
DOI : 10.1007/BF01178778

S. [. Lee and . Liman, Capacitated two-parallel machines scheduling to minimize sum of job completion times, Discrete Applied Mathematics, vol.41, issue.3, pp.211-222, 1993.
DOI : 10.1016/0166-218X(90)90055-H

L. Lu and M. E. Posner, An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity, Mathematics of Operations Research, vol.18, issue.1, pp.12-38, 1993.
DOI : 10.1287/moor.18.1.12

E. L. Lawler and C. U. Martel, Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs, Operations Research, vol.37, issue.2, pp.314-318, 1989.
DOI : 10.1287/opre.37.2.314

P. Lopez and F. Roubellat, Ordonnancement de la Production, 2001.

Z. Liu and E. Sanlaville, Preemptive scheduling with variable profile, precedence constraints and due dates, Discrete Applied Mathematics, vol.58, issue.3, pp.253-280, 1995.
DOI : 10.1016/0166-218X(93)E0151-N
URL : https://hal.archives-ouvertes.fr/inria-00074939

E. [. Liu and . Sanlaville, Stochastic Scheduling with Variable Profile and Precedence Constraints, SIAM Journal on Computing, vol.26, issue.1, pp.173-187, 1997.
DOI : 10.1137/S0097539791218949
URL : https://hal.archives-ouvertes.fr/inria-00075037

T. [. Lei and . Wong, The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints, Management Science, vol.37, issue.12, pp.1629-1639, 1991.
DOI : 10.1287/mnsc.37.12.1629

V. J. Leon and S. D. Wu, On scheduling with ready-times, due-dates and vacations, Naval Research Logistics, vol.18, issue.1, pp.53-65, 1992.
DOI : 10.1002/1520-6750(199202)39:1<53::AID-NAV3220390105>3.0.CO;2-C

G. H. Lin, E. Y. Yao, and Y. He, Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times, Operations Research Letters, vol.22, issue.2-3, pp.75-81, 1998.
DOI : 10.1016/S0167-6377(97)00053-9

]. P. Mbb03b, J. L. Mauguì-ere, J. C. Bouquard, and . Billaut, A branch and bound algorithm for a job shop scheduling problem with availability constraints, Proceedings of the Sixth Workshop on Models and Algorithms for Planning and Scheduling Problems, pp.147-148, 2003.

. Ph, J. C. Mauguì-ere, J. L. Billaut, and . Bouquard, New single machine and job-shop scheduling problems with availability constraints, Journal of Scheduling, vol.8, issue.3, pp.211-231, 2005.

G. B. Mac-maron and M. Florian, On Scheduling with Ready Time and Due Dates to Minimize Maximum Lateness, Operations Research, vol.23, issue.3, pp.475-482, 1975.

G. Mosheiov, Minimizing the sum of job completion times on capacitated parallel machines, Mathematical and Computer Modelling, vol.20, issue.6, pp.91-99, 1994.
DOI : 10.1016/0895-7177(94)90024-8

C. [. Mellouli, C. Sadfi, I. Chu, and . Kacem, Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times, European Journal of Operational Research, vol.197, issue.3, pp.1150-1165, 2009.
DOI : 10.1016/j.ejor.2008.03.043

M. [. Ng and . Kovalyov, An FPTAS for scheduling a two-machine flowshop with one unavailability interval, Naval Research Logistics, vol.121, issue.3, pp.307-315, 2003.
DOI : 10.1002/nav.10107

M. Pinedo, Scheduling : Theory, Algorithms, and Systems, 1995.

M. C. Portmann, Méthodes de décomposition spatiales et temporelles en ordonnancement . RAIRO-APII, pp.439-451, 1988.

L. [. Pritsker, P. M. Watters, and . Wolfe, Multi-Project Scheduling with Limited Resources: A Zero-One Programming Approach, Management Science, vol.16, 1969.

T. Qi, T. Chen, and F. Tu, Scheduling the maintenance on a single machine, Journal of the Operational Research Society, vol.50, issue.10, pp.1071-1078, 1999.
DOI : 10.1057/palgrave.jors.2600791

]. C. Ree95 and . Reeves, A genetic algorithm for flowshop sequencing, Computers and Research, vol.22, pp.5-14, 1995.

. [. Kan, Machine Scheduling Problems: Classification, Complexity and Computations. Martinus Nijhoff, The Haque, 1976.
DOI : 10.1007/978-1-4613-4383-7

B. Roy and B. Susmann, LesProbì emes dordonnancement avec Contraintes Disjonctives . Note DS n 9 bis, 1964.

C. Sadfi, Probì emes d'ordonnancement avec minimisation des encours, Thèse de PhD, 2002.

]. E. San95 and . Sanlaville, Nearly on line scheduling of preemptive independent tasks, Discrete Applied Mathematics, vol.57, pp.229-241, 1995.

G. Schmidt, Scheduling on semi-identical processors, Zeitschrift f??r Operations Research, vol.5, issue.5, pp.153-162, 1984.
DOI : 10.1007/BF01920917

G. Schmidt, Scheduling Independent Tasks with Deadlines on Semi-identical Processors, Journal of the Operational Research Society, vol.39, issue.3, pp.271-277, 1988.
DOI : 10.1057/jors.1988.44

G. J. Sheen and L. W. Liao, Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints, Computers & Operations Research, vol.34, issue.8, pp.2266-2278, 2007.
DOI : 10.1016/j.cor.2005.09.002

C. Sadfi, B. Penz, C. Rapine, J. Blazewicz, and P. Formanowicz, An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints, European Journal of Operational Research, vol.161, issue.1, pp.3-10, 2005.
DOI : 10.1016/j.ejor.2003.08.026
URL : https://hal.archives-ouvertes.fr/hal-00239327

G. [. Sanlaville and . Schmidt, Machine scheduling with availability constraints, Acta Informatica, vol.35, issue.9, pp.795-811, 1998.
DOI : 10.1007/s002360050143

]. E. Tal09 and . Talbi, Metaheuristics From Design to Implementation, 2009.

M. T. Taghavi-fard and H. R. Saidy, Flexible Job Shop Scheduling Under Availability Constraints, Journal of Industrial Engineering International, vol.5, issue.8, pp.52-60, 2009.

L. [. Taillard, M. Gambardella, J. Y. Gendreau, and . Potvin, Adaptive memory programming: A unified view of metaheuristics, European Journal of Operational Research, vol.135, issue.1, pp.1-16, 2001.
DOI : 10.1016/S0377-2217(00)00268-X

]. V. Tgs94a, V. S. Tanaev, Y. M. Gordon, and . Shafransky, Scheduling theory. Single-stage systems, 1994.

J. D. Ullman, NP-complete scheduling problems, Journal of Computer and System Sciences, vol.10, issue.3, pp.384-393, 1975.
DOI : 10.1016/S0022-0000(75)80008-0

G. Vairaktarakis and S. Sahni, Dual criteria preemptive open-shop problems with minimum makespan, Naval Research Logistics, vol.4, issue.1, pp.103-121, 1995.
DOI : 10.1002/1520-6750(199502)42:1<103::AID-NAV3220420109>3.0.CO;2-R

G. Wang and T. C. Cheng, Heuristics for two-machine no-wait flowshop scheduling with an availability constraint, Information Processing Letters, vol.80, issue.6, pp.305-309, 2001.
DOI : 10.1016/S0020-0190(01)00181-8

X. Wang and T. C. Cheng, Machine scheduling with an availability constraint and job delivery coordination, Naval Research Logistics, vol.43, issue.1, pp.11-20, 2006.
DOI : 10.1002/nav.20175

X. Wang and T. C. Cheng, Heuristics for two-machine flowshop scheduling with setup times and an availability constraint, Computers & Operations Research, vol.34, issue.1, pp.152-162, 2007.
DOI : 10.1016/j.cor.2005.05.003

]. X. Wc07b, T. C. Wang, and . Cheng, An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint, Computers and Operations Research, vol.34, issue.10, pp.2894-2901, 2007.

C. C. Wu and W. C. Lee, Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine, Information Processing Letters, vol.87, issue.2, pp.89-93, 2003.
DOI : 10.1016/S0020-0190(03)00262-X