A. Caprara, H. Kellerer, and U. Pferschy, A PTAS for the Multiple Subset Sum Problem with different knapsack capacities, Information Processing Letters, vol.73, issue.3-4, 2000.
DOI : 10.1016/S0020-0190(00)00010-7

A. Caprara, H. Kellerer, and U. Pferschy, The Multiple Subset Sum Problem, SIAM Journal on Optimization, vol.11, issue.2, pp.308-319, 2000.
DOI : 10.1137/S1052623498348481

A. Caprara, H. Kellerer, and U. Pferschy, A 3/4-Approximation Algorithm for Multiple Subset Sum, Journal of Heuristics, vol.9, issue.2, pp.99-111, 2003.
DOI : 10.1023/A:1022584312032

A. Darties, J. Giroudeau, G. König, and . Simonin, Scheduling stretched coupledtasks with compatibilities constraints : model, complexity and approximation results for some class of graphs, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00947519

M. Dawande, J. Kalagnanam, P. Keskinocak, F. S. Salman, and R. Ravi, Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions, Journal of Combinatorial Optimization, vol.4, issue.2, pp.171-186, 2000.
DOI : 10.1023/A:1009894503716

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

R. Graham, E. Lawler, J. Lenstra, and A. 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

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

G. Simonin, R. Giroudeau, and J. König, Complexity and approximation for scheduling problem for coupled-tasks in presence of compatibility tasks, Project Management and Scheduling, 2010.
URL : https://hal.archives-ouvertes.fr/lirmm-00488279