{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T10:39:30Z","timestamp":1783593570360,"version":"3.55.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T00:00:00Z","timestamp":1282867200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s10601-010-9103-2","type":"journal-article","created":{"date-parts":[[2010,8,26]],"date-time":"2010-08-26T06:07:39Z","timestamp":1282802859000},"page":"250-282","source":"Crossref","is-referenced-by-count":70,"title":["Explaining the cumulative propagator"],"prefix":"10.1007","volume":"16","author":[{"given":"Andreas","family":"Schutt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thibaut","family":"Feydy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark G.","family":"Wallace","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,8,27]]},"reference":[{"issue":"7","key":"9103_CR1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A Aggoun","year":"1993","unstructured":"Aggoun, A., & Beldiceanu, N. (1993). Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling, 17(7), 57\u201373.","journal-title":"Mathematical and Computer Modelling"},{"issue":"1\u20132","key":"9103_CR2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1023\/A:1009822502231","volume":"5","author":"P Baptiste","year":"2000","unstructured":"Baptiste, P., & Le Pape, C. (2000). Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints, 5(1\u20132), 119\u2013139.","journal-title":"Constraints"},{"key":"9103_CR3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz, J., Lenstraand, J. K., & Rinnooy Kan, A. H. G. (1983). Scheduling subject to resource constraints: Classification and complexity. Discrete Applied Mathematics, 5, 11\u201324.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"9103_CR4","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.dam.2003.09.009","volume":"145","author":"J Carlier","year":"2004","unstructured":"Carlier, J., & Pinson, E. (2004). Jackson\u2019s pseudo-preemptive schedule and cumulative scheduling problems. Discrete Applied Mathematics, 145(1), 80\u201394. doi: 10.1016\/j.dam.2003.09.009 .","journal-title":"Discrete Applied Mathematics"},{"key":"9103_CR5","unstructured":"Caseau, Y., & Laburthe, F. (1996). Cumulative scheduling with task intervals. In Procs. of the 1996 Joint International Conference and Symposium on Logic Programming (pp. 363\u2013377). MIT. citeseer.ist.psu.edu\/caseau94cumulative.html ."},{"issue":"4","key":"9103_CR6","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s10626-009-0081-8","volume":"19","author":"K Claessen","year":"2009","unstructured":"Claessen, K., Een, N., Sheeran, M., S\u00f6rensson, N., Voronov, A., & \u00c5kesson, K. (2009). Sat-solving in practice, with a tutorial example from supervisory control. Discrete Event Dynamic Systems, 19(4), 495\u2013524. doi: 10.1007\/s10626-009-0081-8 .","journal-title":"Discrete Event Dynamic Systems"},{"issue":"7","key":"9103_CR7","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis, M., Logemman, G., & Loveland, D. (1962). A machine program for theorem proving. Communications of the ACM, 5(7), 394\u2013397.","journal-title":"Communications of the ACM"},{"key":"9103_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49, 61\u201395.","journal-title":"Artificial Intelligence"},{"issue":"11","key":"9103_CR9","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1287\/mnsc.43.11.1485","volume":"43","author":"EL Demeulemeester","year":"1997","unstructured":"Demeulemeester, E. L., & Herroelen, W. S. (1997). New benchmark results for the resource-constrained project scheduling problem. Management Science, 43(11), 1485\u20131492.","journal-title":"Management Science"},{"key":"9103_CR10","first-page":"502","volume-title":"Proceedings of SAT 2003, LNCS (Vol. 2919)","author":"N E\u00e9n","year":"2003","unstructured":"E\u00e9n, N., & S\u00f6rensson, N. (2003). An extensible SAT-solver. In E. Giunchiglia & A. Tacchella (Eds.), Proceedings of SAT 2003, LNCS (Vol. 2919, pp. 502\u2013518). Heidelberg: Springer."},{"key":"9103_CR11","unstructured":"El-Kholy, A. O. (1996). Resource feasibility in planning. Ph.D. thesis, Imperial College, University of London."},{"key":"9103_CR12","first-page":"115","volume-title":"2nd International Workshop on Project Management and Scheduling","author":"J Erschler","year":"1990","unstructured":"Erschler, J., & Lopez, P. (1990). Energy-based approach for task scheduling under time and resources constraints. In 2nd International Workshop on Project Management and Scheduling (pp. 115\u2013121). France: Compi\u00e8gne."},{"key":"9103_CR13","doi-asserted-by":"crossref","unstructured":"Feydy, T., & Stuckey, P. J. (2009). Lazy clause generation reengineered. In I. Gent (Ed.), Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, LNCS (Vol. 5732, pp. 352\u2013366). Springer-Verlag. doi: 10.1007\/978-3-642-04244-7_29 .","DOI":"10.1007\/978-3-642-04244-7_29"},{"issue":"2","key":"9103_CR14","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/S0377-2217(99)00485-3","volume":"127","author":"S Hartmann","year":"2000","unstructured":"Hartmann, S., & Kolisch, R. (2000). Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. European Journal of Operational Research, 127(2), 394\u2013407. doi: 10.1016\/S0377-2217(99)00485-3 .","journal-title":"European Journal of Operational Research"},{"key":"9103_CR15","unstructured":"Jussien, N. (2003). The versatility of using explanations within constraint programming. Research Report 03-04-INFO, \u00c9cole des Mines de Nantes, Nantes, France. http:\/\/www.emn.fr\/jussien\/publications\/jussien-RR0304.pdf ."},{"key":"9103_CR16","unstructured":"Jussien, N., & Barichard, V. (2000). The PaLM system: Explanation-based constraint programming. In Proceedings of Techniques foR Implementing Constraint Programming Systems (TRICS 2000) (pp. 118\u2013133). http:\/\/www.emn.fr\/jussien\/publications\/jussien-WCP00.pdf ."},{"issue":"1","key":"9103_CR17","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0004-3702(02)00221-7","volume":"139","author":"N Jussien","year":"2002","unstructured":"Jussien, N., & Lhomme, O. (2002). Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence, 139(1), 21\u201345.","journal-title":"Artificial Intelligence"},{"key":"9103_CR18","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/3-540-45349-0_19","volume-title":"Principles and Practice of Constraint Programming\u2014CP 2000, no. 1894 in Lecture Notes in Computer Science","author":"N Jussien","year":"2000","unstructured":"Jussien, N., Debruyne, R., & Boizumault, P. (2000). Maintaining arc-consistency within dynamic backtracking. In Principles and Practice of Constraint Programming\u2014CP 2000, no. 1894 in Lecture Notes in Computer Science (pp. 249\u2013261). Singapore: Springer-Verlag."},{"key":"9103_CR19","unstructured":"Katsirelos, G., & Bacchus, F. (2005). Generalized nogoods in csps. In M. M. Veloso & S. Kambhampati (Eds.), National Conference on Artificial Intelligence (pp. 390\u2013396). AAAI Press\/The MIT."},{"issue":"2","key":"9103_CR20","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","volume":"90","author":"R Kolisch","year":"1996","unstructured":"Kolisch, R. (1996). Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research, 90(2), 320\u2013333. doi: 10.1016\/0377-2217(95)00357-6 .","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"9103_CR21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","volume":"174","author":"R Kolisch","year":"2006","unstructured":"Kolisch, R., & Hartmann, S. (2006). Experimental investigation of heuristics for resource-constrained project scheduling: An update. European Journal of Operational Research, 174(1), 23\u201337. doi: 10.1016\/j.ejor.2005.01.065 .","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"9103_CR22","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., & Sprecher, A. (1997). PSPLIB\u2014A project scheduling problem library. European Journal of Operational Research, 96(1), 205\u2013216. doi: 10.1016\/S0377-2217(96)00170-1 .","journal-title":"European Journal of Operational Research"},{"key":"9103_CR23","unstructured":"Laborie, P. (2005). Complete MCS-based search: Application to resource constrained project scheduling. In L. P. Kaelbling & A. Saffiotti (Eds.), Proceedings IJCAI 2005 (pp. 181\u2013186). Professional Book Center. http:\/\/ijcai.org\/papers\/0571.pdf ."},{"issue":"2","key":"9103_CR24","first-page":"209","volume":"294","author":"A Lahrichi","year":"1982","unstructured":"Lahrichi, A. (1982). Scheduling: The notions of hump, compulsory parts and their use in cumulative problems. Comptes Rendus de l\u2019Acad\u00e9mie des Sciences. Paris, S\u00e9rie 1, Math\u00e9matique, 294(2), 209\u2013211.","journal-title":"Comptes Rendus de l\u2019Acad\u00e9mie des Sciences. Paris, S\u00e9rie 1, Math\u00e9matique"},{"issue":"1","key":"9103_CR25","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10479-007-0188-y","volume":"157","author":"O Liess","year":"2008","unstructured":"Liess, O., & Michelon, P. (2008). A constraint programming approach for the resource-constrained project scheduling problem. Annals of Operations Research, 157(1), 25\u201336. doi: 10.1007\/s10479-007-0188-y .","journal-title":"Annals of Operations Research"},{"issue":"3","key":"9103_CR26","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10601-008-9041-4","volume":"13","author":"K Marriott","year":"2008","unstructured":"Marriott, K., Nethercote, N., Rafeh, R., Stuckey, P. J., Garcia de la Banda, M., & Wallace, M. G. (2008). The design of the Zinc modelling language. Constraints, 13(3), 229\u2013267. doi: 10.1007\/s10601-008-9041-4 .","journal-title":"Constraints"},{"issue":"1","key":"9103_CR27","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1287\/ijoc.1070.0226","volume":"20","author":"L Mercier","year":"2008","unstructured":"Mercier, L., & Van Hentenryck, P. (2008). Edge finding for cumulative scheduling. INFORMS Journal on Computing, 20(1), 143\u2013153. doi: 10.1287\/ijoc.1070.0226 .","journal-title":"INFORMS Journal on Computing"},{"key":"9103_CR28","first-page":"530","volume-title":"Design automation conference","author":"MW Moskewicz","year":"2001","unstructured":"Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: Engineering an efficient SAT solver. In Design automation conference (pp. 530\u2013535). New York: ACM. doi: 10.1145\/378239.379017 ."},{"key":"9103_CR29","unstructured":"Nuijten, W. P. M. (1994). Time and resource constrained scheduling. Ph.D. thesis, Eindhoven University of Technology."},{"issue":"3","key":"9103_CR30","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P., & Codish, M. (2009). Propagation via lazy clause generation. Constraints, 14(3), 357\u2013391.","journal-title":"Constraints"},{"key":"9103_CR31","doi-asserted-by":"crossref","unstructured":"Ohrimenko, O., Stuckey, P. J., & Codish, M. (2007). Propagation = lazy clause generation. In Procs. of the CP2007, LNCS (Vol. 4741, pp. 544\u2013558). Springer-Verlag. doi: 10.1007\/978-3-540-74970-7_39 .","DOI":"10.1007\/978-3-540-74970-7_39"},{"key":"9103_CR32","unstructured":"PSPLib\u2014project scheduling problem library (2009). http:\/\/129.187.106.231\/psplib\/ . Accessed 23 April 2009."},{"issue":"1","key":"9103_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1452044.1452046","volume":"31","author":"C Schulte","year":"2008","unstructured":"Schulte, C., & Stuckey, P. (2008). Efficient constraint propagation engines. ACM Transactions on Programming Languages and Systems, 31(1), 1\u201343.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"9103_CR34","unstructured":"Schutt, A. (2006). Entwicklung suchraumeinschr\u00e4nkender Verfahren zur Constraint-basierten L\u00f6sung kumulativer Ressourcenplanungsprobleme. Master\u2019s thesis, Humboldt-Universit\u00e4t zu Berlin."},{"key":"9103_CR35","doi-asserted-by":"crossref","unstructured":"Schutt, A., Feydy, T., Stuckey, P. J., & Wallace, M. G. (2009). Why cumulative decomposition is not as bad as it sounds. In I.\u00a0Gent (Ed.), Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, LNCS (Vol. 5732, pp. 746\u2013761). Springer-Verlag.","DOI":"10.1007\/978-3-642-04244-7_58"},{"key":"9103_CR36","unstructured":"Schutt, A., Wolf, A., & Schrader, G. (2006). Not-first and not-last detection for cumulative scheduling in ${\\cal O}(n^3\\log n)$ . In Declarative programming for knowledge management, Lecture Notes in Computer Science (Vol. 4369, pp. 66\u201380). Springer-Verlag. doi: 10.1007\/11963578 . INAP 2005\u201416th international conference on applications of declarative programming and knowledge management."},{"key":"9103_CR37","unstructured":"Vil\u00edm, P. (2005). Computing explanations for the unary resource constraint. In Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization problems, LNCS (Vol. 3524, pp. 396\u2013409). Springer-Verlag. doi: 10.1007\/11493853_29 . http:\/\/kti.ms.mff.cuni.cz\/~vilim\/cpaior2005.pdf ."},{"key":"9103_CR38","doi-asserted-by":"crossref","unstructured":"Vil\u00edm, P. (2009). Edge finding filtering algorithm for discrete cumulative resources in ${\\mathcal O}(kn\\log n)$ . In Principles and Practice of Constraint Programming\u2014CP 2009, LNCS (Vol. 5732, pp. 802\u2013816). Springer-Verlag. doi: 10.1007\/978-3-642-04244-7_62 .","DOI":"10.1007\/978-3-642-04244-7_62"},{"key":"9103_CR39","unstructured":"Wolf, A., & Schrader, G. (2006). ${\\mathcal O}(n\\log n)$ overload checking for the cumulative constraint and its application. In Declarative programming for knowledge management, Lecture Notes in Computer Science (Vol. 4369, pp. 88\u2013101). Springer-Verlag. doi: 10.1007\/11963578_8 . INAP 2005\u201416th international conference on applications of declarative programming and knowledge management."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-010-9103-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-010-9103-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-010-9103-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T08:31:41Z","timestamp":1559464301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-010-9103-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,27]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9103"],"URL":"https:\/\/doi.org\/10.1007\/s10601-010-9103-2","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,27]]}}}