On the complexity of coupled-task scheduling, Discrete Applied Mathematics, vol.72, issue.1-2, pp.141-154, 1997. ,
DOI : 10.1016/S0166-218X(96)00041-8
Scheduling coupled tasks, Naval Research Logistics Quarterly, vol.12, issue.3, pp.477-481, 1980. ,
DOI : 10.1002/nav.3800270312
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 note on the complexity of scheduling coupled tasks on a single processor, Journal of the Brazilian Computer Society, vol.7, issue.3, pp.23-26, 2001. ,
DOI : 10.1590/S0104-65002001000200004
An exact algorithm for scheduling identical coupled tasks, Mathematical Methods of Operations Research (ZOR), vol.59, issue.2, pp.193-203, 2004. ,
DOI : 10.1007/s001860300328
Computers and Intractability; A Guide to the Theory of NP- Completeness, 1990. ,
Extended matching problem for a coupled-tasks scheduling problem, 2009. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00375000