{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:49:52Z","timestamp":1742914192934,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540218364"},{"type":"electronic","value":"9783540246640"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24664-0_23","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T14:59:59Z","timestamp":1287845999000},"page":"335-347","source":"Crossref","is-referenced-by-count":22,"title":["O(nlog n) Filtering Algorithms for Unary Resource Constraint"],"prefix":"10.1007","author":[{"given":"Petr","family":"Vil\u00edm","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"OR library, URL \n                      http:\/\/mscmga.ms.ic.ac.uk\/info.html"},{"key":"23_CR2","unstructured":"Baptiste, P., Le Pape, C.: Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. In: Proceedings of the Fifteenth Workshop of the U.K. Planning Special Interest Group (1996)"},{"key":"23_CR3","unstructured":"Brucker, P.: Complex scheduling problems (1999), URL \n                      http:\/\/citeseer.nj.nec.com\/brucker99complex.html"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","volume":"78","author":"J. Carlier","year":"1994","unstructured":"Carlier, J., Pinson, E.: Adjustments of head and tails for the job-shop problem. European Journal of Operational Research\u00a078, 146\u2013161 (1994)","journal-title":"European Journal of Operational Research"},{"key":"23_CR5","unstructured":"Caseau, Y., Laburthe, F.: Disjunctive scheduling with task intervals. In: Technical report, LIENS Technical Report 95-25. Ecole Normale Sup\u00e9rieure Paris, Fran\u00e7e (1995)"},{"key":"23_CR6","unstructured":"Nuijten, W., Foccaci, F., Laborie, P.: Solving scheduling problems with setup times and alternative resources. In: Proceedings of the 4th International Conference on AI Planning and Scheduling, AIPS 2000, pp. 92\u2013101 (2000)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/3-540-61310-2_29","volume-title":"Integer Programming and Combinatorial Optimization","author":"P. Martin","year":"1996","unstructured":"Martin, P., Shmoys, D.B.: A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds.) IPCO 1996. LNCS, vol.\u00a01084, pp. 389\u2013403. Springer, Heidelberg (1996)"},{"key":"23_CR8","volume-title":"Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems","author":"C. Le Pape","year":"2001","unstructured":"Le Pape, C., Baptiste, P., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Torres, P., Lopez, P.: On not-first\/not-last conditions in disjunctive scheduling. European Journal of Operational Research (1999)","DOI":"10.1016\/S0377-2217(99)00497-X"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Vil\u00edm, P.: Batch processing with sequence dependent setup times: New results. In: Proceedings of the 4th Workshop of Constraint Programming for Decision and Control, CPDC 2002, Gliwice, Poland (2002)","DOI":"10.1007\/3-540-46135-3_62"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, 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":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24664-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T21:40:26Z","timestamp":1674078026000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24664-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540218364","9783540246640"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24664-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}