Thumbnail Image

An Approximative Criterion for the Potential of Energetic Reasoning

Berthold, Timo; Heinz, Stefan; Schulz, Jens

Inst. Mathematik

Energetic reasoning is one of the most powerful propagation algorithms in cumulative scheduling. In practice, however, it is commonly not 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 a necessary condition to detect infeasibilities, which can be tested efficiently.