Upper and lower bounds for an energy scheduling problem with piecewise-linear costs and storage resources

Nabil Absi (1) , Christian Artigues (2) , Safia Kedad-Sidhoum (3) , Sandra Ulrich Ngueveu (4, 2) , Félix Goupil (2)

1 SFL-ENSMSE - Département Sciences de la Fabrication et Logistique
2 LAAS-ROC - Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes
3 CEDRIC - OC - CEDRIC. Optimisation Combinatoire
4 Toulouse INP - Institut National Polytechnique (Toulouse)

We address a scheduling and energy source assignment problem abstracted from several applications including data centers, smart buildings, hybrid vehicles and manufacturing. We present upper and lower bounding procedures based on different decomposition approaches. In this talk, the merits and drawbacks of the different approaches are analyzed.

Domaines: Informatique [cs]; Recherche opérationnelle [math.OC]

Nabil Absi, Christian Artigues, Safia Kedad-Sidhoum, Sandra Ulrich Ngueveu, Félix Goupil. Upper and lower bounds for an energy scheduling problem with piecewise-linear costs and storage resources. PGMO Days, Nov 2018, Paris, France. ⟨hal-02476508⟩