{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:29:49Z","timestamp":1725798589483},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319104270"},{"type":"electronic","value":"9783319104287"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10428-7_23","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T21:33:54Z","timestamp":1407879234000},"page":"298-306","source":"Crossref","is-referenced-by-count":3,"title":["A Declarative Paradigm for Robust Cumulative Scheduling"],"prefix":"10.1007","author":[{"given":"Alban","family":"Derrien","sequence":"first","affiliation":[]},{"given":"Thierry","family":"Petit","sequence":"additional","affiliation":[]},{"given":"St\u00e9phane","family":"Zampelli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","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":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a02470, pp. 63\u201379. Springer, Heidelberg (2002)"},{"issue":"12","key":"23_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N. Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Journal of Mathematical and Computer Modelling\u00a020(12), 97\u2013123 (1994)","journal-title":"Journal of Mathematical and Computer Modelling"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Bessiere, C.: Constraint propagation. Research report 06020. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, LIRMM, ch. 3, Elsevier (2006)","DOI":"10.1016\/S1574-6526(06)80007-6"},{"key":"23_CR5","unstructured":"Billaut, J.-C., Moukrim, A., Sanlaville, E. (eds.): Flexibility and Robustness in Scheduling. Wiley (2010)"},{"key":"23_CR6","unstructured":"Choco. 3.1.0 (2013), \n                    \n                      http:\/\/choco.sourceforge.net\/"},{"key":"23_CR7","unstructured":"Davenport, A.-J., Jefflot, C., Beck, J.-C.: Slack-based techniques for robust schedules. In: Proc. European Conference on Planning, pp. 7\u201318 (2001)"},{"key":"23_CR8","unstructured":"Derrien, A., Petit, T., Zampelli, S.: Dynamic sweep filtering algorithm for FlexC. Research report RR14\/1\/INFO, Mines Nantes (2014)"},{"key":"23_CR9","unstructured":"Hebrard, E.: Super solutions in constraint programming. In: Sattler, U. (ed.) IJCAR Doctoral Programme. CEUR Workshop Proceedings, vol.\u00a0106. CEUR-WS.org (2004)"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-24664-0_11","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"E. Hebrard","year":"2004","unstructured":"Hebrard, E., Hnich, B., Walsh, T.: Super solutions in constraint programming. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 157\u2013172. Springer, Heidelberg (2004)"},{"key":"23_CR11","first-page":"20","volume":"294","author":"A. Lahrichi","year":"1982","unstructured":"Lahrichi, A.: The notions of Hump, Compulsory Part and their use in Cumulative Problems. C.R. Acad. Sc.\u00a0294, 20\u2013211 (1982)","journal-title":"C.R. Acad. Sc."},{"key":"23_CR12","unstructured":"Letort, A.: Passage \u00e0 l\u2019\u00e9chelle pour les contraintes d\u2019ordonnancement multi-ressources. Ph.D dissertation (2013)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-642-33558-7_33","volume-title":"Principles and Practice of Constraint Programming","author":"A. Letort","year":"2012","unstructured":"Letort, A., Beldiceanu, N., Carlsson, M.: A scalable sweep algorithm for the cumulative constraint. In: Milano, M. (ed.) CP 2012. LNCS, vol.\u00a07514, pp. 439\u2013454. Springer, Heidelberg (2012)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Leus, R., Artigues, C., Talla Nobibon, F.: Robust optimization for resource-constrained project scheduling with uncertain activity durations. In: Proc. IEEM, pp. 101\u2013105 (2011)","DOI":"10.2139\/ssrn.1749326"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-540-30201-8_35","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"L. Perron","year":"2004","unstructured":"Perron, L., Shaw, P., Furnon, V.: Propagation guided large neighborhood search. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 468\u2013481. Springer, Heidelberg (2004)"},{"issue":"8","key":"23_CR16","doi-asserted-by":"publisher","first-page":"2348","DOI":"10.1016\/j.cor.2008.08.008","volume":"36","author":"C.W. Wu","year":"2009","unstructured":"Wu, C.W., Brown, K.N., Beck, J.C.: Scheduling with uncertain durations: Modeling beta-robust scheduling with constraints. Computers & OR\u00a036(8), 2348\u20132356 (2009)","journal-title":"Computers & OR"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1007\/978-3-642-40627-0_64","volume-title":"Principles and Practice of Constraint Programming","author":"S. Zampelli","year":"2013","unstructured":"Zampelli, S., Vergados, Y., Van Schaeren, R., Dullaert, W., Raa, B.: The berth allocation and quay crane assignment problem using a CP approach. In: Schulte, C. (ed.) CP 2013. LNCS, vol.\u00a08124, pp. 880\u2013896. Springer, Heidelberg (2013)"}],"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-10428-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T11:08:37Z","timestamp":1558955317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10428-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319104270","9783319104287"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10428-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}