TY - GEN A1 - Berthold, Timo A1 - Heinz, Stefan A1 - Schulz, Jens T1 - An approximative Criterion for the Potential of Energetic Reasoning N2 - Energetic reasoning is one of the most powerful propagation algorithms in cumulative scheduling. In practice, however, it is not commonly used because it has a high running time and its success highly depends on the tightness of the variable bounds. In order to speed up energetic reasoning, we provide an easy-to-check necessary condition for energetic reasoning to detect infeasibilities. We present an implementation of energetic reasoning that employs this condition and that can be parametrically adjusted to handle the trade-off between solving time and propagation overhead. Computational results on instances from the PSPLIB are provided. These results show that using this condition decreases the running time by more than a half, although more search nodes need to be explored. KW - constraint integer programming KW - resource-constrained project scheduling KW - energetic reasoning KW - conflict analysis KW - cumulative constraint Y1 - 2012 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/976 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-9765 ER -