M. B. Abiri, M. Zandieh, and A. Alem-tabriz, A tabu search approach to hybrid flow shops scheduling with sequence-dependent setup times, Journal of Applied Sciences, vol.9, issue.9, pp.1740-1745, 2009.

F. Afrati, E. Bampis, C. Chekuri, D. Karger, 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

URL : http://www.cis.upenn.edu/~sanjeev/postscript/completion_time.ps.gz

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

F. S. Al-anzi and A. Allahverdi, A hybrid tabu search heuristic for the two-stage assembly scheduling problem, International Journal of Operations Research, vol.3, pp.109-119, 2006.

F. S. Al-anzi and A. Allahverdi, A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times, European Journal of Operational Research, vol.182, issue.1, pp.80-94, 2007.
DOI : 10.1016/j.ejor.2006.09.011

F. S. Al-anzi and A. Allahverdi, Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan, Computers & Operations Research, vol.36, issue.9, pp.2682-2689, 2009.
DOI : 10.1016/j.cor.2008.11.018

K. Alayk´yranalayk´yran, O. Engin, and A. Döyen, Using ant colony optimization to solve hybrid flow shop scheduling problems, International Journal of Advanced Manufacturing Technology, vol.35, pp.5-6, 2007.

A. Tabriz, A. , M. Zandieh, and Z. Vaziri, A novel simulated annealing algorithm to hybrid flow shops scheduling with sequence-dependent setup times, Journal of Applied Sciences, vol.9, issue.10, pp.1943-1949, 2009.

A. Allahverdi and F. S. Al-anzi, A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application, Computers & Operations Research, vol.33, issue.4, pp.1056-1080, 2006.
DOI : 10.1016/j.cor.2004.09.002

A. Allahverdi and F. S. Al-anzi, Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times, International Journal of Production Research, vol.48, issue.22, pp.4713-4735, 2006.
DOI : 10.1080/05695557908974469

A. Allahverdi and F. S. Al-anzi, The two-stage assembly scheduling problem to minimize total completion time with setup times, Computers & Operations Research, vol.36, issue.10, pp.2740-2747, 2009.
DOI : 10.1016/j.cor.2008.12.001

M. R. Amin-naseri and M. A. Beheshti-nia, Hybrid flow shop scheduling with parallel batching, International Journal of Production Economics, vol.117, issue.1, pp.185-196, 2009.
DOI : 10.1016/j.ijpe.2008.10.009

R. N. Anthony, Planning and Control Systems : a framework for analysis, 1965.

M. Azizoglu, E. Cakmak, and S. Kondakci, A flexible flowshop problem with total flow time minimization, European Journal of Operational Research, vol.132, issue.3, pp.528-538, 2001.
DOI : 10.1016/S0377-2217(00)00142-9

M. Azizoglu and S. Webster, Scheduling a batch processing machine with non-identical job sizes, International Journal of Production Research, vol.38, issue.10, pp.2173-2184, 2000.
DOI : 10.1080/00207540050028034

M. Azizoglu and S. Webster, Scheduling a batch processing machine with incompatible job families, Computers & Industrial Engineering, vol.39, issue.3-4, pp.325-335, 2001.
DOI : 10.1016/S0360-8352(01)00009-2

S. Bai, F. Zhang, S. Li, and Q. Liu, Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness, Lecture Notes in Computer Science, pp.4613-172, 2007.
DOI : 10.1007/978-3-540-73814-5_16

H. Balasubramanian, L. Mönch, J. Fowler, and M. Pfund, Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness, International Journal of Production Research, vol.1, issue.8, pp.42-1621, 2004.
DOI : 10.1016/S0305-0548(01)00031-4

A. Bellanger and A. Oulamara, Scheduling hybrid flowshop with parallel batching machines and compatibilities, Computers & Operations Research, vol.36, issue.6, pp.1982-1992, 2009.
DOI : 10.1016/j.cor.2008.06.011

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

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.11-24, 1983.
DOI : 10.1016/0166-218X(83)90012-4

URL : https://doi.org/10.1016/0166-218x(83)90012-4

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

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

S. A. Brah and J. L. Hunsucker, Branch and bound algorithm for the flow shop with multiple processors, European Journal of Operational Research, vol.51, issue.1, pp.88-99, 1991.
DOI : 10.1016/0377-2217(91)90148-O

S. A. Brah and L. L. Loo, Heuristics for scheduling in a flow shop with multiple processors, European Journal of Operational Research, vol.113, issue.1, pp.113-122, 1999.
DOI : 10.1016/S0377-2217(97)00423-2

P. Brucker, A. Gladky, H. 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

URL : https://pure.tue.nl/ws/files/1429671/495438.pdf

M. Cai, X. Deng, H. Feng, G. Li, and G. Liu, A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling, Lecture Notes in Computer Science, pp.2337-304, 2002.
DOI : 10.1007/3-540-47867-1_22

J. Carlier, Probì emes d'OrdonnancementàOrdonnancementà Contraintes de Ressources : Algorithmes et Complexité, Thèse d' ´ Etat, 1984.

J. Carlier and E. Néron, An exact method for solving the multiprocessor flowshop, RAIRO-Oper Res, vol.78, pp.146-161, 2000.

P. M. Castro, A. Q. Novais, and A. Carvalho, MILP-based decomposition method for the optimal scheduling of an industrial batch plant, Computer Aided Chemical Engineering, vol.25, pp.557-562, 2008.
DOI : 10.1016/S1570-7946(08)80098-3

V. Chandru, C. Lee, and R. Uzsoy, Minimizing total completion time on batch processing machines, International Journal of Production Research, vol.6, issue.9, pp.2097-2121, 1993.
DOI : 10.1080/00207548808947934

V. Chandru, C. Lee, and R. Uzsoy, Minimizing total completion time on a batch processing machine with job families, Operations Research Letters, vol.13, issue.2, pp.61-65, 1993.
DOI : 10.1016/0167-6377(93)90030-K

P. Chang, Y. Chen, and H. Wang, Dynamic Scheduling Problem of Batch Processing Machine in Semiconductor Burn-in Operations, Lecture Notes in Computer Science, issue.IV, pp.3483-172, 2005.
DOI : 10.1007/11424925_20

P. Chang, P. Damodaran, and S. Melouk, Minimizing makespan on parallel batch processing machines, International Journal of Production Research, vol.45, issue.19, pp.4211-4220, 2004.
DOI : 10.1080/07408178708975376

P. C. Chang and H. M. Wang, A heuristic for a batch processing machine scheduled to minimise total completion time with non-identical job sizes, The International Journal of Advanced Manufacturing Technology, vol.43, issue.7-8, pp.615-620, 2004.
DOI : 10.1007/s00170-003-1740-9

B. Chen, X. Deng, and W. Zang, On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time, Journal of Combinatorial Optimization, vol.8, issue.1, pp.85-95, 2004.
DOI : 10.1023/B:JOCO.0000021939.01674.1f

B. Cheng, H. Chen, H. Shao, R. Xu, and G. Q. Huang, A chaotic ant colony optimization method for scheduling a single batch-processing machine with non-identical job sizes, IEEE Congress on Evolutionary Computation CEC, vol.2008, pp.40-43, 2008.

B. Cheng, H. Chen, and S. Wang, Fuzzy scheduling for single batchprocessing machine with non-identical job sizes, IEEE International Conference on Fuzzy Systems, pp.27-30, 2008.

T. C. Cheng, Z. Liu, and W. Yu, Scheduling jobs with release dates and deadlines on a batch processing machine, IIE Transactions, vol.33, issue.8, pp.685-690, 2001.
DOI : 10.1023/A:1010991401683

T. C. Cheng, C. T. Ng, J. J. Yuan, and Z. H. Liu, Single machine parallel batch scheduling subject to precedence constraints, Naval Research Logistics, vol.31, issue.7, pp.51-949, 2004.
DOI : 10.1007/978-3-662-04550-3

T. C. Cheng and G. Wang, Scheduling the fabrication and assembly of components in a two-machine flowshop, IIE Transactions, issue.2, pp.31-135, 1999.

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, 2005.
DOI : 10.1016/j.cor.2003.09.001

S. H. Cheraghi, V. Vishwaram, and K. K. Krishnan, Scheduling a single batchprocessing machine with disagreeable ready times and due dates, International Journal of Industrial Engineering : Theory Applications and Practice, vol.10, issue.2, pp.175-187, 2003.

H. Choi and D. Lee, Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops, Computers & Industrial Engineering, vol.56, issue.1, pp.113-120, 2009.
DOI : 10.1016/j.cie.2008.04.005

F. Chou, A joint GA+DP approach for single burn-in oven scheduling problems with makespan criterion, The International Journal of Advanced Manufacturing Technology, vol.120, issue.5-6, pp.5-6, 2007.
DOI : 10.1007/s00170-006-0738-5

F. Chou, P. Chang, and H. Wang, A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem, The International Journal of Advanced Manufacturing Technology, vol.29, issue.3-4, pp.31-34, 2006.
DOI : 10.1007/s00170-005-0194-7

F. Chou and H. Wang, SCHEDULING FOR A SINGLE SEMICONDUCTOR BATCH-PROCESSING MACHINE TO MINIMIZE TOTAL WEIGHTED TARDINESS, Journal of the Chinese Institute of Industrial Engineers, vol.32, issue.2, pp.136-147, 2008.
DOI : 10.1002/nav.4

R. Conway, W. Maxwell, and L. Miller, Theory of scheduling, 1967.

P. Damodaran and P. Chang, Heuristics to minimize makespan of parallel batch processing machines, The International Journal of Advanced Manufacturing Technology, vol.7, issue.10, pp.9-10, 2008.
DOI : 10.1007/s00170-007-1042-8

P. Damodaran, P. Kumar-manjeshwar, and K. Srihari, Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms, International Journal of Production Economics, vol.103, issue.2, pp.882-891, 2006.
DOI : 10.1016/j.ijpe.2006.02.010

P. Damodaran and K. Srihari, Mixed integer formulation to minimize makespan in a flow shop with batch processing machines, Mathematical and Computer Modelling, vol.40, issue.13, pp.40-1465, 2004.
DOI : 10.1016/j.mcm.2005.01.005

P. Damodaran, K. Srihari, and S. S. Lam, Scheduling a capacitated batch-processing machine to minimize makespan, Robotics and Computer-Integrated Manufacturing, vol.23, issue.2, pp.208-216, 2007.
DOI : 10.1016/j.rcim.2006.02.012

D. Danneberg, T. Tautenhahn, and F. Werner, A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size, Mathematical and Computer Modelling, vol.29, issue.9, pp.101-126, 1999.
DOI : 10.1016/S0895-7177(99)00085-0

M. Demange, D. De-werra, J. Monnot, and V. Th-paschos, Weighted Node Coloring: When Stable Sets Are Expensive, Proceedings of the 28th International Workshop on Graph-theoretic Concepts in Computer Science, pp.114-125, 2002.
DOI : 10.1007/3-540-36379-3_11

X. Deng, H. Feng, G. Li, and B. Shi, A PTAS for Semiconductor Burn-in Scheduling, Journal of Combinatorial Optimization, vol.45, issue.1, pp.5-17, 2005.
DOI : 10.1007/s10878-005-5480-7

X. Deng, H. Feng, P. Zhang, Y. Zhang, and H. Zhu, Minimizing Mean Completion Time in a Batch Processing System, Algorithmica, vol.38, issue.4, pp.513-528, 2004.
DOI : 10.1007/s00453-003-1053-2

X. Deng, C. Poon, and Y. Zhang, Approximation Algorithms in Batch Processing, Journal of Combinatorial Optimization, vol.7, pp.247-257, 2003.
DOI : 10.1007/3-540-46632-0_16

X. Deng and Y. Zhang, Minimizing Mean Response Time in Batch Processing System, Lecture Notes in Computer Science, vol.1627, pp.231-240, 1999.
DOI : 10.1007/3-540-48686-0_23

A. Devpura, J. W. Fowler, M. Carlyle, and I. Perez, Minimizing Total Weighted Tardiness on Single Batch Process Machine with Incompatible Job Families, Proceedings of the Symposium on Operations Research, pp.366-371, 2000.
DOI : 10.1007/978-3-642-56656-1_58

D. Werra, D. , M. Demange, B. Escoffier, J. Monnot et al., Weighted coloring on planar, bipartite and split graphs: Complexity and approximation, Discrete Applied Mathematics, vol.157, issue.4, pp.819-832, 2009.
DOI : 10.1016/j.dam.2008.06.013

URL : https://hal.archives-ouvertes.fr/hal-00004074

G. Dobson and R. S. Nambinadom, The Batch Loading and Scheduling Problem, Operations Research, vol.49, issue.1, 1992.
DOI : 10.1287/opre.49.1.52.11189

URL : https://urresearch.rochester.edu/fileDownloadForInstitutionalItem.action?itemId=4423&itemFileId=6643

G. Dobson and R. S. Nambimadom, The Batch Loading and Scheduling Problem, Operations Research, vol.49, issue.1, pp.52-65, 2001.
DOI : 10.1287/opre.49.1.52.11189

URL : https://urresearch.rochester.edu/fileDownloadForInstitutionalItem.action?itemId=4423&itemFileId=6643

L. Dupont and C. Dhaenens-flipo, Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure, Computers & Operations Research, vol.29, issue.7, pp.807-819, 2002.
DOI : 10.1016/S0305-0548(00)00078-2

L. Dupont and F. Ghazvini, Branch and bound method for minimizing mean flow time on a single batch processing machine, International Journal of Industrial Engineering : Practice and Theory, vol.4, pp.197-203, 1997.

L. Dupont and F. Ghazvini, Minimizing makespan on a single batch processing machine with non-identical job sizes, Journal Européen des Systèmes Automatisés, vol.32, issue.4, pp.431-440, 1998.

O. Engin and A. Döyen, A new approach to solve hybrid flow shop scheduling problems by artificial immune system, Future Generation Computer Systems, vol.20, issue.6, pp.1083-1095, 2004.
DOI : 10.1016/j.future.2004.03.014

L. Epstein, M. M. Halldórsson, A. Levin, and H. Shachnai, Weighted sum coloring in batch scheduling of conflicting jobs, pp.1-23, 2007.

L. Epstein and A. Levin, On the Max Coloring Problem, Lecture Notes in Computer Science, vol.4927, pp.142-155, 2008.
DOI : 10.1007/978-3-540-77918-6_12

V. Erramilli and S. J. Mason, Multiple Orders Per Job Compatible Batch Scheduling, IEEE Transactions on Electronics Packaging Manufacturing, vol.29, issue.4, pp.285-296, 2006.
DOI : 10.1109/TEPM.2006.887355

V. Erramilli and S. J. Mason, Multiple orders per job batch scheduling with??incompatible jobs, Annals of Operations Research, vol.33, issue.8, pp.245-260, 2008.
DOI : 10.1007/s10479-007-0286-x

B. Escoffier, J. Monnot, and V. T. Paschos, Weighted Coloring: further complexity and approximability results, Information Processing Letters, vol.97, issue.3, pp.98-103, 2006.
DOI : 10.1016/j.ipl.2005.09.013

URL : https://hal.archives-ouvertes.fr/hal-00116712

G. Finke, V. Jost, M. Queyranne, and A. Sebö, 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

J. W. Fowler, G. L. Hogg, and D. T. Phillips, CONTROL OF MULTIPRODUCT BULK SERVICE DIFFUSION/OXIDATION PROCESSES, IIE Transactions, vol.5, issue.4, pp.84-96, 1992.
DOI : 10.1287/inte.20.1.43

J. W. Fowler, G. L. Hogg, and D. T. Phillips, Control of multiproduct bulk server diffusion/oxidation processes. Part 2: multiple servers, IIE Transactions, vol.32, issue.2, pp.167-176, 2000.
DOI : 10.1287/inte.20.1.43

R. Fu, T. Ji, J. Yuan, and Y. Lin, Online scheduling in a parallel batch processing system to minimize makespan using restarts, Theoretical Computer Science, vol.374, issue.1-3, pp.1-3, 2007.
DOI : 10.1016/j.tcs.2006.12.040

R. Fu, J. Tian, and J. Yuan, On-line scheduling on an unbounded parallel batch machine to??minimize makespan of two families of jobs, Journal of Scheduling, vol.35, issue.6, pp.91-97, 2009.
DOI : 10.1007/s10951-008-0084-6

R. Fu, J. Tian, J. Yuan, and C. He, On-line scheduling on a batch machine to minimize makespan with limited restarts, Operations Research Letters, vol.36, issue.2, pp.255-258, 2008.
DOI : 10.1016/j.orl.2007.07.001

H. L. Gantt, A graphical daily balance in manufacture, ASME Transactions, vol.24, pp.317-322, 1903.

C. Gao and L. Tang, Scheduling Hybrid Flow Shop for Minimizing Total Weight Completion Time, 2007 IEEE International Conference on Automation and Logistics, pp.809-813, 2007.
DOI : 10.1109/ICAL.2007.4338675

M. R. Garey and D. S. Johnson, `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications, Journal of the ACM, vol.25, issue.3, pp.499-508, 1978.
DOI : 10.1145/322077.322090

M. R. Garey and D. S. Johnson, Computers and Intractibility : A Guide to the Theory of NP-Completeness, 1979.

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

C. Glassey, W. W. Roger, and . Weng, Dynamic batching heuristic for simultaneous processing, IEEE Transactions on Semiconductor Manufacturing, vol.4, issue.2, pp.77-82, 1991.
DOI : 10.1109/66.79719

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.
DOI : 10.1016/S0167-5060(08)70356-X

A. Guinet, M. M. Solomon, P. K. Kedia, and A. Dussauchoy, A computational study of heuristics for two-stage flexible flowshops, International Journal of Production Research, vol.64, issue.5, pp.1399-1415, 1996.
DOI : 10.1016/0377-2217(89)90208-7

A. K. Gupta, V. K. Ganesan, and A. I. Sivakumar, Hot lot management: minimizing cycle time in batch processes, 2004 IEEE International Engineering Management Conference (IEEE Cat. No.04CH37574), pp.1217-1221, 2004.
DOI : 10.1109/IEMC.2004.1408887

A. K. Gupta and A. I. Sivakumar, Optimization of due-date objectives in scheduling semiconductor batch manufacturing, International Journal of Machine Tools and Manufacture, vol.46, issue.12-13, pp.12-13, 2006.
DOI : 10.1016/j.ijmachtools.2005.08.017

J. N. Gupta, Two-Stage, Hybrid Flowshop Scheduling Problem, Journal of the Operational Research Society, vol.39, issue.4, pp.359-364, 1988.
DOI : 10.1057/jors.1988.63

J. N. Gupta, A. M. Hariri, and C. N. Potts, Scheduling a two-stage hybrid flow shop with parallel machines at the first stage, Annals of Operations Research, vol.69, pp.171-191, 1997.
DOI : 10.1023/A:1018976827443

J. N. Gupta and E. F. Stafforned-jr, Flowshop scheduling research after five decades, European Journal of Operational Research, vol.169, issue.3, pp.699-711, 2006.
DOI : 10.1016/j.ejor.2005.02.001

J. N. Gupta and E. A. Tunc, Minimizing tardy jobs in a two-stage hybrid flowshop, International Journal of Production Research, vol.36, issue.9, pp.2397-2417, 1998.
DOI : 10.1080/002075498192599

U. I. Gupta, D. T. Lee, J. Y. , and -. Leung, Efficient algorithms for interval graphs and circular-arc graphs, Networks, vol.9, issue.4, pp.459-467, 1982.
DOI : 10.1016/S0022-0000(76)80045-1

O. Guschinskaya, A. Dolgui, N. Guschinsky, and G. Levin, Minimizing makespan for multi-spindle head machines with a mobile table, Computers & Operations Research, vol.36, issue.2, pp.344-357, 2009.
DOI : 10.1016/j.cor.2007.10.010

URL : https://hal.archives-ouvertes.fr/emse-00673011

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

URL : http://www.orie.cornell.edu/~shmoys/swjCj-soda.ps

L. A. Hall and D. B. Shmoys, Approximation schemes for constrained scheduling problems, 30th Annual Symposium on Foundations of Computer Science, pp.134-139, 1989.
DOI : 10.1109/SFCS.1989.63468

M. M. Halldórsson and H. Shachnai, Batch Coloring Flat Graphs and Thin, Lecture Notes in Computer Science, vol.5124, pp.198-209, 2008.
DOI : 10.1007/978-3-540-69903-3_19

M. Haouari and T. Daouas, Optimal scheduling of the 3-machine assembly-type flow shop, RAIRO - Operations Research, vol.33, issue.4, pp.439-445, 1999.
DOI : 10.1051/ro:1999120

M. Haouari and L. Hidri, On the hybrid flowshop scheduling problem, International Journal of Production Economics, vol.113, issue.1, pp.495-497, 2008.
DOI : 10.1016/j.ijpe.2007.10.007

M. Haouari, L. Hidri, and A. Gharbi, Optimal Scheduling of a Two-stage Hybrid Flow Shop, Mathematical Methods of Operations Research, vol.43, issue.1, pp.107-124, 2006.
DOI : 10.1007/978-3-642-80784-8_7

A. M. Hariri and C. N. Potts, A branch and bound algorithm for the two-stage assembly scheduling problem, European Journal of Operational Research, vol.103, issue.3, pp.547-556, 1997.
DOI : 10.1016/S0377-2217(96)00312-8

C. He, Y. Lin, and J. Yuan, Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan, Theoretical Computer Science, vol.381, issue.1-3, pp.1-3, 2007.
DOI : 10.1016/j.tcs.2007.04.034

URL : https://doi.org/10.1016/j.tcs.2007.04.034

L. He and S. Sun, A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately, Journal of Shanghai University (English Edition), vol.24, issue.3, pp.33-38, 2007.
DOI : 10.1007/978-1-4613-3629-7_1

L. He, S. Sun, and R. Luo, A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM, Asia-Pacific Journal of Operational Research, vol.18, issue.01, 2007.
DOI : 10.1016/S0377-2217(99)00031-4

A. B. Hmida, M. Huguet, P. Lopez, and M. Haouari, Adaptation of discrepancybased methods for solving hybrid flow shop problems, Proceedings -ICSSSM'06 : 2006 International Conference on Service Systems and Service Management, pp.1120-1125, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00137979

D. S. Hochbaum and D. Landy, Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime, Operations Research, vol.45, issue.6, pp.874-885, 1997.
DOI : 10.1287/opre.45.6.874

H. Hoogeveen and S. Van-de-velde, Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine, Mathematical Programming, pp.273-289, 1998.
DOI : 10.1007/BF01585876

Y. Ikura and M. Gimple, Efficient scheduling algorithms for a single batch processing machine, Operations Research Letters, vol.5, issue.2, pp.61-65, 1986.
DOI : 10.1016/0167-6377(86)90104-5

Z. Jin, Z. Yang, and T. Ito, Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem, International Journal of Production Economics, vol.100, issue.2, pp.322-334, 2006.
DOI : 10.1016/j.ijpe.2004.12.025

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

F. Jolai, Minimizing number of tardy jobs on a batch processing machine with incompatible job families, European Journal of Operational Research, vol.162, issue.1, pp.184-190, 2005.
DOI : 10.1016/j.ejor.2003.10.011

J. Ghazvini, F. , and L. Dupont, Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes, International Journal of Production Economics, vol.55, issue.3, pp.273-280, 1998.
DOI : 10.1016/S0925-5273(98)00067-X

A. Jouglet, C. O?guzo?guz, and M. Sevaux, Hybrid Flow-Shop: a Memetic Algorithm Using Constraint-Based Scheduling for Efficient Search, Journal of Mathematical Modelling and Algorithms, vol.33, issue.5, pp.1-22, 2009.
DOI : 10.1007/978-3-662-04363-9

URL : https://hal.archives-ouvertes.fr/hal-00369088

A. H. Kashan and B. Karimi, Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework, Journal of the Operational Research Society, vol.6, issue.9, pp.1269-1280, 2008.
DOI : 10.1016/S0305-0548(01)00031-4

A. H. Kashan and B. Karimi, An improved mixed integer linear formulation and lower bounds for minimizing makespan on a flow shop with batch processing machines, The International Journal of Advanced Manufacturing Technology, vol.6, issue.5-6, pp.5-6, 2009.
DOI : 10.1111/j.1937-5956.1997.tb00415.x

A. H. Kashan, B. Karimi, and S. M. Ghomi, A note on minimizing makespan on a single batch processing machine with nonidentical job size, Theoretical Computer Science, vol.410, pp.27-29, 2009.

A. H. Kashan, B. Karimi, and M. Jenabi, A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes, Computers & Operations Research, vol.35, issue.4, pp.1084-1098, 2008.
DOI : 10.1016/j.cor.2006.07.005

A. H. Kashan, B. Karimi, and F. Jolai, Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach, Lecture Notes in Computer ScienceLNCS, pp.3906-135, 2006.
DOI : 10.1007/11730095_12

K. G. Kempf, R. Uzsoy, and C. S. Wang, Scheduling a single batch processing machine with secondary resource constraints, Journal of Manufacturing Systems, vol.17, issue.1, pp.37-51, 1998.
DOI : 10.1016/S0278-6125(98)80008-3

H. A. Kierstead and J. Qin, Coloring interval graphs with first-fit, Discrete Mathematics, vol.144, issue.1-3, pp.47-57, 1995.
DOI : 10.1016/0012-365X(94)00285-Q

URL : https://doi.org/10.1016/0012-365x(94)00285-q

Y. Kim, B. Joo, and J. Shin, Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint, Journal of Heuristics, vol.96, issue.2, pp.19-42, 2009.
DOI : 10.1145/322077.322090

T. Kis and E. Pesch, A review of exact solution methods for the non-preemptive multiprocessor flowshop problem, European Journal of Operational Research, vol.164, issue.3, pp.592-608, 2005.
DOI : 10.1016/j.ejor.2003.12.026

S. Koh, P. Koo, J. Ha, and W. Lee, Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families, International Journal of Production Research, vol.42, issue.19, pp.42-4091, 2004.
DOI : 10.1016/S0305-0548(01)00031-4

S. Koh, P. Koo, D. Kim, and W. Hur, Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families, International Journal of Production Economics, vol.98, issue.1, pp.81-96, 2005.
DOI : 10.1016/j.ijpe.2004.10.001

C. Koulamas and G. Kyparisis, The three-stage assembly flowshop scheduling problem, Computers & Operations Research, vol.28, issue.7, pp.689-704, 2001.
DOI : 10.1016/S0305-0548(00)00004-6

W. Kubiak and F. Ghazvini, Minimizing earliness/tardiness criteria on a batch processing machine with job families, Second Annual International Conference on Industrial Engineering, pp.785-790, 1997.

P. Kumar-manjeshwar, P. Damodaran, and K. Srihari, Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing, Robotics and Computer-Integrated Manufacturing, vol.25, issue.3, pp.667-679, 2009.
DOI : 10.1016/j.rcim.2008.05.003

M. E. Kurz and R. G. Askin, Scheduling flexible flow lines with sequence-dependent setup times, European Journal of Operational Research, vol.159, issue.1, pp.66-82, 2004.
DOI : 10.1016/S0377-2217(03)00401-6

M. E. Kurz and S. J. Mason, Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times, International Journal of Production Research, vol.46, issue.1, pp.131-151, 2008.
DOI : 10.1287/mnsc.33.8.1035

E. L. Lawler, J. K. Lenstra, A. H. Kan, and D. B. Shmoys, Sequencing and scheduling : algorithms and complexity, Logistics of Production and Inventory, pp.445-522, 1993.
DOI : 10.1016/s0927-0507(05)80189-6

E. L. Lawler and J. M. Moore, A Functional Equation and its Application to Resource Allocation and Sequencing Problems, Management Science, vol.16, issue.1, pp.77-84, 1969.
DOI : 10.1287/mnsc.16.1.77

C. Y. Lee, T. C. Cheng, and B. M. Lin, Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem, Management Science, vol.39, issue.5, pp.616-625, 1993.
DOI : 10.1287/mnsc.39.5.616

G. Lee and Y. Kim, A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness, International Journal of Production Research, vol.42, issue.22, pp.42-4731, 2004.
DOI : 10.1016/S0925-5273(01)00175-X

G. Lee, Y. Kim, and S. Choi, Bottleneck-focused scheduling for a hybrid flowshop, International Journal of Production Research, vol.44, issue.1, pp.165-181, 2004.
DOI : 10.1287/mnsc.33.8.1035

C. Y. Lee, R. Uzsoy, L. A. Martin, and . Vega, Efficient Algorithms for Scheduling Semiconductor Burn-In Operations, Operations Research, vol.40, issue.4, pp.764-775, 1992.
DOI : 10.1287/opre.40.4.764

C. Lee and R. Uzsoy, Minimizing makespan on a single batch processing machine with dynamic job arrivals, International Journal of Production Research, vol.37, issue.1, pp.219-236, 1999.
DOI : 10.1080/002075499192020

C. L. Li and C. Y. Lee, Scheduling with agreeable release times and due dates on a batch processing machine, European Journal of Operational Research, vol.96, issue.3, pp.564-569, 1997.

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.157-164, 2005.
DOI : 10.1016/j.orl.2004.04.009

S. Li, G. Li, and S. Zhang, Minimizing makespan with release times on identical parallel batching machines, Discrete Applied Mathematics, vol.148, issue.1, pp.127-134, 2005.
DOI : 10.1016/j.dam.2004.11.004

L. Li and F. Qiao, ACO-based scheduling for a single Batch Processing Machine in semiconductor manufacturing, 2008 IEEE International Conference on Automation Science and Engineering, pp.85-90, 2008.
DOI : 10.1109/COASE.2008.4626455

L. Li, F. Qiao, and Q. Wu, ACO-Based Scheduling of Parallel Batch Processing Machines with Incompatible Job Families to Minimize Total Weighted Tardiness, Lecture Notes in Computer Science, pp.5217-219, 2008.
DOI : 10.1007/978-3-540-87527-7_20

L. Lili and Z. Feng, Minimizing number of tardy jobs on a batch processing machine with incompatible job families, Proceedings -ISECS International Colloquium on Computing, Communication, Control, and Management, pp.277-280, 2008.

S. Li and J. Yuan, Parallel-machine parallel-batching scheduling with??family jobs and release dates to minimize makespan, Journal of Combinatorial Optimization, vol.320, issue.1, 2008.
DOI : 10.1007/978-3-662-04550-3

C. Liao and L. Liao, Improved MILP models for two-machine flowshop with batch processing machines, Mathematical and Computer Modelling, vol.48, issue.7-8, pp.1254-1264, 2008.
DOI : 10.1016/j.mcm.2008.01.001

URL : https://doi.org/10.1016/j.mcm.2008.01.001

R. Linn and W. Zhang, Hybrid flow shop scheduling: A survey, Computers & Industrial Engineering, vol.37, issue.1-2, pp.57-61, 1999.
DOI : 10.1016/S0360-8352(99)00023-6

Z. Liu and T. C. Cheng, Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine, Theoretical Computer Science, vol.347, issue.1-2, pp.288-298, 2005.
DOI : 10.1016/j.tcs.2005.07.028

L. L. Liu, C. T. Ng, and T. C. Cheng, Scheduling jobs with agreeable processing times and due dates on a single batch processing machine, Theoretical Computer Science, vol.374, issue.1-3, pp.1-3, 2007.
DOI : 10.1016/j.tcs.2006.12.039

URL : https://doi.org/10.1016/j.tcs.2006.12.039

L. L. Liu, C. T. Ng, and T. C. Cheng, Scheduling jobs with release dates on parallel batch processing machines, Discrete Applied Mathematics, vol.157, issue.8, pp.157-1825, 2009.
DOI : 10.1016/j.dam.2008.12.012

URL : https://doi.org/10.1016/j.dam.2008.12.012

Z. Liu and W. Yu, Scheduling one batch processor subject to job release dates, Discrete Applied Mathematics, vol.105, issue.1-3, pp.129-136, 2000.
DOI : 10.1016/S0166-218X(00)00181-5

URL : https://doi.org/10.1016/s0166-218x(00)00181-5

Z. Liu, J. Yuan, and T. C. Cheng, On scheduling an unbounded batch machine, Operations Research Letters, vol.31, issue.1, pp.42-48, 2003.
DOI : 10.1016/S0167-6377(02)00186-4

URL : http://repository.lib.polyu.edu.hk/jspui/bitstream/10397/624/1/batch.pdf

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

L. Lu, T. C. Cheng, J. Yuan, and L. Zhang, Bounded single-machine parallel-batch scheduling with release dates and rejection, Computers & Operations Research, vol.36, issue.10, pp.2748-2751, 2009.
DOI : 10.1016/j.cor.2008.12.003

URL : http://repository.lib.polyu.edu.hk/jspui/bitstream/10397/1306/1/p-batch_with_C%26OR.pdf

L. Lu and J. Yuan, Unbounded parallel batch scheduling with job delivery to minimize makespan, Operations Research Letters, vol.36, issue.4, pp.477-480, 2008.
DOI : 10.1016/j.orl.2008.01.006

L. Lu, L. Zhang, and J. Yuan, The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan, Theoretical Computer Science, vol.396, issue.1-3, pp.1-3, 2008.
DOI : 10.1016/j.tcs.2008.02.015

S. Malve and R. Uzsoy, A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families, Computers & Operations Research, vol.34, issue.10, pp.3016-3028, 2007.
DOI : 10.1016/j.cor.2005.11.011

M. Mathirajan and A. I. Sivakumar, A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor, The International Journal of Advanced Manufacturing Technology, vol.32, issue.9-10, pp.9-10, 2006.
DOI : 10.1017/S0269964801152071

M. Mathirajan and A. I. Sivakumar, Minimizing total weighted tardiness on heterogeneous batch processing machines with incompatible job families, The International Journal of Advanced Manufacturing Technology, vol.26, issue.9, pp.1038-1047, 2006.
DOI : 10.1016/S0305-0548(03)00239-9

M. Mathirajan, A. I. Sivakumar, and V. Chandru, Scheduling algorithms for heterogeneous batch processors with incompatible job-families, Journal of Intelligent Manufacturing, vol.15, issue.6, pp.787-803, 2004.
DOI : 10.1023/B:JIMS.0000042664.94495.26

S. Melouk, P. Damodaran, and P. Y. Chang, Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing, International Journal of Production Economics, vol.87, issue.2, pp.141-147, 2004.
DOI : 10.1016/S0925-5273(03)00092-6

S. V. Mehta and R. Uzsoy, Minimizing total tardiness on a batch processing machine with incompatible job families. I.I, E. Transaction on Scheduling and Logistics, vol.31, pp.165-178, 1998.

H. S. Mirsanei, B. Karimi, and F. Jolai, Flow shop scheduling with two batch processing machines and nonidentical job sizes, The International Journal of Advanced Manufacturing Technology, vol.32, issue.7, pp.1-20, 2009.
DOI : 10.1007/978-3-7091-4338-4_3

L. Mönch, H. Balasubramanian, J. W. Fowler, and M. E. Pfund, Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times, Computers & Operations Research, vol.32, issue.11, pp.2731-2750, 2005.
DOI : 10.1016/j.cor.2004.04.001

L. Mönch, R. Unbehaun, and Y. I. Choung, Minimizing earliness???tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint, OR Spectrum, vol.43, issue.8, pp.177-198, 2006.
DOI : 10.1007/s00291-005-0013-4

O. Moursli and Y. Pochet, 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

E. G. Negenman, Local search algorithms for the multiprocessor flow shop scheduling problem, European Journal of Operational Research, vol.128, issue.1, pp.147-158, 2001.
DOI : 10.1016/S0377-2217(99)00354-9

E. Néron, P. Baptiste, and J. N. Gupta, Solving hybrid flow shop problem using energetic reasoning and global operations, Omega, vol.29, issue.6, pp.29-501, 2001.
DOI : 10.1016/S0305-0483(01)00040-8

K. Neumann, C. Schwindt, and N. Trautmann, Advanced production scheduling for batch plants in process industries, OR Spectrum, vol.24, issue.3, pp.251-279, 2002.
DOI : 10.1007/s00291-002-0100-8

C. T. Ng, M. Y. Kovalyov, and T. C. Cheng, A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure, European Journal of Operational Research, vol.200, issue.2, pp.621-624, 2010.
DOI : 10.1016/j.ejor.2009.01.040

Q. Q. Nong, T. C. Cheng, and C. T. Ng, An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines, Operations Research Letters, vol.36, issue.5, pp.584-588, 2008.
DOI : 10.1016/j.orl.2008.03.004

Q. Q. Nong, C. T. Ng, and T. C. Cheng, The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan, Operations Research Letters, vol.36, issue.1, pp.61-66, 2008.
DOI : 10.1016/j.orl.2007.01.007

Q. Nong, J. Yuan, R. Fu, L. Lin, and J. Tian, The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan, International Journal of Production Economics, vol.111, issue.2, pp.435-440, 2008.
DOI : 10.1016/j.ijpe.2006.12.061

E. Nowicki and C. Smutnicki, The flow shop with parallel machines: A tabu search approach, European Journal of Operational Research, vol.106, issue.2-3, pp.226-253, 1998.
DOI : 10.1016/S0377-2217(97)00260-9

C. O?-guz and M. F. Ercan, A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks, Journal of Scheduling, vol.33, issue.4, pp.323-351, 2005.
DOI : 10.1007/978-3-662-03315-9

A. Oulamara and G. Finke, Flowshop problems with two batch processing machines, International Journal of Mathematical Algorithms, vol.2, pp.269-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, pp.391-401, 2009.
DOI : 10.1016/j.cor.2007.10.006

URL : https://hal.archives-ouvertes.fr/hal-00185479

A. Oulamara, M. Kovalyov, and G. Finke, Scheduling a no-wait flow shop containing unbounded batching machines, IIE Transactions, vol.46, issue.8, pp.685-696, 2005.
DOI : 10.1287/opre.43.4.692

S. V. Pemmaraju, R. Raman, and K. Varadarajan, Buffer minimization using max-coloring, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp.555-564, 2004.

I. C. Perez, J. W. Fowler, and W. M. Carlyle, Minimizing total weighted tardiness on a single batch process machine with incompatible job families, Computers & Operations Research, vol.32, issue.2, pp.327-341, 2005.
DOI : 10.1016/S0305-0548(03)00239-9

M. Pinedo, Scheduling theory, algorithms, and systems, 1995.

C. K. Poon and W. C. Yu, A Flexible On-line Scheduling Algorithm for Batch Machine with Infinite Capacity, Annals of Operations Research, vol.48, issue.3, pp.1-4, 2005.
DOI : 10.1007/s10479-004-5031-0

C. K. Poon and W. C. Yu, On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity, Journal of Combinatorial Optimization, vol.48, issue.3, pp.167-186, 2005.
DOI : 10.1007/s10878-005-6855-5

C. K. Poon and P. Zhang, Minimizing Makespan in Batch Machine Scheduling, Algorithmica, vol.39, issue.2, pp.155-174, 2004.
DOI : 10.1007/s00453-004-1083-4

M. Portmann, A. Vignier, D. Dardilhac, and D. Dezalay, Branch and bound crossed with GA to solve hybrid flowshops, European Journal of Operational Research, vol.107, issue.2, pp.389-400, 1998.
DOI : 10.1016/S0377-2217(97)00333-0

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, S. V. Sevast-'janov, V. A. Strusevich, L. N. Van-wassenhove, and C. M. Zwaneveld, The Two-Stage Assembly Scheduling Problem: Complexity and Approximation, Operations Research, vol.43, issue.2, pp.346-355, 1995.
DOI : 10.1287/opre.43.2.346

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/nav.3800030307

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

X. Qi, S. Zhou, and J. Yuan, Single machine parallel-batch scheduling with deteriorating jobs, Theoretical Computer Science, vol.410, issue.8-10, pp.8-10, 2009.
DOI : 10.1016/j.tcs.2008.11.009

F. Ridouard, P. Richard, and P. Martineau, On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan, European Journal of Operational Research, vol.189, issue.3, pp.1327-1342, 2008.
DOI : 10.1016/j.ejor.2006.06.080

URL : https://hal.archives-ouvertes.fr/hal-01022290

R. Kan and A. H. , Machine scheduling problems : classification, complexity and computation, 1976.
DOI : 10.1007/978-1-4613-4383-7

X. Shubin and J. C. Bean, A genetic algorithm for scheduling parallel nonidentical batch processing machines, Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched, pp.143-150, 2007.

L. Shuguang, L. Guojun, W. Xiaoli, and L. Qiming, Minimizing makespan on a single batching machine with release times and non-identical job sizes, Operations Research Letters, vol.33, pp.157-164, 2005.

W. E. Smith, Various optimizers for single-stage production, Naval Research Logistics Quarterly, vol.2, issue.1-2, pp.59-66, 1956.
DOI : 10.1002/nav.3800030106

H. Soewandi and S. E. Elmaghraby, Sequencing three-stage flexible flowshops with identical machines to minimize makespan, IIE Transactions, vol.15, issue.11, pp.985-993, 2001.
DOI : 10.1016/0305-0483(87)90054-5

N. R. Srinivasa-raghavan and M. Venkataramana, Scheduling parallel batch processors with incompatible job families using ant colony optimization, IEEE International Conference on Automation Science and Engineering, pp.507-512, 2006.

L. H. Su, A hybrid two-stage flowshop with limited waiting time constraints, Computers & Industrial Engineering, vol.44, issue.3, pp.409-424, 2003.
DOI : 10.1016/S0360-8352(02)00216-4

X. Sun, K. Morizawa, and H. Nagasawa, Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling, European Journal of Operational Research, vol.146, issue.3, pp.498-516, 2003.
DOI : 10.1016/S0377-2217(02)00245-X

C. S. Sung and Y. I. Choung, Minimizing makespan on a single burn-in oven in semiconductor manufacturing, European Journal of Operational Research, vol.120, issue.3, pp.559-574, 2000.
DOI : 10.1016/S0377-2217(98)00391-9

C. S. Sung, Y. I. Choung, J. M. Hong, and Y. H. Kim, Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals, Computers & Operations Research, vol.29, issue.8, pp.29-995, 2002.
DOI : 10.1016/S0305-0548(00)00098-8

C. S. Sung and Y. H. Kim, Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed, Computers & Operations Research, vol.29, issue.3, pp.275-294, 2002.
DOI : 10.1016/S0305-0548(00)00071-X

C. S. Sung, Y. H. Kim, and S. H. Yoon, A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines, European Journal of Operational Research, vol.121, issue.1, pp.179-192, 2000.
DOI : 10.1016/S0377-2217(99)00031-4

L. Tang and H. Gong, The coordination of transportation and batching scheduling, Applied Mathematical Modelling, vol.33, issue.10, pp.3854-3862, 2009.
DOI : 10.1016/j.apm.2009.01.002

L. Tang, H. Xuan, and J. Liu, A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time, Computers & Operations Research, vol.33, issue.11, pp.3344-3359, 2006.
DOI : 10.1016/j.cor.2005.03.028

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

S. K. Tangudu and M. E. Kurz, A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families, Production Planning & Control, vol.4, issue.7, pp.17-728, 2006.
DOI : 10.1287/opre.43.4.692

J. Tian, R. Fu, and J. Yuan, On-line scheduling with delivery time on a single batch machine, Theoretical Computer Science, vol.374, issue.1-3, pp.49-57, 2007.
DOI : 10.1016/j.tcs.2006.12.001

A. Tozkapan, O. Kirca, and C. Chung, A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem, Computers & Operations Research, vol.30, issue.2, pp.309-320, 2003.
DOI : 10.1016/S0305-0548(01)00098-3

R. Uzsoy, Scheduling a single batch processing machine with non-identical job sizes, International Journal of Production Research, vol.32, issue.7, pp.1615-1638, 1994.
DOI : 10.1142/S0960313192000157

R. Uzsoy, Scheduling batch processing machines with incompatible job families, International Journal of Production Research, vol.26, issue.10, pp.2635-2708, 1995.
DOI : 10.1080/07408179408966627

R. Uzsoy and Y. Yang, MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON A SINGLE BATCH PROCESSING MACHINE, Production and Operations Management, vol.26, issue.1, pp.57-73, 1997.
DOI : 10.1080/07408179408966627

D. J. Van-der-zee, Dynamic scheduling of batch servers with compatible product families, International Journal of Production Research, vol.33, issue.22, pp.4803-4826, 2004.
DOI : 10.1080/002075497194291

D. J. Van-der-zee, Dynamic scheduling of batch-processing machines with non-identical product sizes, International Journal of Production Research, vol.33, issue.10, pp.2327-2349, 2007.
DOI : 10.1109/66.238169

URL : https://hal.archives-ouvertes.fr/hal-00512903

A. Vandevelde, H. Hoogeveen, C. Hurkens, and J. K. Lenstra, Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop, INFORMS Journal on Computing, vol.17, issue.3, pp.305-320, 2005.
DOI : 10.1287/ijoc.1040.0082

A. Vignier, ContributionàContribution`Contributionà la résolution desprobì emes d'ordonnancement de type monogamme, multimachine, Thèse de Doctorat, 1997.

A. Vignier, J. C. Billaut, and C. Proust, Les probl??mes d'ordonnancement de type flow-shop hybride : ??tat de l'art, RAIRO - Operations Research, vol.33, issue.2, pp.117-183, 1999.
DOI : 10.1051/ro:1999108

H. Wang, P. Chang, and F. Chou, A HYBRID FORWARD/BACKWARD APPROACH FOR SINGLE BATCH SCHEDULING PROBLEMS WITH NON-IDENTICAL JOB SIZES, Journal of the Chinese Institute of Industrial Engineers, vol.4, issue.3, pp.191-199, 2007.
DOI : 10.1002/nav.4

C. Wang and R. Uzsoy, A genetic algorithm to minimize maximum lateness on a batch processing machine, Computers & Operations Research, vol.29, issue.12, pp.1621-1640, 2002.
DOI : 10.1016/S0305-0548(01)00031-4

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

Y. Yang, S. Kreipl, and M. Pinedo, Heuristics for minimizing total weighted tardiness in flexible flow shops, Journal of Scheduling, vol.46, issue.2, pp.89-108, 2000.
DOI : 10.1016/0925-5273(95)00086-0

Z. Yong and Q. Changhua, Genetic algorithm application to the hybrid flow shop scheduling problem, Proceedings of 2008 IEEE International Conference on Mechatronics and Automation, pp.649-653, 2008.

J. Yuan, S. Li, J. Tian, and R. Fu, A??best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times, Journal of Combinatorial Optimization, vol.48, issue.2, pp.206-213, 2009.
DOI : 10.1007/s10878-007-9108-y

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.199-212, 2004.
DOI : 10.1016/j.tcs.2004.01.038

J. Yuan, X. Qi, L. Lu, and W. Li, Single machine unbounded parallel-batch scheduling with forbidden intervals, European Journal of Operational Research, vol.186, issue.3, pp.1212-1217, 2008.
DOI : 10.1016/j.ejor.2007.02.051

Y. Zhang, C. Bai, Q. Bai, and J. Xu, Duplicating in batch scheduling, Journal of Industrial and Management Optimization, vol.3, issue.4, pp.685-692, 2007.

G. Zhang, X. Cai, C. Lee, and C. K. Wong, Minimizing makespan on a single batch processing machine with nonidentical job sizes, Naval Research Logistics, vol.32, issue.3, pp.226-240, 2001.
DOI : 10.1080/00207549408957026

G. Zhang, X. Cai, and C. Wong, On-line algorithms for minimizing makespan on batch processing machines, Naval Research Logistics, vol.105, issue.3, pp.241-258, 2001.
DOI : 10.1002/nav.5

Y. Zhang and Z. Cao, An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan, Lecture Notes in Computer Science, vol.4616, pp.44-51, 2007.
DOI : 10.1007/978-3-540-73556-4_7

Y. Zhang and Z. Cao, An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan, Journal of Combinatorial Optimization, vol.48, issue.7, pp.119-126, 2008.
DOI : 10.1007/s10878-007-9128-7

Y. Zhang, Z. Cao, and Q. Bai, A PTAS for Scheduling on Agreeable Unrelated Parallel Batch Processing Machines with Dynamic Job Arrivals, Lecture Notes in Computer Science, vol.3521, pp.162-171, 2005.
DOI : 10.1007/11496199_19

W. Zhang, H. Chen, D. Lu, and H. Shao, A Novel Differential Evolution Algorithm for a Single Batch-Processing Machine with Non-Identical Job Sizes, 2008 Fourth International Conference on Natural Computation, pp.447-451, 2008.
DOI : 10.1109/ICNC.2008.385

H. Zhao and G. Li, Unbounded batch scheduling with a common due window on a single machine*, Journal of Systems Science and Complexity, vol.75, issue.2, pp.296-303, 2008.
DOI : 10.1111/j.1937-5956.1996.tb00393.x