Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem.

This paper addresses a scheduling problem involving a continuously-divisible cumulative resource with limited capacity. During its processing, each task requests a part of this resource, which lies between a minimum and a maximum requirement. A task is finished when a certain amount of energy is received by it within its time window. This energy is received via the resource and an amount of resource is converted into an amount of energy with an increasing and pseudo-linear efficiency function. The goal is to minimize the resource consumption. The paper focuses on an event-based mixed integer linear program, providing several valid inequalities, which are used to improve the performance of the model. Furthermore, we give a minimal description of the polytope of all feasible assignments to the on/off binary variable for a single activity along with a dedicated separation algorithm. Computational experiments are reported in order to show the effectiveness of the results.