J. Bla?ewicz, K. Ecker, T. Kis, C. Potts, M. Tanas et al., Scheduling of coupled tasks with unit processing times, Journal of Scheduling, vol.27, issue.10, 2009.
DOI : 10.1007/s10951-010-0167-z

L. Chen, K. Jansen, and G. Zhang, On the optimality of approximation schemes for the classical scheduling problem, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014.
DOI : 10.1137/1.9781611973402.50

M. Chlebík and J. Chlebíková, Inapproximability Results for Bounded Variants of Optimization Problems, Electronic Colloquium on Computational Complexity, vol.10, issue.26, pp.1-26, 1979.
DOI : 10.1007/978-3-540-45077-1_4

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, A. H. Kan, and . Rinnooy, 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. Impagliazzo and R. Paturi, On the Complexity of k-SAT, On the Complexity of k-SAT, pp.367-375, 2001.
DOI : 10.1006/jcss.2000.1727

R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity?, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.512-530, 2001.
DOI : 10.1109/SFCS.1998.743516

URL : http://doi.org/10.1006/jcss.2001.1774

D. Lokshtanov, D. Marx, and S. Saurabh, Lower bounds based on the Exponential Time Hypothesis, Bulletin of the EATCS, vol.105, pp.41-72, 2011.

M. Morandini, NP-complete problem: partition into triangles, 2004.

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, B. Darties, R. Giroudeau, and J. König, Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor, Journal of Scheduling, vol.115, issue.2, pp.501-509, 2011.
DOI : 10.1007/s10951-010-0193-x

URL : https://hal.archives-ouvertes.fr/lirmm-00355050

G. Simonin, R. Giroudeau, and J. König, Approximating a coupled-task scheduling problem in the presence of compatibility graph and additional tasks, International Journal of Planning and Scheduling, vol.1, issue.4, pp.285-300, 2013.
DOI : 10.1504/IJPS.2013.059680

URL : https://hal.archives-ouvertes.fr/lirmm-00952599

G. Simonin, R. Giroudeau, J. König, and . Darties, Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph, Algorithmic in Operations Research, vol.7, issue.1, pp.1-12, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00715828

G. J. Woeginger, Exact Algorithms for NP-Hard Problems: A Survey, Combinatorial Optimization, pp.185-208, 2001.
DOI : 10.1007/3-540-36478-1_17

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=