Upper and lower bounds for an energy scheduling problem with piecewise-linear costs and storage resources - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

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.
No file

Dates and versions

hal-02476508 , version 1 (12-02-2020)

Identifiers

  • HAL Id : hal-02476508 , version 1

Cite

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⟩
71 View
0 Download

Share

Gmail Facebook X LinkedIn More