« A note on the complexity of scheduling coupledtasks on a single processor, Journal of the Brazilian Computer Society, vol.7, pp.3-3, 2001. ,

Matching and a Polyhedron with 0, 1 Vertices, Journal of Research of the National Bureau of Standards, vol.69, pp.125-130, 1965. ,

Computers and Intractability ; A Guide to the Theory of NP- Completeness, 1990. ,

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

On the complexity of coupled-task scheduling, On the Complexity of Coupled-Task Scheduling, pp.141-154, 1997. ,

DOI : 10.1016/S0166-218X(96)00041-8