{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T19:26:08Z","timestamp":1761765968625,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232188"},{"type":"electronic","value":"9783319232195"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23219-5_19","type":"book-chapter","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T10:17:33Z","timestamp":1439374653000},"page":"262-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Modeling and Solving Project Scheduling with Calendars"],"prefix":"10.1007","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":[[2015,8,13]]},"reference":[{"issue":"7","key":"19_CR1","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 17(7), 57\u201373 (1993)","journal-title":"Mathematical and Computer Modelling"},{"key":"19_CR2","volume-title":"Network Flows","author":"R Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice Hall, Englewood Cliffs (1993)"},{"key":"19_CR3","unstructured":"Baptiste, P.: Constraint-Based Scheduling: Two Extensions. Master\u2019s thesis, University of Strathclyde, Glasgow, Scotland, United Kingdom (1994)"},{"key":"19_CR4","unstructured":"Beldiceanu, N.: Parallel machine scheduling with calendar rules. In: International Workshop on Project Management and Scheduling (1998)"},{"key":"19_CR5","doi-asserted-by":"publisher","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.: Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting. Computers & Operations Research 53, 275\u2013287 (2015)","journal-title":"Computers & Operations Research"},{"key":"19_CR6","volume-title":"Priorit\u00e4tsregelverfahren f\u00fcr die ressourcenbeschr\u00e4nkte Projektplanung mit und ohne Kalender","author":"B Franck","year":"1999","unstructured":"Franck, B.: Priorit\u00e4tsregelverfahren f\u00fcr die ressourcenbeschr\u00e4nkte Projektplanung mit und ohne Kalender. Shaker, Aachen (1999)"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/PL00013355","volume":"23","author":"B Franck","year":"2001","unstructured":"Franck, B., Neumann, K., Schwindt, C.: Project scheduling with calendars. OR Spektrum 23, 325\u2013334 (2001)","journal-title":"OR Spektrum"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/PL00013356","volume":"23","author":"B Franck","year":"2001","unstructured":"Franck, B., Neumann, K., Schwindt, C.: Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling. OR Spektrum 23, 297\u2013324 (2001)","journal-title":"OR Spektrum"},{"key":"19_CR9","unstructured":"Kreter, S., Rieck, J., Zimmermann, J.: Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars. Submitted to European Journal of Operational Research (2014)"},{"key":"19_CR10","unstructured":"Lahrichi, A.: 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 (1982)"},{"key":"19_CR11","doi-asserted-by":"publisher","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.: Optimal speedup of Las Vegas algorithms. Information Processing Letters 47, 173\u2013180 (1993)","journal-title":"Information Processing Letters"},{"key":"19_CR12","doi-asserted-by":"crossref","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 - DAC 2001, pp. 530\u2013535. ACM, New York (2001)","DOI":"10.1145\/378239.379017"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007)"},{"key":"19_CR14","doi-asserted-by":"publisher","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.: Project Scheduling with Time Windows and Scarce Resources, 2nd edn. Springer, Berlin (2003)","edition":"2"},{"issue":"3","key":"19_CR15","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 14(3), 357\u2013391 (2009)","journal-title":"Constraints"},{"key":"19_CR16","unstructured":"Schutt, A.: Improving Scheduling by Learning. Ph.D. thesis, The University of Melbourne (2011). http:\/\/repository.unimelb.edu.au\/10187\/11060"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-38171-3_16","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"A Schutt","year":"2013","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J.: Explaining time-table-edge-finding propagation for the cumulative resource constraint. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 234\u2013250. Springer, Heidelberg (2013)"},{"issue":"3","key":"19_CR18","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 16(3), 250\u2013282 (2011)","journal-title":"Constraints"},{"issue":"3","key":"19_CR19","doi-asserted-by":"publisher","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. Journal of Scheduling 16(3), 273\u2013289 (2013)","journal-title":"Journal of Scheduling"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: A satisfiability solving approach. In: Schwindt, C., Zimmermann, J. (eds.) Handbook on Project Management and Scheduling, vol. 1, pp. 135\u2013160. Springer International Publishing (2015)","DOI":"10.1007\/978-3-319-05443-8_7"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s002910000042","volume":"22","author":"C Schwindt","year":"2000","unstructured":"Schwindt, C., Trautmann, N.: Batch scheduling in process industries: An application of resource-constrained project scheduling. OR Spektrum 22, 501\u2013524 (2000)","journal-title":"OR Spektrum"},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-56656-1_62","volume-title":"Operations Research Proceedings 2000","author":"N Trautmann","year":"2001","unstructured":"Trautmann, N.: Calendars in project scheduling. In: Fleischmann, B., Lasch, R., Derigs, U., Domschke, W., Rieder, U. (eds.) Operations Research Proceedings 2000, pp. 388\u2013392. Springer, Berlin (2001)"},{"key":"19_CR23","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/BF01415759","volume":"36","author":"J Zhan","year":"1992","unstructured":"Zhan, J.: Calendarization of timeplanning in MPM networks. ZOR - Methods and Models of Operations Research 36, 423\u2013438 (1992)","journal-title":"ZOR - Methods and Models of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23219-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T14:27:18Z","timestamp":1675866438000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23219-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232188","9783319232195"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23219-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}