Explanations for the Cumulative Constraint: An Experimental Study
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.
KeywordsSchedule Problem Project Schedule Project Schedule Problem Check System Explanation Algorithm
Unable to display preview. Download preview PDF.
- 4.Artigues, C., Demassey, S., Neron, E.: Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications. ISTE (2007)Google Scholar
- 5.Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based scheduling: applying constraint programming to scheduling problems. In: International Series in Operations Research & Management Science, vol. 39. Kluwer Academic Publishers, Boston (2001)Google Scholar
- 12.PSPLib: Project Scheduling Problem LIBrary, http://188.8.131.52/psplib/ (last accessed 2011)
- 13.Schutt, A., Feydy, T., Stuckey, P., Wallace, M.: Explaining the cumulative propagator. Constraints, 1–33 (2010)Google Scholar