A polynomial algorithm for a bi-criteria cyclic scheduling problem.

Abstract : The minimization of the amount of initial tokens in a Weighted Timed Event Graph (in short WTEG) under throughput constraint is a crucial problem in industrial area such as the design of manufacturing systems or embedded systems. In this paper, an efficient polynomial algorithm is developed for the minimization of the overall places capacities with a maximum throughput. It is proved optimal for a particular sub-classes of WTEG and is leading to a 2-approximation solution in the general case.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01336895
Contributor : Lip6 Publications <>
Submitted on : Friday, June 24, 2016 - 10:37:56 AM
Last modification on : Thursday, March 21, 2019 - 1:07:30 PM

Identifiers

  • HAL Id : hal-01336895, version 1

Citation

Olivier Marchetti, Alix Munier-Kordon. A polynomial algorithm for a bi-criteria cyclic scheduling problem.. PlanSIG UK PLANNING AND SCHEDULING Special Interest Group, Dec 2006, Nottingham, United Kingdom. pp.88-96. ⟨hal-01336895⟩

Share

Metrics

Record views

57