A polynomial satisfiability test using energetic reasoning for energy-constraint scheduling - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

A polynomial satisfiability test using energetic reasoning for energy-constraint scheduling

Résumé

In this paper, a scheduling problem with continuous resource and energy constraints is addressed. Given a limited resource capacity and a set of tasks, the objective is to find a schedule such that each task is processed in its time window and uses a quantity of the resource between a minimum and a maximum value. In addition, each task requires an energy demand; this energy follows a function of the amount of resources allotted. For the cumulative scheduling problem a polynomial satisfiability test exists. Here, we adapt this test to the case of linear and piecewise linear functions.
Fichier principal
Vignette du fichier
NATTAF_PMS2014.pdf (138.44 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00978706 , version 1 (14-04-2014)

Identifiants

  • HAL Id : hal-00978706 , version 1

Citer

Margaux Nattaf, Christian Artigues, Pierre Lopez. A polynomial satisfiability test using energetic reasoning for energy-constraint scheduling. International Conference on Project Management and Scheduling (PMS 2014), Mar 2014, Munich, Germany. pp.169-172. ⟨hal-00978706⟩
161 Consultations
1580 Téléchargements

Partager

Gmail Facebook X LinkedIn More