A polynomial algorithm for a bi-criteria cyclic scheduling problem. - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-01336895 , version 1 (24-06-2016)

Identifiants

  • HAL Id : hal-01336895 , version 1

Citer

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⟩
44 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More