{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:41:57Z","timestamp":1725514917561},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540723967"},{"type":"electronic","value":"9783540723974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72397-4_16","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T15:56:32Z","timestamp":1182527792000},"page":"214-228","source":"Crossref","is-referenced-by-count":4,"title":["A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Beldiceanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Poder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","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)"},{"key":"16_CR2","volume-title":"Proceedings of the Joint International Conference and Symposium on Logic Programming","author":"Y. Caseau","year":"1996","unstructured":"Caseau, Y., Laburthe, F.: Cumulative Scheduling with Task Intervals. In: Proceedings of the Joint International Conference and Symposium on Logic Programming, MIT Press, Cambridge (1996)"},{"key":"16_CR3","first-page":"1","volume-title":"Project Scheduling Recent Models, Algorithms and Applications","author":"W. Herroelen","year":"1998","unstructured":"Herroelen, W., Demeulemeester, E., De Reyck, B.: A Classification Scheme for Project Scheduling Problems. In: Weglarz, J. (ed.) Project Scheduling Recent Models, Algorithms and Applications, pp. 1\u201326. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/S0377-2217(97)00442-6","volume":"112","author":"R. Klein","year":"1999","unstructured":"Klein, R., Scholl, A.: Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling. European Journal of Operational Research\u00a0112, 322\u2013346 (1999)","journal-title":"European Journal of Operational Research"},{"key":"16_CR5","unstructured":"Lahrichi, A.: Scheduling: the Notions of Hump, Compulsory Parts and their Use in Cumulative Problems. C. R. Acad. Sci. Paris, t. 294, pp. 209\u2013211 (1982)"},{"key":"16_CR6","doi-asserted-by":"publisher","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. Artificial Intelligence\u00a0143, 151\u2013188 (2003)","journal-title":"Artificial Intelligence"},{"issue":"10","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1921","DOI":"10.1016\/j.compchemeng.2004.03.016","volume":"28","author":"C.T. Maravelias","year":"2004","unstructured":"Maravelias, C.T., Grossmann, I.E.: A Hybrid MILP\/CP Decomposition Approach for the Continuous Time Scheduling of Multipurpose Batch Plants. Computers & chemical engineering\u00a028(10), 1921\u20131949 (2004)","journal-title":"Computers & chemical engineering"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-46135-3_10","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"N. Muscettola","year":"2002","unstructured":"Muscettola, N.: Computing the Envelope for Stepwise-Constant Resource Allocations. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 139\u2013153. Springer, Heidelberg (2002)"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0377-2217(02)00756-7","volume":"153","author":"E. Poder","year":"2004","unstructured":"Poder, E., Beldiceanu, N., Sanlaville, E.: Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption. European Journal of Operational Research\u00a0153, 239\u2013254 (2004)","journal-title":"European Journal of Operational Research"},{"key":"16_CR10","series-title":"Texts and Monographs in Computer Science","volume-title":"Computational Geometry, An introduction","author":"F.P. Preparata","year":"1995","unstructured":"Preparata, F.P., Ian Shamos, M.: Computational Geometry, An introduction. Texts and Monographs in Computer Science. Springer, New York (1995)"},{"key":"16_CR11","unstructured":"Sourd, F., Rogerie, J.: Continuous Filling and Emptying of Storage Systems in Constraint-Based Scheduling. In: 8th International Workshop on Project Management and Scheduling - MPS 2002, Valencia, Spain, April 3-5 (2002)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1007\/978-3-540-45193-8_50","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"A. Wolf","year":"2003","unstructured":"Wolf, A.: Pruning while Sweeping over Task Intervals. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 739\u2013753. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72397-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T06:46:00Z","timestamp":1550385960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72397-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540723967","9783540723974"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72397-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}