Proof of NP-completeness for a scheduling problem with coupled-tasks and compatibility graph
Abstract
Preuve de NP-complétude d'un problème d'ordonnancement avec tâches-couplées et graphe de compatibilité.
Reports
(Research Report)
Year : 2008
Gilles Simonin : Connect in order to contact the contributor
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00262286
Submitted on : Tuesday, March 11, 2008-12:17:20 PM
Last modification on : Friday, March 24, 2023-2:52:50 PM
Long-term archiving on : Friday, May 21, 2010-12:09:32 AM
Dates and versions
Identifiers
- HAL Id : lirmm-00262286 , version 1
Cite
Gilles Simonin. Proof of NP-completeness for a scheduling problem with coupled-tasks and compatibility graph. [Research Report] RR-08007, LIRMM. 2008. ⟨lirmm-00262286⟩
114
View
92
Download