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

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

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

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.4, pp.287-326, 1979.
DOI : 10.1016/S0167-5060(08)70356-X

D. Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, 1997.
DOI : 10.1017/CBO9780511574931

V. Lebacque, N. Brauner, B. Celse, G. Finke, and C. Rapine, Planification d'expériences dans l'industrie chimique, Colloque IPI 2006, 2006.

M. Middendorf, Supersequences, runs, and CD grammar systems, Theoretical Computer Science Topics in Computer Science, vol.6, pp.101-114, 1994.

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

K. Raiha and E. Ukkonen, The shortest common supersequence problem over binary alphabet is NP-complete, Theoretical Computer Science, vol.16, issue.2, pp.187-198, 1981.
DOI : 10.1016/0304-3975(81)90075-X

V. G. Timkovsky, Complexity of common subsequence and supersequence problems and related problems, Cybernetics, vol.2, issue.No. 1, pp.565-580, 1990.
DOI : 10.1007/BF01075212