{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T11:52:05Z","timestamp":1773143525370,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642381706","type":"print"},{"value":"9783642381713","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38171-3_16","type":"book-chapter","created":{"date-parts":[[2013,4,11]],"date-time":"2013-04-11T01:30:36Z","timestamp":1365643836000},"page":"234-250","source":"Crossref","is-referenced-by-count":22,"title":["Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Schutt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thibaut","family":"Feydy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T. Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Mathematical Programming Computation\u00a01, 1\u201341 (2009)","journal-title":"Mathematical Programming Computation"},{"issue":"7","key":"16_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A. Aggoun","year":"1993","unstructured":"Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling\u00a017(7), 57\u201373 (1993)","journal-title":"Mathematical and Computer Modelling"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Alvarez-Vald\u00e9s, R., Tamarit, J.M.: Heuristic algorithms for resource-constrained project scheduling: A review and an empirical analysis. In: Advances in Project Scheduling, pp. 113\u2013134. Elsevier (1989)","DOI":"10.1016\/B978-0-444-87358-3.50009-2"},{"issue":"1-2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1009822502231","volume":"5","author":"P. Baptiste","year":"2000","unstructured":"Baptiste, P., Le Pape, C.: Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints\u00a05(1-2), 119\u2013139 (2000)","journal-title":"Constraints"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1023\/A:1018995000688","volume":"92","author":"P. Baptiste","year":"1999","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Annals of Operations Research\u00a092, 305\u2013333 (1999)","journal-title":"Annals of Operations Research"},{"key":"16_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-Based Scheduling","author":"P. Baptiste","year":"2001","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-Based Scheduling. Kluwer Academic Publishers, Norwell (2001)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-13520-0_34","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"T. Berthold","year":"2010","unstructured":"Berthold, T., Heinz, S., L\u00fcbbecke, M., M\u00f6hring, R., Schulz, J.: A constraint integer programming approach for resource-constrained project scheduling. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol.\u00a06140, pp. 313\u2013317. Springer, Heidelberg (2010)"},{"issue":"2","key":"16_CR8","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/S0377-2217(02)00763-4","volume":"149","author":"J. Carlier","year":"2003","unstructured":"Carlier, J., N\u00e9ron, E.: On linear lower bounds for the resource constrained project scheduling problem. European Journal of Operational Research\u00a0149(2), 314\u2013324 (2003)","journal-title":"European Journal of Operational Research"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-23786-7_23","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"T. Feydy","year":"2011","unstructured":"Feydy, T., Somogyi, Z., Stuckey, P.J.: Half reification and flattening. In: Lee, J. (ed.) CP 2011. LNCS, vol.\u00a06876, pp. 286\u2013301. Springer, Heidelberg (2011)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Feydy, T., Stuckey, P.J.: Lazy clause generation reengineered. In: Gent (ed.) [11], pp. 352\u2013366","DOI":"10.1007\/978-3-642-04244-7_29"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming - CP 2009","year":"2009","unstructured":"Gent, I.P. (ed.): CP 2009. LNCS, vol.\u00a05732. Springer, Heidelberg (2009)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-642-20662-7_34","volume-title":"Experimental Algorithms","author":"S. Heinz","year":"2011","unstructured":"Heinz, S., Schulz, J.: Explanations for the cumulative constraint: An experimental study. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 400\u2013409. Springer, Heidelberg (2011)"},{"key":"16_CR13","unstructured":"Jussien, N.: The versatility of using explanations within constraint programming. Research Report 03-04-INFO, \u00c9cole des Mines de Nantes, Nantes, France (2003)"},{"key":"16_CR14","unstructured":"Jussien, N., Barichard, V.: The PaLM system: explanation-based constraint programming. In: Proceedings of TRICS: Techniques foR Implementing Constraint Programming Systems, a Post-conference Workshop of CP 2000, Singapore, pp. 118\u2013133 (2000)"},{"key":"16_CR15","unstructured":"Katsirelos, G., Bacchus, F.: Generalized nogoods in CSPs. In: Veloso, M.M., Kambhampati, S. (eds.) Proceedings on Artificial Intelligence \u2013 AAAI 2005, pp. 390\u2013396. AAAI Press\/The MIT Press (2005)"},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R. Kolisch","year":"1997","unstructured":"Kolisch, R., Sprecher, A.: PSPLIB \u2013 A project scheduling problem library. European Journal of Operational Research\u00a096(1), 205\u2013216 (1997)","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"16_CR17","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","volume":"41","author":"R. Kolisch","year":"1995","unstructured":"Kolisch, R., Sprecher, A., Drexl, A.: Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science\u00a041(10), 1693\u20131703 (1995)","journal-title":"Management Science"},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.cor.2009.12.011","volume":"38","author":"O. Kon\u00e9","year":"2011","unstructured":"Kon\u00e9, O., Artigues, C., Lopez, P., Mongeau, M.: Event-based MILP models for resource-constrained project scheduling problems. Computers & Operations Research\u00a038(1), 3\u201313 (2011)","journal-title":"Computers & Operations Research"},{"issue":"1","key":"16_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10479-007-0188-y","volume":"157","author":"O. Liess","year":"2008","unstructured":"Liess, O., Michelon, P.: A constraint programming approach for the resource-constrained project scheduling problem. Annals of Operations Research\u00a0157(1), 25\u201336 (2008)","journal-title":"Annals of Operations Research"},{"key":"16_CR20","first-page":"530","volume-title":"Proceedings of Design Automation Conference \u2013 DAC 2001","author":"M.W. Moskewicz","year":"2001","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of Design Automation Conference \u2013 DAC 2001, pp. 530\u2013535. ACM, New York (2001)"},{"key":"16_CR21","unstructured":"Nuijten, W.P.M.: Time and Resource Constrained Scheduling. Ph.D. thesis. Eindhoven University of Technology (1994)"},{"issue":"3","key":"16_CR22","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O. Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation via lazy clause generation. Constraints\u00a014(3), 357\u2013391 (2009)","journal-title":"Constraints"},{"issue":"1","key":"16_CR23","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1452044.1452046","volume":"31","author":"C. Schulte","year":"2008","unstructured":"Schulte, C., Stuckey, P.J.: Efficient constraint propagation engines. ACM Transactions on Programming Languages and Systems 31(1), Article No. 2 (2008)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"16_CR24","unstructured":"Schutt, A.: Improving Scheduling by Learning. Ph.D. thesis, The University of Melbourne (2011), \n                    http:\/\/repository.unimelb.edu.au\/10187\/11060"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Why cumulative decomposition is not as bad as it sounds. In: Gent (ed.) [11], pp. 746\u2013761","DOI":"10.1007\/978-3-642-04244-7_58"},{"issue":"3","key":"16_CR26","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/s10601-010-9103-2","volume":"16","author":"A. Schutt","year":"2011","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Explaining the cumulative propagator. Constraints\u00a016(3), 250\u2013282 (2011)","journal-title":"Constraints"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Solving RCPSP\/max by lazy clause generation. Journal of Scheduling, 1\u201317 (2012), online first","DOI":"10.1007\/s10951-012-0285-x"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-23786-7_8","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"A. Schutt","year":"2011","unstructured":"Schutt, A., Stuckey, P., Verden, A.: Optimal carpet cutting. In: Lee, J. (ed.) CP 2011. LNCS, vol.\u00a06876, pp. 69\u201384. Springer, Heidelberg (2011)"},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-15396-9_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"A. Schutt","year":"2010","unstructured":"Schutt, A., Wolf, A.: A new ${\\mathcal O}(n^2\\log n)$ not-first\/not-last pruning algorithm for cumulative resource constraints. In: Cohen, D. (ed.) CP 2010. LNCS, vol.\u00a06308, pp. 445\u2013459. Springer, Heidelberg (2010)"},{"issue":"1-3","key":"16_CR30","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"29","author":"Z. Somogyi","year":"1996","unstructured":"Somogyi, Z., Henderson, F., Conway, T.: The execution algorithm of Mercury, an efficient purely declarative logic programming language. The Journal of Logic Programming\u00a029(1-3), 17\u201364 (1996)","journal-title":"The Journal of Logic Programming"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/11562931_3","volume-title":"Logic Programming","author":"P.J. Stuckey","year":"2005","unstructured":"Stuckey, P.J., de la Banda, M.G., Maher, M.J., Marriott, K., Slaney, J.K., Somogyi, Z., Wallace, M., Walsh, T.: The G12 project: Mapping solver independent models to efficient solutions. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 9\u201313. Springer, Heidelberg (2005)"},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/11493853_29","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P. Vil\u00edm","year":"2005","unstructured":"Vil\u00edm, P.: Computing explanations for the unary resource constraint. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 396\u2013409. Springer, Heidelberg (2005)"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Vil\u00edm, P.: Edge finding filtering algorithm for discrete cumulative resources in ${\\mathcal O}(kn\\log n)$. In: Gent (ed.) [11], pp. 802\u2013816","DOI":"10.1007\/978-3-642-04244-7_62"},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-21311-3_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P. Vil\u00edm","year":"2011","unstructured":"Vil\u00edm, P.: Timetable edge finding filtering algorithm for discrete cumulative resources. In: Achterberg, T., Beck, J.C. (eds.) CPAIOR 2011. LNCS, vol.\u00a06697, pp. 230\u2013245. Springer, Heidelberg (2011)"},{"key":"16_CR35","unstructured":"Walsh, T.: Search in a small world. In: Proceedings of Artificial intelligence \u2013 IJCAI 1999, pp. 1172\u20131177. Morgan Kaufmann (1999)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38171-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T05:03:15Z","timestamp":1609477395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38171-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642381706","9783642381713"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38171-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}