TY - GEN A1 - Tesch, Alexander T1 - Exact Energetic Reasoning in O(n^2 log^2 n) N2 - In this paper, we address the Energetic Reasoning propagation rule for the Cumulative Scheduling Problem (CuSP). An energetic reasoning propagation algorithm is called exact, if it computes the maximum possible energetic reasoning propagation for all the jobs. The currently best known exact energetic reasoning algorithm has complexity O(n^3). In this paper, we present a new exact energetic reasoning propagation algorithm with improved complexity of O(n^2 \log^2 n). T3 - ZIB-Report - 16-46 KW - Cumulative Scheduling KW - Energetic Reasoning KW - Sweep Line KW - Constraint Programming Y1 - 2016 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/6036 UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-60367 SN - 1438-0064 N1 - Preprint Version ER -