Complexity results for bi-criteria cyclic scheduling problems

Abstract : 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.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01338488
Contributor : Lip6 Publications <>
Submitted on : Tuesday, June 28, 2016 - 4:23:53 PM
Last modification on : Thursday, March 21, 2019 - 2:16:20 PM

Identifiers

  • HAL Id : hal-01338488, version 1

Citation

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⟩

Share

Metrics

Record views

46