{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T04:40:38Z","timestamp":1771389638879,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,10,1]],"date-time":"2005-10-01T00:00:00Z","timestamp":1128124800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2005,10]]},"DOI":"10.1007\/s10601-005-2814-0","type":"journal-article","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:51:44Z","timestamp":1129819904000},"page":"403-425","source":"Crossref","is-referenced-by-count":22,"title":["Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities"],"prefix":"10.1007","volume":"10","author":[{"given":"Petr","family":"Vil\u00edm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Bart\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"\u010cepek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2814_CR1","unstructured":"OR Library. http:\/\/mscmga.ms.ic.ac.uk\/info.html."},{"key":"2814_CR2","unstructured":"Baptiste, P., & Le Pape, C. (1996). Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. In Proceedings of the Fifteenth Workshop of the U.K. Planning Special Interest Group."},{"key":"2814_CR3","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Le Pape, C., & Nuijten, W. (2001). Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4615-1479-4"},{"key":"2814_CR4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1023\/A:1021805623454","volume":"118","author":"R. Bartk","year":"2003","unstructured":"Bart\u00e1k, R. (2003). Dynamic global constraints in backtracking based environments. Ann. Oper. Res. 118: 101\u2013118.","journal-title":"Ann. Oper. Res."},{"key":"2814_CR5","unstructured":"Beck, J.C., & Fox, M.S. (1999). Scheduling alternative activities. In AAAI\/IAAI, pages 680\u2013687."},{"key":"2814_CR6","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","volume":"78","author":"J. Carlier","year":"1994","unstructured":"Carlier, J., & Pinson, E. (1994). Adjustments of head and tails for the job-shop problem. Eur. J. Oper. Res. 78: 146\u2013161.","journal-title":"Eur. J.Oper. Res."},{"key":"2814_CR7","unstructured":"Caseau, Y., & Laburthe, F. (1994). Improved CLP scheduling with task intervals'. In van Hentenryck, P., ed., Proceedings of the 11th International Conference on Logic Programming, ICLP'94."},{"key":"2814_CR8","unstructured":"Colombani, Y. (1996). CP: an efficient and partical approach to solving the job-shop problem. In Principles and Practice of Constraint Programming\u2014CP 1996."},{"key":"2814_CR9","unstructured":"Focacci, F., Laborie, P., & Nuijten, W. (2000). Solving scheduling problems with setup times and alternative resources. In Proceedings of the 5th International Conference on Artificial Intelligence Planning and Scheduling."},{"key":"2814_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., & Johnson, D.S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman and Company."},{"key":"2814_CR11","doi-asserted-by":"crossref","unstructured":"Martin, P., & Shmoys, D.B. (1996). A new approach to computing optimal schedules for the job-shop scheduling problem. In Cunningham, W.H., McCormick, S.T. and Queyranne, M., eds., Proceedings of the 5th International Conference on Integer Programming and Combinatorial Optimization, IPCO'96, pages 389\u2013403. Vancouver, British Columbia, Canada.","DOI":"10.1007\/3-540-61310-2_29"},{"key":"2814_CR12","unstructured":"Torres, P., & Lopez, P. (1999). On not-first\/not-last conditions in disjunctive scheduling. European Journal of Operational Research."},{"key":"2814_CR13","unstructured":"Vilm, P. (2002). Batch processing with sequence dependent setup times: new results. In Proceedings of the 4th Workshop of Constraint Programming for Decision and Control, CPDC'02, Gliwice, Poland."},{"key":"2814_CR14","unstructured":"Vilm, P. (2004). O(n log n) filtering algorithms for unary resource constraint. In Proceedings of CP-AI-OR 2004."},{"key":"2814_CR15","doi-asserted-by":"crossref","unstructured":"Wolf, A. (2003). Pruning while sweeping over task intervals. In Principles and Practice of Constraint Programming\u2014CP 2003. Kinsale, Ireland.","DOI":"10.1007\/978-3-540-45193-8_50"},{"key":"2814_CR16","unstructured":"Wolf, A., & Schlenker, H. (2004). Realizing the alternative resources constraint problem with single resource constraints. In To Appear in Proceedings of the INAP Workshop 2004."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-005-2814-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-005-2814-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-005-2814-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:13Z","timestamp":1559243653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-005-2814-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,10]]}},"alternative-id":["2814"],"URL":"https:\/\/doi.org\/10.1007\/s10601-005-2814-0","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10]]}}}