{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T01:12:23Z","timestamp":1790644343092,"version":"4.1.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319449524","type":"print"},{"value":"9783319449531","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_28","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T11:12:23Z","timestamp":1471864343000},"page":"438-454","source":"Crossref","is-referenced-by-count":5,"title":["Explaining Producer\/Consumer Constraints"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Schutt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-642-40627-0_10","volume-title":"Principles and Practice of Constraint Programming","author":"I Ab\u00edo","year":"2013","unstructured":"Ab\u00edo, I., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E., Stuckey, P.J.: To encode or to propagate? The best choice for each constraint in SAT. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 97\u2013106. Springer, Heidelberg (2013)"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/978-3-642-33558-7_8","volume-title":"Principles and Practice of Constraint Programming","author":"I Ab\u00edo","year":"2012","unstructured":"Ab\u00edo, I., Stuckey, P.J.: Conflict directed lazy decomposition. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 70\u201385. Springer, Heidelberg (2012)"},{"key":"28_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S1571-0653(05)80101-5","volume":"4","author":"R Bart\u00e1k","year":"2000","unstructured":"Bart\u00e1k, R.: Conceptual models for combined planning and scheduling. Electron. Notes Discr. Math. 4, 1 (2000)","journal-title":"Electron. Notes Discr. Math."},{"issue":"1","key":"28_CR4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/jos.91","volume":"5","author":"JC Beck","year":"2002","unstructured":"Beck, J.C.: Heuristics for scheduling with inventory: dynamic focus via constraint criticality. J. Sched. 5(1), 43\u201369 (2002)","journal-title":"J. Sched."},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/3-540-46135-3_5","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"N Beldiceanu","year":"2002","unstructured":"Beldiceanu, N., Carlsson, M.: A new multi-resource cumulatives constraint with negative heights. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 63\u201379. Springer, Heidelberg (2002)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.E., M\u00f6hring, R.H., Schulz, J.: A constraint integer programming approach for resource-constrained project scheduling. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 313\u2013317. Springer, Heidelberg (2010)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/11814948_19","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"S Cotton","year":"2006","unstructured":"Cotton, S., Maler, O.: Fast and flexible difference constraint propagation for DPLL(T). In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 170\u2013183. Springer, Heidelberg (2006)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Feydy, T., Schutt, A., Stuckey, P.J.: Global difference constraint propagation for finite domain solvers. In: Antoy, S. (ed.) Proceedings of 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, pp. 226\u2013235. ACM Press (2008)","DOI":"10.1145\/1389449.1389478"},{"issue":"1","key":"28_CR9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10479-010-0693-2","volume":"181","author":"A Horbach","year":"2010","unstructured":"Horbach, A.: A boolean satisfiability approach to the resource-constrained project scheduling problem. Ann. Oper. Res. 181(1), 89\u2013107 (2010)","journal-title":"Ann. Oper. Res."},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-319-33954-2_16","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"J Kinable","year":"2016","unstructured":"Kinable, J.: A reservoir balancing constraint with applications to bike-sharing. In: Quimper, C.-G., Cavallo, M. (eds.) CPAIOR 2016. LNCS, vol. 9676, pp. 216\u2013228. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-33954-2_16"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/978-3-319-23219-5_19","volume-title":"Principles and Practice of Constraint Programming","author":"S Kreter","year":"2015","unstructured":"Kreter, S., Schutt, A., Stuckey, P.J.: Modeling and solving project scheduling with calendars. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 262\u2013278. Springer, Heidelberg (2015)"},{"issue":"2","key":"28_CR12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0004-3702(02)00362-4","volume":"143","author":"P Laborie","year":"2003","unstructured":"Laborie, P.: Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results. Artif. Intell. 143(2), 151\u2013188 (2003)","journal-title":"Artif. Intell."},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.R.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007)"},{"key":"28_CR14","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/978-1-4615-5533-9_12","volume-title":"Project Scheduling: Recent Models, Algorithms and Applications","author":"K Neumann","year":"1999","unstructured":"Neumann, K., Zimmermann, J.: Methods for resource-constrained project scheduling with regular and nonregular objective functions and schedule-dependent time windows. In: W\u0229glarz, J. (ed.) Project Scheduling: Recent Models, Algorithms and Applications, vol. 14, pp. 261\u2013287. Springer, New York (1999)"},{"issue":"3","key":"28_CR15","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s001860200251","volume":"56","author":"K Neumann","year":"2002","unstructured":"Neumann, K., Schwindt, C.: Project scheduling with inventory constraints. Math. Methods Oper. Res. 56(3), 513\u2013533 (2002)","journal-title":"Math. Methods Oper. Res."},{"issue":"3","key":"28_CR16","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.J., Codish, M.: Propagation via lazy clause generation. Constraints 14(3), 357\u2013391 (2009)","journal-title":"Constraints"},{"issue":"2","key":"28_CR17","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s00291-015-0419-6","volume":"38","author":"A Schnell","year":"2015","unstructured":"Schnell, A., Hartl, R.F.: On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations. OR Spectr. 38(2), 283\u2013303 (2015)","journal-title":"OR Spectr."},{"issue":"1","key":"28_CR18","doi-asserted-by":"crossref","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 Trans.Program. Lang. Syst. 31(1), 2 (2008)","journal-title":"ACM Trans.Program. Lang. Syst."},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/978-3-642-29828-8_24","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"A Schutt","year":"2012","unstructured":"Schutt, A., Chu, G., Stuckey, P.J., Wallace, M.G.: Maximising the net present value for resource-constrained project scheduling. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 362\u2013378. Springer, Heidelberg (2012)"},{"issue":"3","key":"28_CR20","doi-asserted-by":"crossref","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 16(3), 250\u2013282 (2011)","journal-title":"Constraints"},{"issue":"3","key":"28_CR21","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10951-012-0285-x","volume":"16","author":"A Schutt","year":"2013","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Solving RCPSP\/max by lazy clause generation. J. Sched. 16(3), 273\u2013289 (2013)","journal-title":"J. Sched."},{"key":"28_CR22","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/3-540-60299-2_27","volume-title":"Principles and Practice of Constraint Programming - CP \u201995","author":"H Simonis","year":"1995","unstructured":"Simonis, H., Cornelissens, T.: Modelling producer\/consumer constraints. In: Montanari, U., Rossi, F. (eds.) Principles and Practice of Constraint Programming - CP \u201995. LNCS, vol. 976, pp. 449\u2013462. Springer, Heidelberg (1995)"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/978-3-319-44953-1_31","volume-title":"Principles and Practice of Constraint Programming","author":"R Szeredi","year":"2016","unstructured":"Szeredi, R., Schutt, A.: Modelling and solving multi-mode resource-constrained project scheduling. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9832, pp. 483\u2013492. Springer, Heidelberg (2016)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44953-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:07:52Z","timestamp":1498324072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}