1266 eng reportzib 0 2011-04-18 2011-04-18 -- In cumulative scheduling, conflict analysis seems to be one of the key ingredients to solve such problems efficiently. Thereby, the computational complexity of explanation algorithms plays an important role. Even more when we are faced with a backtracking system where explanations need to be constructed on the fly. In this paper we present extensive computational results to analyze the impact of explanation algorithms for the cumulative constraint in a backward checking system. The considered explanation algorithms differ in their quality and computational complexity. We present results for the domain propagation algorithms time-tabling, edge-finding, and energetic reasoning. 11-13 urn:nbn:de:0297-zib-12668 Experimental Algorithms, Panos M. Pardalos und Steffen Rebennack (eds.) Springer 2011, LNCS 6630, pp. 400-409 Stefan Heinz Stefan Heinz Jens Schulz 11-13 uncontrolled conflict analysis uncontrolled constraint integer programming uncontrolled cumulative constraint uncontrolled resource-constrained project scheduling uncontrolled propagation algorithms Mathematical programming methods [See also 90Cxx] Mathematical Optimization Heinz, Stefan Applied Optimization https://opus4.kobv.de/opus4-zib/files/1266/ZR-11-13.pdf