{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T12:09:39Z","timestamp":1768910979314,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T00:00:00Z","timestamp":1581724800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T00:00:00Z","timestamp":1581724800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10951-019-00632-8","type":"journal-article","created":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T17:02:51Z","timestamp":1581786171000},"page":"431-449","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Filtering Algorithm for the Unary Resource Constraint with Transition Times and Optional Activities"],"prefix":"10.1007","volume":"23","author":[{"given":"Sascha","family":"Van Cauwelaert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyrille","family":"Dejemeppe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,15]]},"reference":[{"issue":"3","key":"632_CR1","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C., Cheng, T. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985\u20131032.","journal-title":"European Journal of Operational Research"},{"key":"632_CR2","doi-asserted-by":"crossref","unstructured":"Artigues, C., Belmokhtar, S., & Feillet, D. (2004). A new exact solution algorithm for the job shop problem with sequence-dependent setup times. In J. C. R\u00e9gin, & M. Rueher (Eds.), Integration of AI and OR techniques in constraint programming for combinatorial optimization problems (pp. 37\u201349). Springer.","DOI":"10.1007\/978-3-540-24664-0_3"},{"issue":"1","key":"632_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10479-007-0283-0","volume":"159","author":"C Artigues","year":"2008","unstructured":"Artigues, C., & Feillet, D. (2008). A branch and bound method for the job-shop problem with sequence-dependent setup times. Annals of Operations Research, 159(1), 135\u2013159.","journal-title":"Annals of Operations Research"},{"key":"632_CR4","first-page":"759","volume-title":"Handbook of constraint programming, Chap.\u00a022","author":"P Baptiste","year":"2006","unstructured":"Baptiste, P., Laborie, P., Le Pape, C., & Nuijten, W. (2006). Constraint-based scheduling and planning. In F. Rossi, P. van Beek, & T. Walsh (Eds.), Handbook of constraint programming, Chap.\u00a022 (pp. 759\u2013797). Amsterdam: Elsevier."},{"key":"632_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-based scheduling: Applying constraint programming to scheduling problems, International Series in Operations Research & Management Science","author":"P Baptiste","year":"2001","unstructured":"Baptiste, P., Le Pape, C., & Nuijten, W. (2001). Constraint-based scheduling: Applying constraint programming to scheduling problems, International Series in Operations Research & Management Science (Vol. 39). Berlin: Springer."},{"key":"632_CR6","unstructured":"Bart\u00e1k, R. (2008). Search strategies for scheduling problems with optional activities. In Proceedings of CSCLP 2008 annual ERCIM workshop on constraint solving and constraint logic programming, Rome."},{"issue":"1","key":"632_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1177\/0142331208100099","volume":"32","author":"R Bart\u00e1k","year":"2010","unstructured":"Bart\u00e1k, R., & \u010cepek, O. (2010). Incremental propagation rules for a precedence graph with optional activities and time windows. Transactions of the Institute of Measurement and Control, 32(1), 73\u201396.","journal-title":"Transactions of the Institute of Measurement and Control"},{"key":"632_CR8","volume-title":"On a routing problem","author":"R Bellman","year":"1956","unstructured":"Bellman, R. (1956). On a routing problem. DTIC Document: Technical report."},{"key":"632_CR9","unstructured":"Brucker, P. (1999). Complex scheduling problems. Zeitschrift Operations Research. 30, 99."},{"issue":"3","key":"632_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01539706","volume":"18","author":"P Brucker","year":"1996","unstructured":"Brucker, P., & Thiele, O. (1996). A branch & bound method for the general-shop problem with sequence dependent setup-times. Operations-Research-Spektrum, 18(3), 145\u2013161.","journal-title":"Operations-Research-Spektrum"},{"key":"632_CR11","doi-asserted-by":"crossref","unstructured":"Cappart, Q., Thomas, C., Schaus, P., & Rousseau, L. M. (2018). A constraint programming approach for solving patient transportation problems. In International conference on principles and practice of constraint programming (pp. 490\u2013506). Springer.","DOI":"10.1007\/978-3-319-98334-9_32"},{"issue":"2","key":"632_CR12","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/net.3230110207","volume":"11","author":"N Christofides","year":"1981","unstructured":"Christofides, N., Mingozzi, A., & Toth, P. (1981). State-space relaxation procedures for the computation of bounds to routing problems. Networks, 11(2), 145\u2013164.","journal-title":"Networks"},{"key":"632_CR13","unstructured":"Dejemeppe, C. (2016). Constraint programming algorithms and models for scheduling applications. Ph.D. thesis, Universit\u00e9 catholique de Louvain, Louvain-la-Neuve"},{"key":"632_CR14","doi-asserted-by":"crossref","unstructured":"Dejemeppe, C., Van\u00a0Cauwelaert, S., & Schaus, P. (2015). The unary resource with transition times. In International conference on principles and practice of constraint programming (pp. 89\u2013104). Springer","DOI":"10.1007\/978-3-319-23219-5_7"},{"issue":"2","key":"632_CR15","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E. D., & Mor\u00e9, J. J. (2002). Benchmarking optimization software with performance profiles. Mathematical programming, 91(2), 201\u2013213.","journal-title":"Mathematical programming"},{"key":"632_CR16","unstructured":"Focacci, F., Laborie, P., & Nuijten, W. (2000). Solving scheduling problems with setup times and alternative resources. In AIPS (pp. 92\u2013101)."},{"key":"632_CR17","doi-asserted-by":"crossref","unstructured":"Gay, S., Hartert, R., Lecoutre, C., & Schaus, P.(2015). Conflict ordering search for scheduling problems. In International conference on principles and practice of constraint programming (pp. 140\u2013148). Springer.","DOI":"10.1007\/978-3-319-23219-5_10"},{"key":"632_CR18","doi-asserted-by":"crossref","unstructured":"Gay, S., Schaus, P., & De\u00a0Smedt, V. (2014). Continuous casting scheduling with constraint programming. In B. O\u2019Sullivan (Ed.), Principles and practice of constraint programming (pp. 831\u2013845). Springer.","DOI":"10.1007\/978-3-319-10428-7_59"},{"key":"632_CR19","doi-asserted-by":"crossref","unstructured":"Grimes, D., & Hebrard, E. (2010). Job shop scheduling with setup times and maximal time-lags: A simple constraint programming approach. In Integration of AI and OR techniques in constraint programming for combinatorial optimization problems (pp. 147\u2013161). Springer.","DOI":"10.1007\/978-3-642-13520-0_19"},{"issue":"1","key":"632_CR20","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J. B. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical society, 7(1), 48\u201350.","journal-title":"Proceedings of the American Mathematical society"},{"key":"632_CR21","doi-asserted-by":"crossref","unstructured":"Laborie, P. (2018). An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling. In International conference on the integration of constraint programming, artificial intelligence, and operations research (pp. 403\u2013411). Springer.","DOI":"10.1007\/978-3-319-93031-2_29"},{"key":"632_CR22","unstructured":"Laborie, P., & Rogerie, J. (2008). Reasoning with conditional time-intervals. In FLAIRS conference (pp. 555\u2013560)."},{"issue":"2","key":"632_CR23","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10601-018-9281-x","volume":"23","author":"P Laborie","year":"2018","unstructured":"Laborie, P., Rogerie, J., Shaw, P., & Vil\u00edm, P. (2018). IBM ILOG CP optimizer for scheduling. Constraints, 23(2), 210\u2013250.","journal-title":"Constraints"},{"key":"632_CR24","unstructured":"Moore, E. (1959). The shortest path through a maze. In Proceedings international symposium on switching theory."},{"key":"632_CR25","unstructured":"Team, Osca R. (2012). OscaR: Scala in OR. Retrieved from https:\/\/bitbucket.org\/oscarlib\/oscar."},{"key":"632_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-018-0381-6","author":"A Ozolins","year":"2018","unstructured":"Ozolins, A. (2018). Bounded dynamic programming algorithm for the job shop problem with sequence dependent setup times. Operational Research,. https:\/\/doi.org\/10.1007\/s12351-018-0381-6.","journal-title":"Operational Research"},{"key":"632_CR27","doi-asserted-by":"crossref","unstructured":"Van\u00a0Cauwelaert, S., Lombardi, M., & Schaus, P. (2015) Understanding the potential of propagators. In International conference on integration of artificial intelligence (AI) and operations research (OR) techniques in constraint programming (pp. 427\u2013436). Springer.","DOI":"10.1007\/978-3-319-18008-3_29"},{"key":"632_CR28","unstructured":"Van Cauwelaert, S., Lombardi, M., & Schaus, P. (2016). A visual web tool to perform what-if analysis of optimization approaches. Technical report, UCLouvain."},{"key":"632_CR29","first-page":"210","volume":"23","author":"S Van Cauwelaert","year":"2017","unstructured":"Van Cauwelaert, S., Lombardi, M., & Schaus, P. (2017). How efficient is a global constraint in practice? Constraints, 23, 210\u2013250.","journal-title":"Constraints"},{"key":"632_CR30","unstructured":"Vil\u0131m, P. (2007). Global constraints in scheduling. Ph.D. thesis, Charles University in Prague, Faculty of Mathematics and Physics, Department of Theoretical Computer Science and Mathematical Logic, KTIML MFF, Universita Karlova, Malostransk\u00e9 n\u00e1mest\u0131 2\/25, 118 00 Praha 1, Czech Republic."},{"key":"632_CR31","doi-asserted-by":"crossref","unstructured":"Vil\u0131m, P. (2009a). Edge finding filtering algorithm for discrete cumulative resources in o (kn log n). In I. P. Gent (Ed.), Principles and practice of constraint programming-CP (Vol. 5732, pp. 802\u2013816). Springer.","DOI":"10.1007\/978-3-642-04244-7_62"},{"key":"632_CR32","doi-asserted-by":"crossref","unstructured":"Vil\u00edm, P. (2009b). Max energy filtering algorithm for discrete cumulative resources. In International conference on AI and OR techniques in constriant programming for combinatorial optimization problems (pp. 294\u2013308). Springer.","DOI":"10.1007\/978-3-642-01929-6_22"},{"key":"632_CR33","unstructured":"Vil\u0131m, P., & Bart\u00e1k, R. (2012). Filtering algorithms for batch processing with sequence dependent setup times. In Proceedings of the 6th international conference on AI planning and scheduling, AIPS."},{"key":"632_CR34","volume-title":"Hacker\u2019s delight","author":"HS Warren","year":"2013","unstructured":"Warren, H. S. (2013). Hacker\u2019s delight. London: Pearson Education."},{"key":"632_CR35","first-page":"3205","volume":"154","author":"A Wolf","year":"2009","unstructured":"Wolf, A. (2009). Constraint-based task scheduling with sequence dependent setup times, time windows and breaks. GI Jahrestagung, 154, 3205\u20133219.","journal-title":"GI Jahrestagung"},{"key":"632_CR36","doi-asserted-by":"crossref","unstructured":"Zampelli, S., Vergados, Y., Van\u00a0Schaeren, R., Dullaert, W., & Raa, B. (2013). The berth allocation and quay crane assignment problem using a CP approach. In C. Schulte (Ed.), Principles and practice of constraint programming (pp. 880\u2013896). Springer.","DOI":"10.1007\/978-3-642-40627-0_64"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00632-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-019-00632-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00632-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T10:14:20Z","timestamp":1613297660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-019-00632-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,15]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["632"],"URL":"https:\/\/doi.org\/10.1007\/s10951-019-00632-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,15]]},"assertion":[{"value":"15 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}