https://hal-lirmm.ccsd.cnrs.fr/lirmm-00262286 Contributor : Gilles SimoninConnect in order to contact the contributor Submitted on : Tuesday, March 11, 2008 - 12:17:20 PM Last modification on : Friday, August 5, 2022 - 10:45:47 AM Long-term archiving on: : Friday, May 21, 2010 - 12:09:32 AM
Gilles Simonin. Proof of NP-completeness for a scheduling problem with coupled-tasks and compatibility graph. [Research Report] RR-08007, LIRMM. 2008. ⟨lirmm-00262286⟩