{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T13:56:49Z","timestamp":1680443809099},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,3,19]],"date-time":"2010-03-19T00:00:00Z","timestamp":1268956800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10479-010-0731-0","type":"journal-article","created":{"date-parts":[[2010,3,18]],"date-time":"2010-03-18T13:01:14Z","timestamp":1268917274000},"page":"27-50","source":"Crossref","is-referenced-by-count":8,"title":["New filtering for the cumulative constraint in the context of non-overlapping rectangles"],"prefix":"10.1007","volume":"184","author":[{"given":"Nicolas","family":"Beldiceanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mats","family":"Carlsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophie","family":"Demassey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Poder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,19]]},"reference":[{"issue":"7","key":"731_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":"731_CR2","unstructured":"Baptiste, P., & Le Pape, C. (1999). Constraint propagation techniques for cumulative scheduling. In Proceedings of the first workshop on the integration of AI and OR techniques in constraint programming for combinatorial optimization problems, Ferrara, Italy, 1999."},{"issue":"12","key":"731_CR3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N. Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., & Contejean, E. (1994). Introducing global constraints in CHIP. Mathematical and Computer Modelling, 20(12), 97\u2013123.","journal-title":"Mathematical and Computer Modelling"},{"key":"731_CR4","series-title":"LNCS","first-page":"180","volume-title":"Proc. CP\u20192007","author":"N. Beldiceanu","year":"2007","unstructured":"Beldiceanu, N., Carlsson, M., Poder, E., Sadek, R., & Truchet, C. (2007). A generic geometrical constraint kernel in space and time for handling polymorphic k-dimensional objects. In C. Bessi\u00e8re (Ed.), LNCS : Vol. 4741. Proc. CP\u20192007 (pp. 180\u2013194). Berlin: Springer."},{"issue":"2","key":"731_CR5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0020-0190(90)90098-I","volume":"36","author":"M. Bir\u00f3","year":"1990","unstructured":"Bir\u00f3, M. (1990). Object-oriented interaction in resource constrained scheduling. Information Processing Letters, 36(2), 65\u201367.","journal-title":"Information Processing Letters"},{"key":"731_CR6","unstructured":"Bouwkamp, C. J., & Duijvestijn, A. J. W. (1992). Catalogue of simple perfect squared squares of orders 21 through 25. Technical report EUT Report 92-WSK-03, Eindhoven University of Technology, The Netherlands, November 1992."},{"key":"731_CR7","volume-title":"Joint international conference and symposium on logic programming (JICSLP\u201996)","author":"Y. Caseau","year":"1996","unstructured":"Caseau, Y., & Laburthe, F. (1996). Cumulative scheduling with task intervals. In Joint international conference and symposium on logic programming (JICSLP\u201996). Cambridge: MIT Press."},{"issue":"3","key":"731_CR8","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1016\/j.ejor.2005.12.048","volume":"183","author":"F. Clautiaux","year":"2007","unstructured":"Clautiaux, F., Carlier, J., & Moukrim, A. (2007). A new exact method for the two-dimensional orthogonal packing problem. European Journal of Operational Research, 183(3), 1196\u20131211.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"731_CR9","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1016\/j.cor.2006.05.012","volume":"35","author":"F. Clautiaux","year":"2008","unstructured":"Clautiaux, F., Jouglet, A., Carlier, J., & Moukrim, A. (2008). A new constraint programming approach for the orthogonal packing problem. Computers and Operation Research, 35(3), 944\u2013959.","journal-title":"Computers and Operation Research"},{"key":"731_CR10","unstructured":"Erschler, J., & Lopez, P. (1990). Energy-based approach for task scheduling under time and resources constraints. In 2nd international workshop on project management and scheduling (pp. 115\u2013121). Compi\u00e9gne, France, June 1990."},{"key":"731_CR11","volume-title":"Computers and intractibility. A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractibility. A guide to the theory of NP-completeness. New York: Freeman."},{"key":"731_CR12","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, 294, 209\u2013211.","journal-title":"Comptes Rendus de l\u2019Acad\u00e9mie Des Sciences, Paris"},{"issue":"1","key":"731_CR13","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.ipl.2004.01.006","volume":"90","author":"N. Lesh","year":"2004","unstructured":"Lesh, N., Marks, J., McMahon, A., & Mitzenmacher, M. (2004). Exhaustive approaches to 2D rectangular perfect packings. Information Processing Letters, 90(1), 7\u201314.","journal-title":"Information Processing Letters"},{"issue":"1","key":"731_CR14","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1287\/ijoc.1070.0226","volume":"20","author":"L. Mercier","year":"2008","unstructured":"Mercier, L., & Van Hentenryck, P. (2008). Edge-finding for cumulative scheduling. INFORMS Journal on Computing, 20(1), 143\u2013153.","journal-title":"INFORMS Journal on Computing"},{"key":"731_CR15","series-title":"LNCS","first-page":"52","volume-title":"Proc. CP\u20192008","author":"H. Simonis","year":"2008","unstructured":"Simonis, H., & O\u2019Sullivan, B. (2008). Search strategies for rectangle packing. In P. J. Stuckey (Ed.), LNCS : Vol. 5202. Proc. CP\u20192008 (pp. 52\u201366). Berlin: Springer."},{"issue":"1\u20134","key":"731_CR16","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1023\/A:1021801522545","volume":"118","author":"M. A. Trick","year":"2003","unstructured":"Trick, M. A. (2003). A dynamic programming approach for consistency and propagation for knapsack constraints. Annals of Operations Research, 118(1\u20134), 73\u201384.","journal-title":"Annals of Operations Research"},{"key":"731_CR17","volume-title":"Intelligent scheduling","author":"P. Hentenryck Van","year":"1994","unstructured":"Van Hentenryck, P. (1994). Scheduling and packing in the constraint language cc(FD). In M. Zweben & M. Fox (Eds.), Intelligent scheduling. San Mateo: Morgan Kaufmann."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0731-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0731-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0731-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:08:01Z","timestamp":1559153281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0731-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,19]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["731"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0731-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,19]]}}}