F. Afrati, E. Bampis, C. Chekuri, D. Krager, C. Kenyon et al., Approximation schemes for minimizing average weighted completion time with release dates, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), pp.32-43, 1999.
DOI : 10.1109/SFFCS.1999.814574

J. H. Ahmadi, R. H. Ahmadi, S. Dasu, and C. S. Tang, Batching and Scheduling Jobs on Batch and Discrete Processors, Operations Research, vol.40, issue.4, pp.750-763, 1992.
DOI : 10.1287/opre.40.4.750

J. H. Ahmadi, R. H. Ahmadi, H. Matsuo, and D. Tirupati, Component Fixture Positioning/Sequencing for Printed Circuit Board Assembly with Concurrent Operations, Operations Research, vol.43, issue.3, pp.444-457, 1995.
DOI : 10.1287/opre.43.3.444

D. Ahr, J. Bekesi, and G. Galambos, An exact algorithm for scheduling identical coupled tasks, Mathematical Methods of Operations Research (ZOR), vol.59, issue.2, pp.193-203, 2004.
DOI : 10.1007/s001860300328

S. Albers and P. Brucker, The complexity of one-machine batching problems, Discrete Applied Mathematics, vol.47, issue.2, pp.87-107, 1993.
DOI : 10.1016/0166-218X(93)90085-3

B. Alidaee and N. K. Womer, Scheduling with time dependent processing times: Review and extensions, Journal of the Operational Research Society, vol.50, issue.7, pp.711-720, 1999.
DOI : 10.1057/palgrave.jors.2600740

A. Allahverdi, J. N. Gupta, and T. Aldowaisan, A review of scheduling research involving setup considerations, Omega, vol.27, issue.2, pp.219-239, 1999.
DOI : 10.1016/S0305-0483(98)00042-5

A. Allahverdi, C. T. Ng, T. C. Cheng, and M. Y. Kovalyov, A survey of scheduling problems with setup times or costs, European Journal of Operational Research, vol.187, issue.3, pp.985-1032, 2008.
DOI : 10.1016/j.ejor.2006.06.060

A. Bachman and A. Janiak, Minimizing maximum lateness under linear deterioration, European Journal of Operational Research, vol.126, issue.3, 2000.
DOI : 10.1016/S0377-2217(99)00310-0

K. R. Baker, Introduction to sequencing and scheduling, 1974.

K. R. Baker, Scheduling groups of jobs in the two-machine flow shop, Mathematical and Computer Modelling, vol.13, issue.3, pp.29-36, 1990.
DOI : 10.1016/0895-7177(90)90368-W

E. Balas, J. L. Lenstra, and A. Vazacopoulos, The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling, Management Science, vol.41, issue.1, pp.94-109, 1995.
DOI : 10.1287/mnsc.41.1.94

P. Baptiste, Batching identical jobs, Mathematical Methods of Operations Research (ZOR), vol.52, issue.3, pp.413-420, 2000.
DOI : 10.1007/s001860000088

M. Bartusch, R. H. Mohring, and F. J. Rademacher, Scheduling project networks with resource constraints and time windows, Annals of Operations Research, vol.24, issue.1, pp.201-240, 1988.
DOI : 10.1007/BF02283745

A. Bellanger and A. Oulamara, Exact method for hybrid flowshop with batching machines and tasks compatibilities, Funda, editor, 11th International Workshop on Project Management and Scheduling -PMS2008, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00338751

A. Bellanger and A. Oulamara, Scheduling hybrid flowshop with parallel batching machines and compatibilities, Computers & Operations Research, vol.36, issue.6, 2008.
DOI : 10.1016/j.cor.2008.06.011
URL : https://hal.archives-ouvertes.fr/inria-00175217

K. M. De-bontridder, Minimizing Total Weighted Tardiness in a Generalized Job Shop, Journal of Scheduling, vol.106, issue.6, pp.479-496, 2005.
DOI : 10.1007/s10951-005-4779-7

M. Boudhar, Dynamic scheduling on a single batch processing machine with split compatibility graphs, Journal of Mathematical Modelling and Algorithms, vol.2, issue.1, pp.17-35, 2003.
DOI : 10.1023/A:1023669107449

M. Boudhar, Scheduling a batch processing machine with bipartite compatibility graphs, Mathematical Methods of Operations Research, vol.57, issue.3, pp.513-527, 2003.
DOI : 10.1007/s001860300273

M. Boudhar, Scheduling on a Batch Processing Machine with Split Compatibility Graphs, Journal of Mathematical Modelling and Algorithms, vol.33, issue.4, pp.391-407, 2005.
DOI : 10.1007/s10852-005-3083-z

M. Boudhar and G. Finke, Scheduling on a batch machine with job compatibility, Belgian Journal of Operations Research Statistics and Computer Science, vol.40, pp.69-80, 2000.

S. Browne and U. Yechiali, Scheduling Deteriorating Jobs on a Single Processor, Operations Research, vol.38, issue.3, pp.495-498, 1990.
DOI : 10.1287/opre.38.3.495

P. Brucker, A. Gladky, J. A. Hoogeveen, M. Y. Kovalyov, C. N. Potts et al., Scheduling a batching machine, Journal of Scheduling, vol.1, issue.1, pp.31-54, 1998.
DOI : 10.1002/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R

P. Brucker, T. Hilbig, and J. Hurink, A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags, Discrete Applied Mathematics, vol.94, issue.1-3, pp.77-99, 1999.
DOI : 10.1016/S0166-218X(99)00015-3

P. Brucker and S. Knust, Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags, Computing, vol.63, issue.4, pp.299-316, 1999.
DOI : 10.1007/s006070050036

P. Brucker, S. Knust, T. C. Cheng, and N. V. Shakhlevich, Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays, Annals of Operations Research, vol.129, issue.1-4, pp.81-106, 2004.
DOI : 10.1023/B:ANOR.0000030683.64615.c8

P. Brucker, S. Knust, and C. Oguz, Scheduling chains with identical jobs and constant delays on a single machine, Mathematical Methods of Operations Research, vol.16, issue.1, pp.63-75, 2006.
DOI : 10.1007/s00186-005-0014-8

J. Buzacott and J. R. Callahan, The complexity of the soaking pit-rolling mill complex in steel production, INFOR, vol.9, issue.2, 1971.

H. G. Campbell, R. A. Dudek, and M. L. Smith, Machine Sequencing Problem, Management Science, vol.16, issue.10, pp.630-637, 1970.
DOI : 10.1287/mnsc.16.10.B630

J. Carlier and E. Néron, An exact method for solving the multiprocessor flowshop, European Journal of Operational Research, vol.164, pp.592-608, 2005.

A. Caumond, M. Gourgand, P. Lacomme, and N. Tchernev, Méthaheuristiques pour le problème de jobshop avec time lags : j m |l i,SJ(i) |cmax, Cinquième Conférence Francophone de Modélisation et Simulation, pp.939-946, 2004.

B. Chen, C. N. Potts, and V. A. Strusevich, Approximation algorithms for two-machine flow shop scheduling with batch setup times, Mathematical Programming, vol.22, issue.1-2, pp.255-271, 1998.
DOI : 10.1007/BF01585875

Z. Chen, Parallel machine scheduling with time dependent processing times, Discrete Applied Mathematics, vol.70, issue.1, 1996.
DOI : 10.1016/0166-218X(96)00102-3

Z. Chen, Erratum : Parallel machine scheduling with time-dependent processing times, Discrete Applied Mathematics, vol.75, issue.1, 1997.

T. C. Cheng, Z. Chen, M. Y. Kovalyov, and B. M. Lin, Parallel-Machine Batching and Scheduling to Minimize Total Completion Time, IIE Transactions, vol.28, issue.11, pp.953-956, 1996.
DOI : 10.1287/opre.36.5.778

T. C. Cheng and Q. Ding, The complexity of scheduling starting time dependent tasks with release times, Information Processing Letters, vol.65, issue.2, pp.75-79, 1998.
DOI : 10.1016/S0020-0190(97)00195-6

T. C. Cheng, Q. Ding, and B. M. Lin, A concise survey of scheduling with time-dependent processing times, European Journal of Operational Research, vol.152, issue.1, pp.1-13, 2004.
DOI : 10.1016/S0377-2217(02)00909-8

T. C. Cheng, J. J. Yuan, and A. F. Yang, Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times, Computers & Operations Research, vol.32, issue.4, pp.849-859, 2008.
DOI : 10.1016/j.cor.2003.09.001

T. C. Cheng and M. Y. Kovalyov, Single machine batch scheduling with sequential job processing, IIE Transactions, vol.43, issue.5, pp.413-420, 2001.
DOI : 10.1080/07408170108936839

T. C. Cheng, A. Toker, and B. M. Lin, Makespan minimization in the two-machine flowshop batch scheduling problem, Naval Research Logistics, vol.43, issue.2, pp.128-144, 2000.
DOI : 10.1002/(SICI)1520-6750(200003)47:2<128::AID-NAV4>3.0.CO;2-#

T. C. Cheng and G. Wang, Batching and scheduling to minimize the makespan in the two-machine flowshop, IIE Transactions, vol.30, issue.5, pp.447-453, 1998.
DOI : 10.1023/A:1007543206263

H. N. Chiu and J. H. Chang, Cost models for lot streaming in a multistage flow shop, Omega, vol.33, issue.5, pp.435-450, 2005.
DOI : 10.1016/j.omega.2004.05.006

P. Chrétienne, E. G. Coffman, J. K. Lenstra, and Z. Liu, Theory of scheduling and its applications, 1995.

P. Chrétienne and C. Picouleau, Scheduling with communication delays : A survey, Theory and Its Applications, 1995.

C. Chu and J. Proth, Single machine scheduling with chain structured precedence constraint and separation time windows, IEEE Transactions on robotics and automation, issue.6, pp.12-6835, 1996.

H. R. Lourenço, A polynomial algorithm for special case of the one-machine scheduling problem with time-lags, Economics Working Papers Series, 1998.

E. G. Coffman, A. Nozari, and M. Yannakakis, Optimal Scheduling of Products with Two Subassemblies on a Single Machine, Operations Research, vol.37, issue.3, pp.426-436, 1989.
DOI : 10.1287/opre.37.3.426

E. G. Coffman, M. Yannakakis, M. J. Magazine, and C. Santos, Batch sizing and job sequencing on a single machine, Annals of Operations Research, vol.4, issue.6, pp.135-147, 1990.
DOI : 10.1007/BF02248589

F. , D. Croce, and V. , A recovring beam search algorithm for the one-machine dynamic total completion time scheduling problem, Journal of the Operational Research Society, issue.11, pp.531275-1280, 2002.

M. Dell-'amico, Shop Problems With Two Machines and Time Lags, Operations Research, vol.44, issue.5, pp.777-787, 1996.
DOI : 10.1287/opre.44.5.777

M. Demange, D. De-werra, J. Monnot, and V. Paschos, Time slot scheduling of compatible jobs, Journal of Scheduling, vol.17, issue.2, pp.111-127, 2007.
DOI : 10.1007/s10951-006-0003-7

F. Deppner, Ordonnancement d'atelier avec contraintes temporelles entre opérations, 2004.

J. Edmonds, Matching and a polyhedron with 0,1 vertices, Journal of research N.B.S.B, vol.69, pp.125-130, 1965.

G. Finke, M. Espinouse, and H. Jiang, General Flowshop Models: Job Dependent Capacities, Job Overlapping and Deterioration, International Transactions in Operational Research, vol.9, issue.4, pp.399-414, 2002.
DOI : 10.1111/1475-3995.00363

G. Finke and H. Jiang, A variant of the permutation flow shop model with variable processing times, Discrete Applied Mathematics, vol.76, issue.1-3, pp.123-140, 1997.
DOI : 10.1016/S0166-218X(96)00121-7

G. Finke, V. Jost, M. Queyranne, and A. Sebo, Batch processing with interval graph compatibilities between tasks, Discrete Applied Mathematics, vol.156, issue.5, pp.556-568, 2008.
DOI : 10.1016/j.dam.2006.03.039
URL : https://hal.archives-ouvertes.fr/hal-00373014

G. Finke and A. Oulamara, Total Completion Time in a Two-machine Flowshop with Deteriorating Tasks, Journal of Mathematical Modelling and Algorithms, vol.40, issue.4, pp.563-576, 2007.
DOI : 10.1007/s10852-007-9057-6
URL : https://hal.archives-ouvertes.fr/hal-00185477

L. Finta and Z. Liu, Single machine scheduling subject to precedence delays, Discrete Applied Mathematics, vol.70, issue.3, pp.247-266, 1996.
DOI : 10.1016/0166-218X(96)00110-2
URL : https://hal.archives-ouvertes.fr/inria-00074473

J. Fondrevelle, Résolution exacte de problèmes d'ordonnancement de type flowshop de permutation en présence de contraintes d'écarts temporels entre opérations, 2005.

J. Fondrevelle, A. Allahverdi, and A. Oulamara, Two-machine, no-wait flowshop scheduling problem to minimize maximum lateness with separate setup and removal times, International Journal of Agile Manufacturing, vol.8, issue.2, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00100231

J. Fondrevelle, A. Oulamara, and M. Portmann, Permutation flowshop scheduling problems with maximal and minimal time lags, Computers & Operations Research, vol.33, issue.6, 2006.
DOI : 10.1016/j.cor.2004.11.006
URL : https://hal.archives-ouvertes.fr/inria-00100091

J. Fondrevelle, A. Oulamara, M. Portmann, and A. Allahverdi, Permutation flowshops with exact time lags to minimize maximum lateness, International Journal of Production Research, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00525859

L. R. Foulds and J. M. Wilson, Scheduling operations for the harvesting of renewable resources, Journal of Food Engineering, vol.70, issue.3, pp.281-292, 2005.
DOI : 10.1016/j.jfoodeng.2003.12.009

M. R. Garey and D. S. Johnson, Computers and Intractability : A Guide to NP-completeness, 1979.

S. Gawiejnowicz, Brief survey of continuous models of scheduling, Foundations of Computer and Decision Science, vol.21, pp.81-100, 1996.

S. Gawiejnowicz and L. Pankowska, Scheduling jobs with varying processing times, Information Processing Letters, vol.54, issue.3, 1995.
DOI : 10.1016/0020-0190(95)00009-2

A. E. Gerodimos, C. A. Glass, and C. N. Potts, Scheduling the production of two-component jobs on a single machine, European Journal of Operational Research, vol.120, issue.2, pp.250-259, 2000.
DOI : 10.1016/S0377-2217(99)00154-X

A. Gharbi and M. Houari, Minimizing makespan on parallel machines subject to release dates and delivery times, Journal of Scheduling, vol.121, issue.4, pp.329-355, 2002.
DOI : 10.1002/jos.103

P. C. Gilmore and R. E. Gomory, Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem, Operations Research, vol.12, issue.5, 1964.
DOI : 10.1287/opre.12.5.655

C. A. Glass, C. N. Potts, and V. A. Strusevich, Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops, INFORMS Journal on Computing, vol.13, issue.2, pp.120-137, 2001.
DOI : 10.1287/ijoc.13.2.120.10521

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

I. V. Gribkovskaia, C. Lee, V. A. Strusevich, and D. Werra, Three is easy, two is hard: open shop sum-batch scheduling problem refined, Operations Research Letters, vol.34, issue.4, pp.459-464, 2006.
DOI : 10.1016/j.orl.2005.07.006

J. N. Gupta, Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags, Journal of Global Optimization, vol.6, issue.No. 1, pp.239-253, 1996.
DOI : 10.1007/BF00121674

J. N. Gupta and S. K. Gupta, Single facility scheduling with nonlinear processing times, Computers & Industrial Engineering, vol.14, issue.4, pp.387-393, 1988.
DOI : 10.1016/0360-8352(88)90041-1

L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein, Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms, Mathematics of Operations Research, vol.22, issue.3, pp.513-544, 1997.
DOI : 10.1287/moor.22.3.513

L. A. Hall and D. B. Shmoys, Approximation schemes for constrained for minimizing average weighted completion time with release dates, Proceedings of the 30th annual IEEE Symposium on Foundations of Computers Science, pp.134-139, 1989.

N. G. Hall, G. Laporte, E. Selvarajah, and C. Sriskandarajah, Scheduling and lot streaming in flowshops with no-wait in process, Journal of Scheduling, vol.6, issue.4, pp.339-354, 2003.
DOI : 10.1023/A:1024042209719

N. G. Hall and C. N. Potts, Supply chain scheduling: Batching and delivery, Operations Research, vol.51, issue.4, pp.566-584, 2003.
DOI : 10.1287/opre.51.4.566.16106
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.6915

N. G. Hall and C. N. Potts, The Coordination of Scheduling and Batch Deliveries, Annals of Operations Research, vol.32, issue.1, pp.41-64, 2005.
DOI : 10.1007/s10479-005-6234-8

R. Heilmann, A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags, European Journal of Operational Research, vol.144, issue.2, pp.348-365, 2003.
DOI : 10.1016/S0377-2217(02)00136-4

D. S. Hochbaum and D. Landy, Scheduling with batching: minimizing the weighted number of tardy jobs, Operations Research Letters, vol.16, issue.2, pp.79-86, 1994.
DOI : 10.1016/0167-6377(94)90063-9

A. Hodson, A. P. Muhlemann, and D. H. Price, A Microcomputer Based Solution to a Practical Scheduling Problem, Journal of the Operational Research Society, vol.36, issue.10, pp.903-914, 1985.
DOI : 10.1057/jors.1985.160

J. A. Hoogeveen and S. L. Van-der-velde, Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine, Mathematical Programming, vol.3, issue.1-2, pp.273-289, 1998.
DOI : 10.1007/BF01585876

J. Hurink and J. Keuchel, Local search algorithms for a single-machine scheduling problem with positive and negative time-lags, Discrete Applied Mathematics, vol.112, issue.1-3, pp.179-197, 2001.
DOI : 10.1016/S0166-218X(00)00315-2

E. Ignall and L. Shrage, Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems, Operations Research, vol.13, issue.3, pp.400-412, 1965.
DOI : 10.1287/opre.13.3.400

R. Janczewski and M. Kubale, Scheduling unit execution time tasks with symetric timelags, Journal of Applied Computer Systems, vol.9, issue.22, pp.45-51, 2001.

S. M. Johnson, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, vol.1, issue.1, pp.61-68, 1954.
DOI : 10.1002/nav.3800010110

J. Kaabi-harrath, Contribution à l'ordonnancement des activités de maintenance dans les systèmes de production, 2004.

A. A. Kalir and S. C. Sarin, Constructing near optima schedules for the flow-shop lot streaming problem with sublot-attached setups, Journal of Combinatorial Optimization, vol.7, issue.1, pp.23-44, 2003.
DOI : 10.1023/A:1021942422161

K. Khurana and P. C. Bagga, Minimizing the makespan in a 2-machine flowshop with time lags and setup conditions, Zeitschrift f??r Operations Research, vol.11, issue.5, pp.163-174, 1984.
DOI : 10.1007/BF01920918

T. Kis and E. Pesch, A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. RAIRO -Recherche Operationnelle -Operations Research, pp.146-161, 2000.

U. Kleinau, Two-machine shop scheduling problems with batch processing, Mathematical and Computer Modelling, vol.17, issue.6, pp.55-66, 1993.
DOI : 10.1016/0895-7177(93)90196-6
URL : http://doi.org/10.1016/0895-7177(93)90196-6

A. Kononov and S. Gawiejnowicz, NP-hard cases in scheduling deteriorating jobs on dedicated machines, Journal of the Operational Research Society, vol.52, issue.6, 1997.
DOI : 10.1057/palgrave.jors.2601117

W. Kubiak and S. L. Van-de-velde, Scheduling deteriorating jobs to minimize makespan, Naval Research Logistics, vol.45, issue.5, pp.511-523, 1998.
DOI : 10.1002/(SICI)1520-6750(199808)45:5<511::AID-NAV5>3.0.CO;2-6

A. S. Kunnathur and S. K. Gupta, Minimizing the makespan with late start penalities added to processing times in a single facility scheduling problem, European Journal of Operational Research, vol.47, issue.1, 1990.

E. L. Lawler, J. K. Lenstra, A. H. Kan, and D. B. Shmoys, Sequencing and scheduling theory : algorithms and complexity, Handbooks in Operations Research and Management Science, 1993.

C. L. Li and W. Q. Xiao, Lot streaming with supplier-manufacturer coordination, Naval Research Logistics, vol.34, issue.4, pp.522-542, 2004.
DOI : 10.1002/nav.20013

S. Li, G. Li, X. Wang, and Q. Liu, Minimizing makespan on a single batching machine with release times and non-identical job sizes, Operations Research Letters, vol.33, issue.2, pp.33-2157, 2005.
DOI : 10.1016/j.orl.2004.04.009

C. J. Liao and W. J. Chen, Single-machine scheduling with periodic maintenance and nonresumable jobs, Computers & Operations Research, vol.30, issue.9, pp.1335-1347, 2003.
DOI : 10.1016/S0305-0548(02)00074-6

C. K. Lin and K. B. Haley, Scheduling two-phase jobs with arbitrary time lags in a singleserver system, IMA Journal of Mathematics Applied in Business and Industry, vol.5, pp.143-161, 1994.

C. Low, C. Hsu, and K. I. Huang, Benefits of lot splitting in job-shop scheduling, The International Journal of Advanced Manufacturing Technology, vol.17, issue.9-10, pp.773-780, 2004.
DOI : 10.1007/s00170-003-1785-9

P. L. Maggu, M. L. Singhal, N. Mohammad, and S. K. Yadav, On n-job, 2-machine flow-shop scheduling problem with arbitrary time lags and transportation times of jobs, Journal of the Operations Research Society of Japan, vol.25, issue.3, pp.219-227, 1982.

A. Mili, A. Oulamara, and M. Portmann, Ordonnancement conjoint de la production et de la maintenance, Livre articles, pp.207-215, 2007.

L. G. Mitten, Jobs on Two Machines with Arbitrary Time Lags, Management Science, vol.5, issue.3, pp.293-298, 1959.
DOI : 10.1287/mnsc.5.3.293

C. L. Monma and C. N. Potts, On the Complexity of Scheduling with Batch Setup Times, Operations Research, vol.37, issue.5, pp.798-804, 1989.
DOI : 10.1287/opre.37.5.798

J. M. Moore, Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs, Management Science, vol.15, issue.1, pp.102-109, 1968.
DOI : 10.1287/mnsc.15.1.102

G. Mosheiov, V-Shaped Policies for Scheduling Deteriorating Jobs, Operations Research, vol.39, issue.6, pp.979-991, 1991.
DOI : 10.1287/opre.39.6.979

G. Mosheiov, Scheduling jobs under simple linear deterioration, Computers & Operations Research, vol.21, issue.6, 1994.
DOI : 10.1016/0305-0548(94)90080-9

G. Mosheiov, Scheduling jobs with step-deterioration; Minimizing makespan on a single- and multi-machine, Computers & Industrial Engineering, vol.28, issue.4, 1995.
DOI : 10.1016/0360-8352(95)00006-M

G. Mosheiov, Multiple-machine scheduling with linear deterioration, INFOR, vol.36, issue.4, 1998.

G. Mosheiov, Complexity analysis of job-shop scheduling with deteriorating jobs, Discrete Applied Mathematics, vol.117, issue.1-3, pp.195-209, 2002.
DOI : 10.1016/S0166-218X(00)00385-1

G. Mosheiov and D. Oron, A note on flow-shop and job-shop batch scheduling with identical processing-time jobs, European Journal of Operational Research, vol.161, issue.1, pp.285-291, 2005.
DOI : 10.1016/j.ejor.2003.09.010

O. Mousli and Y. Pichot, A branch-and-bound algorithm for the hybrid flowshop, International Journal of Production Economics, vol.64, issue.1-3, pp.113-125, 2000.
DOI : 10.1016/S0925-5273(99)00051-1

A. Munier, M. , and A. S. Schulz, Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems, Project Management and Scheduling Sixth International Integer Programming and Combinatorial Optimization Conference, pp.367-382, 1998.
DOI : 10.1007/3-540-69346-7_28

A. Munier and F. Sourd, Scheduling chains on a single machine with nonnegative time lags, Mathematical Methods of Operations Research, vol.57, pp.111-123, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01185777

D. Naddef and C. Santos, One-pass batching algorithms for the one-machine problem, Discrete Applied Mathematics, vol.21, issue.2, pp.133-146, 1988.
DOI : 10.1016/0166-218X(88)90049-2

M. Nawaz, E. E. Enscore-jr, and I. Ham, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, Omega, vol.11, issue.1, pp.91-95, 1983.
DOI : 10.1016/0305-0483(83)90088-9

C. T. Ng, T. C. Cheng, J. J. Yuan, and Z. H. Liu, On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times, Operations Research Letters, vol.31, issue.4, pp.323-326, 2003.
DOI : 10.1016/S0167-6377(03)00007-5

A. J. Orman and C. N. Potts, On the complexity of coupled-task scheduling, Discrete Applied Mathematics, vol.72, issue.1-2, pp.141-154, 1997.
DOI : 10.1016/S0166-218X(96)00041-8

A. Oulamara, Flowshops avec détérioration de tâches et groupement de tâches, 2001.

A. Oulamara, Makespan minimization in a no-wait flow shop problem with two batching machines, Computers & Operations Research, vol.34, issue.4, 2007.
DOI : 10.1016/j.cor.2005.05.028
URL : https://hal.archives-ouvertes.fr/inria-00595610

A. Oulamara and G. Finke, No-wait flowshop problem with two batch processing machines, Proceedings Second Conference IFAC Control of Production and Logistics (MCPL'2000), pp.663-668, 2000.

A. Oulamara and G. Finke, Flowshop problems with two batch processing machines, International Journal of Mathematical Algorithms, vol.2, pp.169-287, 2001.

A. Oulamara, G. Finke, and A. K. Kuiteing, Flowshop scheduling problem with a batching machine and task compatibilities, Computers & Operations Research, vol.36, issue.2, 2007.
DOI : 10.1016/j.cor.2007.10.006
URL : https://hal.archives-ouvertes.fr/hal-00185479

A. Oulamara, G. Finke, and A. Kamgaing-kuiten, Flowshop scheduling problem with a batching machine and task compatibilities, Computers & Operations Research, vol.36, issue.2, p.0, 2007.
DOI : 10.1016/j.cor.2007.10.006
URL : https://hal.archives-ouvertes.fr/hal-00185479

A. Oulamara, M. Y. Kovalyov, and G. Finke, Scheduling a no-wait flowshop with unbounded batching machines, IIE Transactions on Scheduling and Logistics, issue.8, p.37, 2005.

C. K. Poon and W. Yu, ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING, International Journal of Foundations of Computer Science, vol.15, issue.04, pp.593-607, 2004.
DOI : 10.1142/S0129054104002637

C. N. Potts, V. A. Strusevich, and T. Tautenhahn, Scheduling batches with simultaneous job processing for two-machine shop problems, Journal of Scheduling, vol.3, issue.1, pp.25-51, 2001.
DOI : 10.1002/1099-1425(200101/02)4:1<25::AID-JOS58>3.0.CO;2-7

C. N. Potts and M. Y. Kovalyov, Scheduling with batching: A review, European Journal of Operational Research, vol.120, issue.2, pp.228-249, 2000.
DOI : 10.1016/S0377-2217(99)00153-8

C. N. Potts and L. N. Van-wassenhove, Integrating scheduling with batching and lotsizing : A review of algorithms and complexity, Operations Research Society, vol.42, pp.395-406, 1992.

D. Rayward-smith and . Rebaine, Open shop scheduling with delays, RAIRO - Theoretical Informatics and Applications, vol.26, issue.5, pp.439-448, 1992.
DOI : 10.1051/ita/1992260504391

D. Rayward-smith and . Rebaine, UET flow shop scheduling with delays, RAIRO - Theoretical Informatics and Applications, vol.30, issue.1, pp.30-123, 1996.
DOI : 10.1051/ita/1996300100231

D. Rebaine and V. Strusevich, Two-machine open shop scheduling with special transportation times, Journal of the Operational Research Society, vol.50, issue.7, pp.756-764, 1999.
DOI : 10.1057/palgrave.jors.2600769

J. Reizebos and G. J. Gaalman, Time lag size in multiple operations flow shop scheduling heuristics, European Journal of Operational Research, vol.105, issue.1, pp.72-90, 1998.
DOI : 10.1016/S0377-2217(97)00025-8

J. Reizebos, G. J. Gaalman, and J. N. Gupta, Flow shop scheduling with multiple operations and time lags, Journal of Intelligent Manufacturing, vol.29, issue.2, pp.105-115, 1995.
DOI : 10.1007/BF00123682

H. Roeck, Some new results in flow shop scheduling, Zeitschrift f??r Operations Research, vol.45, issue.1, 1984.
DOI : 10.1007/BF01919082

B. Roy and M. Dibon, L'ordonnancement par la méthode des potentiels ? le programme concord, Automatisme, vol.2, pp.1-11, 1966.

B. Roy and B. Sussman, Les problèmes d'ordonnancement avec contraintes disjonctives. SEMA, Note N. 9bis, 1964.

R. Ruiz, J. C. Garcia-diaz, and C. Maroto, Considering scheduling and preventive maintenance in the flowshop sequencing problem, Computers & Operations Research, vol.34, issue.11, pp.3314-3330, 2007.
DOI : 10.1016/j.cor.2005.12.007

Y. Sekiguchi, Inter-and intra-goup-of-jobs schedule for minimizing makespan in a twomachine gt shop, Control Science and Technology for the Progress of Society Procedings of the Eighth Triennial World Congress of the International Federation of Automatic Control, pp.2021-2026, 1982.

R. D. Shapiro, Scheduling coupled tasks, Naval Research Logistics Quarterly, vol.12, issue.3, pp.489-497, 1981.
DOI : 10.1002/nav.3800270312

G. Sheen and L. Liao, A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags, European Journal of Operational Research, vol.181, issue.1, pp.102-116, 2007.
DOI : 10.1016/j.ejor.2006.06.003

Y. N. Sotskov, T. Tautenhahn, and F. Werner, On the application of insertion techniques for job shop problems with setup times, RAIRO - Operations Research, vol.33, issue.2, pp.209-245, 1999.
DOI : 10.1051/ro:1999110

F. Sourd, Optimal timing of a sequence of tasks with general completion costs, European Journal of Operational Research, vol.165, issue.1, pp.82-96, 2005.
DOI : 10.1016/j.ejor.2004.01.025
URL : https://hal.archives-ouvertes.fr/hal-01185224

C. Sriskandarajah and E. Wagneur, Hierarchical control of the two-processeur flow-shop with state dependent processing times, INFOR, vol.29, pp.193-205, 1991.

W. Szwarc, The flow shop problem with time lags and separated setup times, Zeitschrift f??r Operations Research, vol.29, issue.2, pp.15-22, 1986.
DOI : 10.1007/BF01919496

V. S. Tanaev, Y. N. Sotskov, and V. A. Strusevich, Scheduling Theory. Multi-Stage Systems The Netherlands, 1994.

L. Tang and Y. Zhao, Scheduling a single semi-continuous batching machine, Omega, vol.36, issue.6, pp.36-6992, 2008.
DOI : 10.1016/j.omega.2007.11.003

A. Vignier, J. Billaut, and C. Proust, Les problèmes d'ordonnancement de type flow shop hybride : Etat de l'art. RAIRO -Recherche Operationnelle -Operations Research, pp.117-182, 1999.

E. Wagneur and C. Sriskandarajah, Optimal control of a class of deds : flow-shops with state-dependent processing times. Discrete Event Dynamic Systems : Theory and Applications, pp.397-425, 1993.

E. Wagneur and C. Sriskandarajah, The two-machine permutation flow shop with state-dependent processing times, Naval Research Logistics, vol.29, issue.5, pp.697-717, 1993.
DOI : 10.1002/1520-6750(199308)40:5<697::AID-NAV3220400511>3.0.CO;2-V

S. Webster and K. R. Baker, Scheduling Groups of Jobs on a Single Machine, Operations Research, vol.43, issue.4, pp.692-703, 1995.
DOI : 10.1287/opre.43.4.692

E. D. Wikum, D. C. Llewellyn, and G. L. Nemhauser, One-machine generalized precedence constrained scheduling problems, Operations Research Letters, vol.16, issue.2, pp.87-99, 1994.
DOI : 10.1016/0167-6377(94)90064-7

D. L. Yang and M. S. Chern, A two-machine flowshop sequencing problem with limited waiting time constraints, Computers & Industrial Engineering, vol.28, issue.1, pp.63-70, 1995.
DOI : 10.1016/0360-8352(94)00026-J

W. Yu, The two-machine flowshop problem with delays and the one-machine total tardiness problem, 1996.

W. Yu, H. Hoogeveen, and J. K. Lenstra, Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard, Journal of Scheduling, vol.7, issue.5, pp.333-348, 2004.
DOI : 10.1023/B:JOSH.0000036858.59787.c2

J. J. Yuan, Z. H. Liu, C. T. Ng, and T. C. Cheng, The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan, Theoretical Computer Science, vol.320, issue.2-3, pp.320-2199, 2004.
DOI : 10.1016/j.tcs.2004.01.038

J. J. Yuan, A. F. Yang, and T. C. Cheng, A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times, European Journal of Operational Research, vol.158, issue.2, pp.525-528, 2003.
DOI : 10.1016/S0377-2217(03)00361-8

V. Consulting and . Growth, Le projet concerne la définition et la gestion de chaînes logistiques liées à la production manufacturière dans le cadre de l'entreprise virtuelle, c'est à dire d'un réseau de fournisseurs et de donneurs d'ordre partageant les risques et les profits de la production. Les domaines d'application concernent l'industrie automobile (Ford, Espagne) et la fabrication de motocycles (Aprilia, Italie) En collaboration avec l'université d'Udine (Italie), j'ai réalisé des développements pour la planification et l'ordonnancement de l'assemblage de motos pour le pilote Italien, Aprilia (Italie), DMR Consulting (Espagne), 2001.

?. Porteur-d-'une-soumission-pour-un-projet and P. , Titre 'Techniques d'optimisation dans les industries de pneumatique et de céramique' avec Ruben Ruiz Garcia de Grupo de investigacion operativa -GIO, Espagne pour la partie PICASSO du projet et avec Thomas Stuetzle de FG Intellektik department d'informatique, 2006.

?. Porteur-d-'un-projet and P. , Projet International de Coopération Scientifique) entre le CNRS et La Fondation Biélorusse pour la Recherche Fondamentale, projet soumis en mai 2008, titre 'Optimal planning decisions in logistics and supply chain management' le partenaire est le laboratory of mathematical cybernetics

?. W. Invité-par-le-pr, Kubiak pour un séjour de recherche d'un mois en Août, 2005.

?. M. Invité-par-le-pr, Boudhar trois fois deux semaines en avrilà chaque séjour, je donne un cours sur l'optimisation dans les systèmes de production, 2006.

?. Autres-responsabilités and . Mai, 07 -Mars. 08 : Membre élu du conseil d'administration de l'INPL (environ une réunion par mois

?. Journaux-internationaux, IIE Transactions, International Journal of Production Research (?PR)

A. Oulamara and M. Portmann, Guest Editors of issue on Project Management and Scheduling, European journal of Operational Research, vol.189, issue.3, 2008.

?. A. Oulamara and M. , Portmann : Editeur du proceeding de la conférence : Ninth international workshop on project management and scheduling, 2004.

?. A. Bellanger and A. Oulamara, Scheduling hybrid flowshop with parallel batching machines and compatibilities, Computers & Operations Research, vol.36, issue.6, 1982.
DOI : 10.1016/j.cor.2008.06.011
URL : https://hal.archives-ouvertes.fr/inria-00175217

?. J. Fondrevelle, A. Oulamara, M. Portmann, and A. Allahverdi, Permutation flowshops with exact time lags to minimize maximum lateness, International Journal of Production Research, 2008.
DOI : 10.1080/00207540802320164
URL : https://hal.archives-ouvertes.fr/hal-00525859

?. J. Fondrevelle, A. Oulamara, and M. Portmann, Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times, International Journal of Production Economics, vol.112, issue.1, pp.168-176, 2008.
DOI : 10.1016/j.ijpe.2006.08.018
URL : https://hal.archives-ouvertes.fr/hal-00235174

?. A. Oulamara, G. Finke, and A. Kuiteing, Flowshop scheduling problem with a batching machine and task compatibilities, Computers & Operations Research, vol.36, issue.2, 2007.
DOI : 10.1016/j.cor.2007.10.006
URL : https://hal.archives-ouvertes.fr/hal-00185479

?. G. Finke and A. Oulamara, Total Completion Time in a Two-machine Flowshop with Deteriorating Tasks, Journal of Mathematical Modelling and Algorithms, vol.40, issue.4, pp.563-576, 2007.
DOI : 10.1007/s10852-007-9057-6
URL : https://hal.archives-ouvertes.fr/hal-00185477

?. A. Oulamara, Makespan minimization in a no-wait flow shop problem with two batching machines, Computers & Operations Research, vol.34, issue.4, pp.1033-1050, 2007.
DOI : 10.1016/j.cor.2005.05.028
URL : https://hal.archives-ouvertes.fr/inria-00595610

?. J. Fondrevelle, A. Oulamara, and M. Portmann, Permutation flowshop scheduling problems with maximal and minimal time lags. Computers and Operations Research, pp.1540-1556, 2006.
DOI : 10.1016/j.cor.2004.11.006
URL : https://hal.archives-ouvertes.fr/inria-00100091

?. M. Kovalyov, M. Portmann, and A. Oulamara, Optimal testing and repairing a failed series system, Journal of Combinatorial Optimization, vol.37, issue.3, pp.279-295, 2006.
DOI : 10.1007/s10878-006-9633-0
URL : https://hal.archives-ouvertes.fr/inria-00100230

?. J. Fondrevelle, A. , and A. Oulamara, Two-machine no-wait flowshop scheduling problem to minimize maximum lateness with separate setup and removal times, International Journal of Agile Manufacturing, vol.8, pp.165-174, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00100231

?. A. Soukhal, A. Oulamara, and P. Martineau, Complexity of flow shop scheduling problems with transportation constraints, European Journal of Operational Research, vol.161, issue.1, pp.32-41, 2005.
DOI : 10.1016/j.ejor.2003.03.002

?. A. Oulamara, M. Y. Kovalyov, and G. Finke, Scheduling a no-wait flowshop with unbounded batching machines, IIE Transactions on Scheduling and logistics, vol.37, issue.8, pp.685-696, 2005.

?. A. Oulamara and G. Finke, Flowshop Problems with two batch processing machines, International Journal of Mathematical Algorithms, vol.2, pp.269-287, 2001.

?. A. Bellanger and A. Oulamara, Exact method for hybrid flowshop with batching machines and tasks compatibilities, 11th International Workshop on Project Management and Scheduling - PMS2008, 2008.
DOI : 10.1016/j.cor.2008.06.011
URL : https://hal.archives-ouvertes.fr/inria-00338751

?. A. Mili, A. Oulamara, . M-c, and . Portmann, Ordonnancement conjoint de la production et de la maintenance. Livre articles, pp.207-215, 2007.

?. A. Bellanger and A. Oulamara, Flowshop hybride avec machines à traitement par batches et compatibilité entre les tâches. Livre articles, pp.17-35, 2007.

?. Z. Mouloua and A. Oulamara, A dynamic programming approach for minimizing the transportation costs in a supply chain, The 4th International federation of Automatic Control Conference on Management and Control of Production and Logistics, Romania, pp.753-758, 2007.

?. A. Kamgaing-kuiteing, A. Oulamara, and G. Finke, FLOWSHOP SCHEDULING PROBLEM WITH BATCHING MACHINES AND TASK COMPATIBILITIES, 12th IFAC/IFIP/IFORS/IEEE/IMS Symposium on Information Control Problems in Manufacturing INCOM 06, 2006.
DOI : 10.3182/20060517-3-FR-2903.00025

?. Z. Mouloua and A. Oulamara, Cooperation in supply chain scheduling : minimizing the in- 88

?. J. Fondrevelle, A. Oulamara, and M. Portmann, Minimizing the weighted sum of machine completion times in flowshop with time lags, IESM 2005, International Conference on Industrial Engineering and Systems Management, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00000148

?. J. Fondrevelle, A. Oulamara, and M. Portmann, Scheduling unit time operation permutation flowshop with minimal time lag, PMS 04, Ninth International Workshop on Project Management and Scheduling, pp.178-181, 2004.

?. A. Oulamara, No-wait flowshop problem with two mixed batching machines. Conference of Management and Control of Production and Logistics, pp.3-5, 2004.

?. A. Oulamara and G. Finke, No-wait flowshop problem with two batch processing machines, Proceedings Second Conference IFAC Control of Production and Logistics (MCPL'2000), pp.663-668, 2000.

?. G. Finke, M. Y. Kovalyov, and A. Oulamara, Batch scheduling in a no-wait flowshop, in : ECCO XVIII, p.17, 2005.

?. A. Oulamara, Makespan minimization in no-wait flowshop with two batching machines, in : ECCO XVIII, p.49, 2005.

?. J. Fondrevelle, A. Oulamara, and M. Portmann, Approche de résolution pour les problèmes de flowshop avec time-lags minimaux et maximaux, 6ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision ROADEF'05, 2005.

?. G. Thisselin, A. Oulamara, W. Ramdane-cherif, and M. Portmann, Méthodes d optimisation combinatoire pour un probleme d optimisation de maintenance corrective, 2005.

?. J. Fondrevelle, A. Oulamara, and M. Portmann, Minimizing makespan in flowshop with time lags, in : Models and Algorithms for Planning and Scheduling Problems -MAPSP, pp.138-139, 2005.

?. J. Fondrevelle, A. Oulamara, and M. Portmann, Minimizing the weighted sum of machine completion times in flowshop with time lags : complexity results and a solution approach, International Conference on Industrial Engineering and Systems Management -IESM'05, 2005.

?. Z. Mouloua, A. Oulamara, and W. Ramdane-cherif, Approche par décomposition pour le problème de planification de tournées de personnel, in : 6ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision -ROADEF, 2005.

?. J. Fondrevelle, A. Oulamara, and M. Portmann, Minimizing the weighted sum of machine completion times in flowshop with time lags, International Conference on Industriel Engineering and Systems Management, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00000148

?. A. Oulamara, A. Soukhal, and P. Martineau, Some results for particular cases of two machines flowshop with transportation constraints, International Conference on Industrial Engineering and Production Management, 2001.

?. A. Oulamara and A. Soukhal, Flowshop scheduling problems with transportation and capacities constraints, International Conference on Systems, 2001.

?. J. Fondrevelle, A. Allahverdi, A. Oulamara, and M. Portmann, Permutation flowshop with exact time lags to minimize maximum lateness, 2005.
DOI : 10.1080/00207540802320164

?. J. Fondrevelle, A. Allahverdi, and A. Oulamara, Two-machine no-wait flowshop scheduling problem to minimize maximum lateness with separate setup and removal times, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00100231