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

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02476508
Contributor : Safia Kedad-Sidhoum <>
Submitted on : Wednesday, February 12, 2020 - 5:07:04 PM
Last modification on : Friday, February 14, 2020 - 1:27:54 AM

Identifiers

  • HAL Id : hal-02476508, version 1

Citation

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⟩

Share

Metrics

Record views

12