Complexity results for bi-criteria cyclic scheduling problems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Complexity results for bi-criteria cyclic scheduling problems

Résumé

The minimization of the amount of initial tokens in a Timed Event Graph (in short TEG) under throughput constraint is a crucial problem in industrial area such as the design of manufacturing systems or embedded systems. We show in this paper that this problem is strongly related to the K-colorability of a graph. Its NP-completeness and complexity results for other particular cyclic scheduling problems are then derived.
Fichier non déposé

Dates et versions

hal-01338488 , version 1 (28-06-2016)

Identifiants

  • HAL Id : hal-01338488 , version 1

Citer

Olivier Marchetti, Alix Munier-Kordon. Complexity results for bi-criteria cyclic scheduling problems. RenPar Rencontres Francophones du Parallélisme, Oct 2006, Perpignan, France. pp.17-24. ⟨hal-01338488⟩
20 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More