{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:15:48Z","timestamp":1725531348185},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642006746"},{"type":"electronic","value":"9783642006753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00675-3_2","type":"book-chapter","created":{"date-parts":[[2009,4,20]],"date-time":"2009-04-20T07:02:24Z","timestamp":1240210944000},"page":"21-37","source":"Crossref","is-referenced-by-count":1,"title":["Linear Weighted-Task-Sum \u2013 Scheduling Prioritized Tasks on a Single Resource"],"prefix":"10.1007","author":[{"given":"Armin","family":"Wolf","sequence":"first","affiliation":[]},{"given":"Gunnar","family":"Schrader","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/11564751_8","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"K. Artiouchine","year":"2005","unstructured":"Artiouchine, K., Baptiste, P.: Inter-distance constraint: An extension of the all-different constraint for scheduling equal length jobs. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 62\u201376. Springer, Heidelberg (2005)"},{"key":"2_CR2","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-Based Scheduling","author":"P. Baptiste","year":"2001","unstructured":"Baptiste, P., le Pape, C., Nuijten, W.: Constraint-Based Scheduling. International Series in Operations Research & Management Science, vol.\u00a039. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-45578-7_26","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"N. Beldiceanu","year":"2001","unstructured":"Beldiceanu, N., Carlsson, M.: Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 377\u2013391. Springer, Heidelberg (2001)"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"12","author":"N. Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contjean, E.: Introducing global constraints in CHIP. Mathematical and Computer Modelling\u00a012, 97\u2013123 (1994)","journal-title":"Mathematical and Computer Modelling"},{"key":"2_CR5","first-page":"369","volume-title":"Proceedings of the Eleventh International Conference on Logic Programming, ICLP 1994","author":"Y. Caseau","year":"1994","unstructured":"Caseau, Y., Laburthe, F.: Improved CLP scheduling with task intervals. In: van Hentenryck, P. (ed.) Proceedings of the Eleventh International Conference on Logic Programming, ICLP 1994, pp. 369\u2013383. MIT Press, Cambridge (1994)"},{"key":"2_CR6","unstructured":"Hoche, M., M\u00fcller, H., Schlenker, H., Wolf, A.: firstcs - A Pure Java Constraint Programming Engine. In: Hanus, M., Hofstedt, P., Wolf, A. (eds.) 2nd International Workshop on Multiparadigm Constraint Programming Languages \u2013 MultiCPL 2003, September 29 (2003), \n                    \n                      uebb.cs.tu-berlin.de\/MultiCPL03\/Proceedings.MultiCPL03.RCoRP03.pdf"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/3-540-45349-0_28","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"J.-C. R\u00e9gin","year":"2000","unstructured":"R\u00e9gin, J.-C., Rueher, M.: A global constraint combining a sum constraint and difference constraints. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 384\u2013395. Springer, Heidelberg (2000)"},{"key":"2_CR8","first-page":"115","volume-title":"Third International Conference on Principles and Practice of Declarative Programming","author":"C. Schulte","year":"2001","unstructured":"Schulte, C., Stuckey, P.J.: When do bounds and domain propagation lead to the same search space. In: S\u03c6ndergaard, H. (ed.) Third International Conference on Principles and Practice of Declarative Programming, Florence, Italy, September 2001, pp. 115\u2013126. ACM Press, New York (2001)"},{"issue":"3&4","key":"2_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF03037165","volume":"9","author":"P. Hentenryck Van","year":"1991","unstructured":"Van Hentenryck, P., le Provost, T.: Incremental search in constraint logic programming. New Generation Computing\u00a09(3&4), 257\u2013275 (1991)","journal-title":"New Generation Computing"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-24664-0_23","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P. Vil\u00edm","year":"2004","unstructured":"Vil\u00edm, P.: O(n logn) filtering algorithms for unary resource constraint. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 335\u2013347. Springer, Heidelberg (2004)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/11493853_29","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P. Vil\u00edm","year":"2005","unstructured":"Vil\u00edm, P.: Computing explanations for the unary resource constraint. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 396\u2013409. Springer, Heidelberg (2005)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-30201-8_8","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P. Vil\u00edm","year":"2004","unstructured":"Vil\u00edm, P., Bart\u00e1k, R., \u010cepek, O.: Unary Resource Constraint with Optional Activities. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 62\u201376. Springer, Heidelberg (2004)"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24662-6_12","volume-title":"Recent Advances in Constraints","author":"A. Wolf","year":"2004","unstructured":"Wolf, A.: Reduce-to-the-opt \u2013 A specialized search algorithm for contiguous task scheduling. In: Apt, K.R., Fages, F., Rossi, F., Szeredi, P., V\u00e1ncza, J. (eds.) CSCLP 2003. LNCS, vol.\u00a03010, pp. 223\u2013232. Springer, Heidelberg (2004)"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/11402763_15","volume-title":"Recent Advances in Constraints","author":"A. Wolf","year":"2005","unstructured":"Wolf, A.: Better propagation for non-preemptive single-resource constraint problems. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds.) CSCLP 2004. LNCS, vol.\u00a03419, pp. 201\u2013215. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Applications of Declarative Programming and Knowledge Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00675-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T16:21:54Z","timestamp":1551975714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00675-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642006746","9783642006753"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00675-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}