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.