 |
HAL-LIRMM - Open Archive |  |
Reports
Proof of NP-completeness for a scheduling problem with coupled-tasks and compatibility graph
Résumé : Preuve de NP-complétude d'un problème d'ordonnancement avec tâches-couplées et graphe de compatibilité.
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00262286
Contributor : Gilles Simonin Connect 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
Contributor : Gilles Simonin Connect 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