{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T08:26:47Z","timestamp":1749025607349},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441205"},{"type":"electronic","value":"9783540461357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_5","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T05:59:47Z","timestamp":1179208787000},"page":"63-79","source":"Crossref","is-referenced-by-count":35,"title":["A New Multi-resource cumulatives Constraint with Negative Heights"],"prefix":"10.1007","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"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"issue":"7","key":"5_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 to solve Complex Scheduling and Packing Problems. Mathl. Comput. Modelling, 17(7), pages 57\u201373, (1993).","journal-title":"Mathl. Comput. Modelling"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0377-2217(99)00496-8","volume":"127","author":"C. Artigues","year":"2000","unstructured":"Artigues, C, Roubellat, F.: A polynomial activity insertion algorithm in a multiresource schedule with cumulative constraints and multiple modes. In European Journal of Operational Research (EJOR), 127, pages 297\u2013316, (2000).","journal-title":"European Journal of Operational Research (EJOR)"},{"key":"5_CR3","unstructured":"Bart\u00e1k, R.: Dynamic Constraint Models for Planning and Scheduling Problems. In New Trends in Constraints (Papers from the Joint ERCIM\/Compulog-Net Workshop, Cyprus, October 25\u201327, 1999), LNAI 1865, Springer Verlag, (2000)."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Le Pape, C, Nuijten, W.: Constraint-based Scheduling. Kluwer Academic Publishers, International Series in Operations Research & Management Science, (2001).","DOI":"10.1007\/978-1-4615-1479-4"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0004-3702(00)00035-7","volume":"121","author":"J. C. Beck","year":"2000","unstructured":"Beck, J. C, Fox, M. S.: Constraint-directed techniques for scheduling alternative activities. In Artificial Intelligence 121, pages 211\u2013250, (2000).","journal-title":"In Artificial Intelligence"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N.: Pruning for the minimum Constraint Family and for the number of distinct values Constraint Family. In Proc. of the 7 th CP, 211\u2013224, Paphos, (2001).","DOI":"10.1007\/3-540-45578-7_15"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Carlsson, M.: Sweep as a Generic Pruning Technique Applied to the Non-Overlapping Rectangles Constraint. In Proc. of the 7 th CP, 377\u2013391, Paphos, (2001).","DOI":"10.1007\/3-540-45578-7_26"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry\u2013Algorithms and Applications. Springer, (1997).","DOI":"10.1007\/978-3-662-03427-9"},{"key":"5_CR9","unstructured":"Brucker, P., Drexl, A., M\u00f6hring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: Notation, classification, models and methods, in EJOR 112, pages 3\u201341, (1999)."},{"key":"5_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BFb0033845","volume-title":"Proc. Programming Languages: Implementations, Logics, and Programs","author":"M. Carlsson","year":"1997","unstructured":"Carlsson, M., Ottosson G., Carlson, B.: An Open-Ended Finite Domain Constraint Solver. Proc. Programming Languages: Implementations, Logics, and Programs, vol. 1292 of Lecture Notes in Computer Science, pages 191\u2013206, Springer-Verlag, (1997)."},{"key":"5_CR11","unstructured":"Caseau, Y., Laburthe, F.: Cumulative Scheduling with Task Intervals. In Proceedings of the Joint International Conference and Symposium on Logic Programming, MIT Press, (1996)."},{"key":"5_CR12","unstructured":"De Backer, B., Beringer, A.: A CLP Language Handling Disjunctions of Linear Constraints. In Proc. 10 th International Conference on Logic Programming, pages 550\u2013563, (1993)."},{"key":"5_CR13","unstructured":"Erschler, J., Lopez, P.: Energy-based approach for task scheduling under time and resources constraints. In 2nd International Workshop on Project Management and Scheduling, pages 115\u2013121, Compi\u00e8gne (France), June 20\u201322, (1990)."},{"key":"5_CR14","unstructured":"Herroelen, W., Demeulemeester, E., De Reyck, B.: A Classification Scheme for Project Scheduling Problems. in: Weglarz J. (Ed.), Handbook on Recent advances in Project Scheduling, Kluwer Academic Publishers, (1998)."},{"key":"5_CR15","first-page":"209","volume":"294","author":"A. Lahrichi","year":"1982","unstructured":"Lahrichi, A.: Scheduling: the Notions of Hump, Compulsory Parts and their Use in Cumulative Problems. in: C. R. Acad. Se. Paris, t. 294, pages 209\u2013211, (1982).","journal-title":"C. R. Acad. Se. Paris"},{"key":"5_CR16","unstructured":"Poder, E., Beldiceanu, N., Sanlaville, E.: Computing the Compulsory Part of a Task with Varying Duration and Varying Resource Consumption. Submitted to European Journal of Operational Research (EJOR), (February 2001)."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Preparata, F. P., Shamos, M. I.: Computational geometry. An introduction. Springer-Verlag, (1985).","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"5_CR18","unstructured":"Simonis, H., Cornelissens, T.: Modelling Producer\/Consumer Constraints. In Proc. of the 1 st CP, 449\u2013462, Cassis, (1995)."},{"key":"5_CR19","series-title":"Lect Notes Comput Sci","volume-title":"Constraints: Basics and Trends","author":"P. Hentenryck Van","year":"1995","unstructured":"Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, Implementation and Evaluation of the Constraint Language cc(FD). In A. Podelski, ed., Constraints: Basics and Trends, vol. 910 of Lecture Notes in Computer Science, Springer-Verlag, (1995)."},{"key":"5_CR20","unstructured":"W\u00fcrtz, J.: Oz Scheduler: A Workbench for Scheduling Problems. In Proceedings of the 8th IEEE International Conference on Tools with Artificial Intelligence, Nov l6\u201319 1996, IEEE Computer Society Press, (1996)."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46135-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T00:25:51Z","timestamp":1556411151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}