{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T22:00:58Z","timestamp":1763676058622,"version":"3.45.0"},"reference-count":58,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T00:00:00Z","timestamp":1761004800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004385","name":"Universiteit Gent","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004385","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012220","name":"Hercules Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100012220","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011878","name":"Vlaamse regering","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011878","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1016\/j.cor.2025.107308","type":"journal-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T22:18:52Z","timestamp":1760998732000},"page":"107308","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Comparing and extending satisfiability solution methods for the resource-constrained project scheduling problem"],"prefix":"10.1016","volume":"186","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5855-284X","authenticated-orcid":false,"given":"Jos\u00e9","family":"Coelho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6702-3563","authenticated-orcid":false,"given":"Mario","family":"Vanhoucke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2025.107308_b1","doi-asserted-by":"crossref","unstructured":"Ab\u00edo, I., Gange, G., Mayer-Eichberger, V., Stuckey, P.J., 2016. On CNF encodings of decision diagrams. In: Proceedings of the 13th International Conference on Integration of AI and OR Techniques in Constraint Programming. CPAIOR, pp. 1\u201317.","DOI":"10.1007\/978-3-319-33954-2_1"},{"key":"10.1016\/j.cor.2025.107308_b2","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1613\/jair.3653","article-title":"A new look at BDDs for pseudo-boolean constraints","volume":"45","author":"Ab\u00edo","year":"2012","journal-title":"J. Artif. Intell. Res."},{"year":"2008","series-title":"Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications","author":"Artigues","key":"10.1016\/j.cor.2025.107308_b3"},{"key":"10.1016\/j.cor.2025.107308_b4","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.ejor.2025.03.024","article-title":"Fifty years of research in resource-constrained project scheduling explored from different perspectives","volume":"328","author":"Artigues","year":"2026","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b5","series-title":"Handbook on Project Management and Scheduling","first-page":"17","article-title":"Mixed-integer linear programming formulations","author":"Artigues","year":"2015"},{"key":"10.1016\/j.cor.2025.107308_b6","first-page":"191","article-title":"A translation of pseudo-boolean constraints to SAT","volume":"2","author":"Bailleux","year":"2006","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"10.1016\/j.cor.2025.107308_b7","series-title":"Theory and Applications of Satisfiability Testing","first-page":"181","article-title":"New encodings of pseudo-boolean constraints into CNF","author":"Bailleux","year":"2009"},{"key":"10.1016\/j.cor.2025.107308_b8","series-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","first-page":"313","article-title":"A constraint integer programming approach for resource-constrained project scheduling","author":"Berthold","year":"2010"},{"key":"10.1016\/j.cor.2025.107308_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2021.103604","article-title":"Sat encodings for pseudo-boolean constraints together with at-most-one constraints","volume":"302","author":"Bofill","year":"2022","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.cor.2025.107308_b10","doi-asserted-by":"crossref","unstructured":"Bofill, M., Coll, J., Suy, J., Villaret, M., 2017. Compact mdds for pseudo-boolean constraints with at-most-one relations in resource-constrained scheduling problems. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence. IJCAI, pp. 555\u2013562.","DOI":"10.24963\/ijcai.2017\/78"},{"key":"10.1016\/j.cor.2025.107308_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106777","article-title":"Smt encodings for resource-constrained project scheduling problems","volume":"149","author":"Bofill","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2025.107308_b12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","article-title":"Resource-constrained project scheduling: Notation, classification, models, and methods","volume":"112","author":"Brucker","year":"1999","journal-title":"European J. Oper. Res."},{"year":"2006","series-title":"Complex Scheduling (GOR-Publications)","author":"Brucker","key":"10.1016\/j.cor.2025.107308_b13"},{"issue":"3","key":"10.1016\/j.cor.2025.107308_b14","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/0377-2217(87)90240-2","article-title":"Project scheduling with resource constraints: A branch and bound approach","volume":"29","author":"Christofides","year":"1987","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2011.03.019","article-title":"Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers","volume":"213","author":"Coelho","year":"2011","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.cor.2018.01.017","article-title":"An exact composite lower bound strategy for the resource-constrained project scheduling problem","volume":"93","author":"Coelho","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b17","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.104976","article-title":"Going to the core of hard resource-constrained project scheduling instances","volume":"121","author":"Coelho","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b18","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106165","article-title":"New resource-constrained project scheduling instances for testing (meta-)heuristic scheduling algorithms","volume":"153","author":"Coelho","year":"2023","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b19","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1016\/j.ejor.2019.07.056","article-title":"A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints","volume":"289","author":"de Azevedo","year":"2021","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b20","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1016\/j.ejor.2004.08.020","article-title":"A hybrid scatter search\/electromagnetism meta-heuristic for project scheduling","volume":"169","author":"Debels","year":"2006","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b21","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/11740698_23","article-title":"The electromagnetism meta-heuristic applied to the resource-constrained project scheduling problems","volume":"3871","author":"Debels","year":"2006","journal-title":"Lecture Notes in Comput. Sci."},{"key":"10.1016\/j.cor.2025.107308_b22","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1287\/opre.1060.0358","article-title":"A decomposition-based genetic algorithm for the resource-constrained project scheduling problems","volume":"55","author":"Debels","year":"2007","journal-title":"Oper. Res."},{"year":"2002","series-title":"Project Scheduling: A Research Handbook","author":"Demeulemeester","key":"10.1016\/j.cor.2025.107308_b23"},{"key":"10.1016\/j.cor.2025.107308_b24","first-page":"1","article-title":"Translating pseudo-boolean constraints into SAT","volume":"2","author":"E\u00e9n","year":"2006","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"10.1016\/j.cor.2025.107308_b25","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0377-2217(94)00184-E","article-title":"Activity nets: A guided tour through some recent developments","volume":"82","author":"Elmaghraby","year":"1995","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","article-title":"A survey of variants and extensions of the resource-constrained project scheduling problem","volume":"207","author":"Hartmann","year":"2010","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2025.107308_b27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2021.05.004","article-title":"An updated survey of variants and extensions of the resource-constrained project scheduling problem","volume":"297","author":"Hartmann","year":"2021","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b28","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0305-0548(97)00055-5","article-title":"Resource-constrained project scheduling: A survey of recent developments","volume":"25","author":"Herroelen","year":"1998","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b29","series-title":"Project Scheduling - Recent Models, Algorithms and Applications","first-page":"1","article-title":"A classification scheme for project scheduling problems","author":"Herroelen","year":"1999"},{"key":"10.1016\/j.cor.2025.107308_b30","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10479-010-0693-2","article-title":"A boolean satisfiability approach to the resource-constrained project scheduling problem","volume":"181","author":"Horbach","year":"2010","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b31","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1108\/01443579310046454","article-title":"Project scheduling problems: A survey","volume":"13","author":"Icmeli","year":"1993","journal-title":"Int. J. Oper. Prod. Manage."},{"key":"10.1016\/j.cor.2025.107308_b32","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/S0377-2217(97)00442-6","article-title":"Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling","volume":"112","author":"Klein","year":"1999","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b33","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","article-title":"PSPLIB \u2014 A project scheduling problem library","volume":"96","author":"Kolisch","year":"1996","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b34","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","article-title":"Propagation via lazy clause generation","volume":"14","author":"Ohrimenko","year":"2009","journal-title":"Constraints"},{"key":"10.1016\/j.cor.2025.107308_b35","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1080\/07408179508936773","article-title":"A survey on the resource-constrained project scheduling problem","volume":"27","author":"\u00d6zdamar","year":"1995","journal-title":"IIE Trans."},{"issue":"2","key":"10.1016\/j.cor.2025.107308_b36","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ejor.2019.01.063","article-title":"A survey of hybrid metaheuristics for the resource-constrained project scheduling problem","volume":"280","author":"Pellerin","year":"2020","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b37","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/mnsc.16.1.93","article-title":"Multi-project scheduling with limited resources: A zero\u2013one programming approach","volume":"16","author":"Pritsker","year":"1969","journal-title":"Manag. Sci."},{"key":"10.1016\/j.cor.2025.107308_b38","first-page":"1","article-title":"On the generalization of constraint programming and boolean satisfiability solving techniques to schedule a resource-constrained project consisting of multi-mode jobs","volume":"4","author":"Schnell","year":"2017","journal-title":"Oper. Res. Perspect."},{"key":"10.1016\/j.cor.2025.107308_b39","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/s10601-010-9103-2","article-title":"Explaining the cumulative propagator","volume":"16","author":"Schutt","year":"2011","journal-title":"Constraints"},{"key":"10.1016\/j.cor.2025.107308_b40","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10951-012-0285-x","article-title":"Solving RCPSP\/max by lazy clause generation","volume":"16","author":"Schutt","year":"2013","journal-title":"J. Sched."},{"key":"10.1016\/j.cor.2025.107308_b41","series-title":"Handbook on Project Management and Scheduling","volume":"vol. 1","author":"Schwindt","year":"2015"},{"key":"10.1016\/j.cor.2025.107308_b42","series-title":"Handbook on Project Management and Scheduling","volume":"vol. 2","author":"Schwindt","year":"2015"},{"key":"10.1016\/j.cor.2025.107308_b43","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1016\/j.ejor.2024.02.041","article-title":"A genetic algorithm for the resource-constrained project scheduling problem with alternative subgraphs using a boolean satisfiability solver","volume":"316","author":"Servranckx","year":"2024","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b44","first-page":"252","article-title":"Multiple resource-constrained scheduling using branch-and-bound","volume":"10","author":"Stinson","year":"1978","journal-title":"IIE Trans."},{"key":"10.1016\/j.cor.2025.107308_b45","series-title":"Studies in Constructive Mathematics and Mathematical Logic","first-page":"115","article-title":"On the complexity of derivation in propositional calculus","author":"Tseitin","year":"1970"},{"key":"10.1016\/j.cor.2025.107308_b46","series-title":"On the Complexity of Derivation in Propositional Calculus","first-page":"466","author":"Tseitin","year":"1983"},{"key":"10.1016\/j.cor.2025.107308_b47","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/s10479-023-05470-8","article-title":"On the summary measures for the resource-constrained project scheduling problem","volume":"337","author":"Van Eynde","year":"2024","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b48","doi-asserted-by":"crossref","first-page":"1983","DOI":"10.1080\/00207540802010781","article-title":"A scatter search heuristic for maximising the net present value of a resource-constrained project with fixed activity cash flow","volume":"48","author":"Vanhoucke","year":"2010","journal-title":"Int. J. Prod. Res."},{"year":"2012","series-title":"Project Management with Dynamic Scheduling: Baseline Scheduling, Risk Analysis and Project Control, vol. XVIII","author":"Vanhoucke","key":"10.1016\/j.cor.2025.107308_b49"},{"key":"10.1016\/j.cor.2025.107308_b50","series-title":"Business Guides on the Go","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-71507-5","article-title":"A quest for projects with scarce resources: Seeking schedule intelligence through project data discovery","author":"Vanhoucke","year":"2024"},{"key":"10.1016\/j.cor.2025.107308_b51","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/j.ejor.2015.08.044","article-title":"An approach using SAT solvers for the RCPSP with logical constraints","volume":"249","author":"Vanhoucke","year":"2016","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b52","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.cie.2018.02.001","article-title":"A tool to test and validate algorithms for the resource-constrained project scheduling problem","volume":"118","author":"Vanhoucke","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2025.107308_b53","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.cor.2019.05.004","article-title":"Resource-constrained project scheduling with activity splitting and setup times","volume":"109","author":"Vanhoucke","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b54","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105260","article-title":"An analysis of network and resource indicators for resource-constrained project scheduling problem instances","volume":"132","author":"Vanhoucke","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b55","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/j.ejor.2024.07.016","article-title":"A matheuristic for the resource- constrained project scheduling problem","volume":"319","author":"Vanhoucke","year":"2024","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b56","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106567","article-title":"Reducing the feasible solution space of resource-constrained project instances","volume":"165","author":"Vanhoucke","year":"2024","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b57","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/j.ejor.2007.03.032","article-title":"An evaluation of the adequacy of project network generators with systematically sampled networks","volume":"187","author":"Vanhoucke","year":"2008","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2025.107308_b58","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1287\/mnsc.47.8.1113.10226","article-title":"On maximizing the net present value of a project under renewable resource constraints","volume":"47","author":"Vanhoucke","year":"2001","journal-title":"Manag. Sci."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054825003375?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054825003375?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T21:44:19Z","timestamp":1763675059000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054825003375"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":58,"alternative-id":["S0305054825003375"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2025.107308","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[2026,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Comparing and extending satisfiability solution methods for the resource-constrained project scheduling problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2025.107308","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107308"}}