{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T04:47:52Z","timestamp":1766551672565},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,1,17]],"date-time":"2017-01-17T00:00:00Z","timestamp":1484611200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10601-016-9266-6","type":"journal-article","created":{"date-parts":[[2017,1,17]],"date-time":"2017-01-17T13:14:05Z","timestamp":1484658845000},"page":"432-462","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Using constraint programming for solving RCPSP\/max-cal"],"prefix":"10.1007","volume":"22","author":[{"given":"Stefan","family":"Kreter","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Schutt","sequence":"additional","affiliation":[]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,17]]},"reference":[{"issue":"7","key":"9266_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"},{"key":"9266_CR2","volume-title":"Network Flows","author":"R Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., & Orlin, J. (1993). Network Flows. Englewood Cliffs: Prentice Hall."},{"key":"9266_CR3","volume-title":"Constraint-based scheduling: Two extensions. Master\u2019s thesis, University of Strathclyde Glasgow","author":"P Baptiste","year":"1994","unstructured":"Baptiste, P. (1994). Constraint-based scheduling: Two extensions. Master\u2019s thesis, University of Strathclyde Glasgow. United Kingdom: Scotland."},{"key":"9266_CR4","unstructured":"Beldiceanu, N. (1998). Parallel machine scheduling with calendar rules. International Workshop on Project Management and Scheduling."},{"key":"9266_CR5","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/j.cor.2014.04.018","volume":"53","author":"J Cheng","year":"2015","unstructured":"Cheng, J., Fowler, J., Kempf, K., & Mason, S. (2015). Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting. Computers & Operations Research, 53, 275\u2013287.","journal-title":"Computers & Operations Research"},{"key":"9266_CR6","unstructured":"Chu, G.G. (2011). Improving combinatorial optimization. PhD thesis, The University of Melbourne, http:\/\/hdl.handle.net\/11343\/36679 ."},{"key":"9266_CR7","volume-title":"Priorit\u00e4tsregelverfahren f\u00fcr die ressourcenbeschr\u00e4nkte Projektplanung mit und ohne Kalender","author":"B Franck","year":"1999","unstructured":"Franck, B. (1999). Priorit\u00e4tsregelverfahren f\u00fcr die ressourcenbeschr\u00e4nkte Projektplanung mit und ohne Kalender. Aachen: Shaker."},{"key":"9266_CR8","doi-asserted-by":"crossref","unstructured":"Franck, B., Neumann, K., & Schwindt, C. (2001a). Project scheduling with calendars. OR Spektrum 23:325\u2013334.","DOI":"10.1007\/PL00013355"},{"key":"9266_CR9","doi-asserted-by":"crossref","unstructured":"Franck, B, Neumann, K, & Schwindt, C (2001b). Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling. OR Spektrum 23:297\u2013324.","DOI":"10.1007\/PL00013356"},{"key":"9266_CR10","doi-asserted-by":"publisher","unstructured":"Kreter, S., Schutt, A., & Stuckey, P.J. (2015). Modeling and solving project scheduling with calendars. In Pesant, G. (Ed.) Principles and Practice of Constraint Programming, Springer International Publishing, Lecture Notes in Computer Science. doi: 10.1007\/978-3-319-23219-5_19 , (Vol. 9255 pp. 262\u2013278).","DOI":"10.1007\/978-3-319-23219-5_19"},{"issue":"2","key":"9266_CR11","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.ejor.2015.11.021","volume":"251","author":"S Kreter","year":"2016","unstructured":"Kreter, S., Rieck, J., & Zimmermann, J. (2016). Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars. European Journal of Operational Research, 251(2), 387\u2013403.","journal-title":"European Journal of Operational Research"},{"key":"9266_CR12","doi-asserted-by":"publisher","unstructured":"Laborie, P. (2009). IBM ILOG CP Optimizer for detailed scheduling illustrated on three problems. In Hoeve, W.J., & Hooker, J.N. (Eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Springer Berlin Heidelberg, Lecture Notes in Computer Science. doi: 10.1007\/978-3-642-01929-6_12 , (Vol. 5547 pp. 148\u2013162).","DOI":"10.1007\/978-3-642-01929-6_12"},{"issue":"2","key":"9266_CR13","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. Mat\u00e9matique, 294(2), 209\u2013211.","journal-title":"Mat\u00e9matique"},{"key":"9266_CR14","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., & Zuckerman, D. (1993). Optimal speedup of Las Vegas algorithms. Information Processing Letters, 47, 173\u2013180.","journal-title":"Information Processing Letters"},{"key":"9266_CR15","doi-asserted-by":"publisher","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: Engineering an efficient SAT solver. In Proceedings of Design Automation Conference \u2013 DAC 2001, ACM, New York, NY, USA. doi: 10.1145\/378239.379017 (pp. 530\u2013535).","DOI":"10.1145\/378239.379017"},{"key":"9266_CR16","doi-asserted-by":"publisher","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., & Tack, G. (2007). MiniZinc: Towards a standard CP modelling language. In Bessi\u00e8re, C. (Ed.) Principles and Practice of Constraint Programming \u2013 CP 2007, Springer Berlin Heidelberg, Lecture Notes in Computer Science. doi: 10.1007\/978-3-540-74970-7_38 , (Vol. 4741 pp. 529\u2013543).","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"9266_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24800-2","volume-title":"Project Scheduling with Time Windows and Scarce Resources","author":"K Neumann","year":"2003","unstructured":"Neumann, K., Schwindt, C., & Zimmermann, J. (2003). Project Scheduling with Time Windows and Scarce Resources, 2nd edn. Berlin: Springer.","edition":"2nd edn"},{"issue":"3","key":"9266_CR18","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. (2009). Propagation via lazy clause generation. Constraints, 14(3), 357\u2013391.","journal-title":"Constraints"},{"key":"9266_CR19","unstructured":"Schutt, A. (2011). Improving scheduling by learning. PhD thesis, The University of Melbourne, http:\/\/hdl.handle.net\/11343\/36701 ."},{"issue":"3","key":"9266_CR20","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. (2011). Explaining the cumulative propagator. Constraints, 16(3), 250\u2013282. doi: 10.1007\/s10601-010-9103-2 .","journal-title":"Constraints"},{"key":"9266_CR21","doi-asserted-by":"publisher","unstructured":"Schutt, A., Feydy, T., & Stuckey, P.J. (2013a). Explaining time-table-edge-finding propagation for the cumulative resource constraint. In Gomes, C.P., & Sellmann, M. (Eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Springer Berlin Heidelberg, Lecture Notes in Computer Science. doi: 10.1007\/978-3-642-38171-3_16 , (Vol. 7874 pp. 234\u2013250).","DOI":"10.1007\/978-3-642-38171-3_16"},{"key":"9266_CR22","doi-asserted-by":"publisher","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., & Wallace, M.G. (2013b). Solving RCPSP\/max by lazy clause generation. Journal of Scheduling, 16(3), 273\u2013289. doi: 10.1007\/s10951-012-0285-x .","DOI":"10.1007\/s10951-012-0285-x"},{"key":"9266_CR23","doi-asserted-by":"crossref","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., & Wallace, M.G. (2015). A satisfiability solving approach. In Schwindt, C., & Zimmermann, J. (Eds.) Handbook on Project Management and Scheduling, (Vol. 1 pp. 135\u2013160): Springer International Publishing.","DOI":"10.1007\/978-3-319-05443-8_7"},{"key":"9266_CR24","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s002910000042","volume":"22","author":"C Schwindt","year":"2000","unstructured":"Schwindt, C., & Trautmann, N. (2000). Batch scheduling in process industries: An application of resource-constrained project scheduling. OR Spektrum, 22, 501\u2013524.","journal-title":"OR Spektrum"},{"key":"9266_CR25","doi-asserted-by":"crossref","unstructured":"Trautmann, N. (2001). Calendars in project scheduling. In Fleischmann, B., Lasch, R., Derigs, U., Domschke, W., & Rieder, U. (Eds.) Operations Research Proceedings, (Vol. 2000 pp. 388\u2013392). Berlin: Springer.","DOI":"10.1007\/978-3-642-56656-1_62"},{"key":"9266_CR26","doi-asserted-by":"publisher","unstructured":"Vil\u00edm, P. (2011). Timetable edge finding filtering algorithm for discrete cumulative resources. In Achterberg, T., & Beck, J. (Eds.) Proceedings of Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems \u2013 CPAIOR 2011, Springer Berlin \/ Heidelberg, Lecture Notes in Computer Science. doi: 10.1007\/978-3-642-21311-3_22 , (Vol. 6697 pp. 230\u2013245).","DOI":"10.1007\/978-3-642-21311-3_22"},{"key":"9266_CR27","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF01415759","volume":"36","author":"J Zhan","year":"1992","unstructured":"Zhan, J. (1992). Calendarization of timeplanning in MPM networks. ZOR \u2013 Methods and Models of Operations Research, 36, 423\u2013438.","journal-title":"ZOR \u2013 Methods and Models of Operations Research"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-016-9266-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9266-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9266-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T13:19:36Z","timestamp":1568726376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-016-9266-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,17]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["9266"],"URL":"https:\/\/doi.org\/10.1007\/s10601-016-9266-6","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,17]]}}}