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.3-4, 2001.
DOI : 10.1016/S0360-8352(01)00009-2

Y. 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

H. Chen, B. Du, and G. Q. Huang, Metaheuristics to minimise makespan on parallel batch processing machines with dynamic job arrivals, International Journal of Computer Integrated Manufacturing, vol.14, issue.7, pp.942-956, 2010.
DOI : 10.1080/0951192X.2010.495137

S. H. Chung, Y. T. Tai, and W. L. Pearn, Minimizing makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes, International Journal of Production Research, issue.18, pp.475109-5128, 2009.

C. Jr, E. G. Garey, M. R. Johnson, and D. S. , Bin packing with divisible item sizes, Journal of Complexity, vol.3, issue.4, pp.406-428, 1987.

C. Jr, E. G. Garey, M. R. Johnson, and D. S. , Approximation algorithms for bin packing: A survey. in Approximation Algorithms for, pp.46-93, 1997.

P. Damodaran, V. Gallego, and M. C. , Heuristics for makespan minimization on parallel batch processing machines with unequal job ready times, The International Journal of Advanced Manufacturing Technology, vol.21, issue.9-12, pp.9-12, 2010.
DOI : 10.1007/s00170-009-2457-1

P. Damodaran, M. C. Velez-gallego, and J. Maya, A GRASP approach for REFERENCES 17, 2011.

L. Dupont, J. Ghazvini, and F. , Minimizing makespan on a single batch processing machine with non-identical job sizes, European Journal of Automation, vol.32, issue.4, pp.431-440, 1998.

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

T. Feo and M. G. Resende, A probabilistic heuristic for a computationally difficult set covering problem, Operations Research Letters, vol.8, issue.2, pp.67-71, 1989.
DOI : 10.1016/0167-6377(89)90002-3

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

J. Ghazvini, F. Dupont, and L. , 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

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

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, pp.135-146, 2006.
DOI : 10.1007/11730095_12

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, F. Ghomi, and S. T. , A note on minimizing makespan on a single batch processing machine with nonidentical job sizes, Theoretical Computer Science, vol.410, pp.27-29, 2009.

A. H. Kashan, B. Karimi, and F. Jolai, An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with non-identical job sizes, Engineering Applications of Artificial Intelligence, vol.23, issue.6, pp.911-922, 2010.
DOI : 10.1016/j.engappai.2010.01.031

K. G. Kempf, R. Uzsoy, and C. 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

C. Y. 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

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. Lu, H. Feng, and X. Li, Minimizing the makespan on a single parallel batching machine, Theoretical Computer Science, vol.411, issue.7-9, pp.7-9, 2010.
DOI : 10.1016/j.tcs.2009.12.008

S. Martello and P. Toth, Knapsack problems: algorithms and computer implementations, 1990.

S. Melouk, P. Damodaran, and P. 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

J. J. Neale and I. Duenyas, Control of a Batch Processing Machine Serving Compatible Job Families, IIE Transactions, vol.35, issue.8, pp.699-710, 2003.
DOI : 10.1080/07408170304347

K. Ngo-cong, Etude et amelioration de l'organisation de la production de dispositifs medicaux steriles. Thesis (PhD), 2009.
URL : https://hal.archives-ouvertes.fr/tel-00371165

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

N. R. Parsa, B. Karimi, . Lee, and A. H. Kashan, A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes, Computers & Operations Research, vol.37, issue.10, pp.1720-1730, 2010.
DOI : 10.1016/j.cor.2009.12.007

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

A. Standard and . Fd-s98-135, Sterilisation des dispositifs medicaux Guide pour la maitrise des traitements appliques aux dispositifs medicaux reutilisables Uzsoy, R., 1994. Scheduling a single batch processing machine with non-identical job sizes, International Journal of Production Research, vol.32, issue.7, pp.1615-1635

H. Wang and F. Chou, Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics. Expert Systems with Applications, An International Journal, vol.37, issue.2, pp.1510-1521, 2010.

G. Zhang, X. Cai, C. Y. 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.1002/nav.4

X. Zhang, Y. Zhang, Z. Cao, and Z. Cai, Approximation Schemes for Scheduling a Batching Machine with Nonidentical Job Size, Journal of Systems Science and Complexity, vol.48, issue.4, pp.592-600, 2007.
DOI : 10.1007/s11424-007-9057-7