{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T18:12:37Z","timestamp":1775758357320,"version":"3.50.1"},"reference-count":81,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T00:00:00Z","timestamp":1769040000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100019186","name":"Massachusetts Institute of Technology MIT Portugal Program","doi-asserted-by":"publisher","award":["SFRH\/BD\/151417\/2021"],"award-info":[{"award-number":["SFRH\/BD\/151417\/2021"]}],"id":[{"id":"10.13039\/501100019186","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Foundation for Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["UIDB\/00308\/2020"],"award-info":[{"award-number":["UIDB\/00308\/2020"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["UID\/EMS\/00285\/2020"],"award-info":[{"award-number":["UID\/EMS\/00285\/2020"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["LA\/P\/0112\/2020"],"award-info":[{"award-number":["LA\/P\/0112\/2020"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ejor.2026.01.034","type":"journal-article","created":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T16:49:54Z","timestamp":1769186994000},"page":"19-37","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improving the efficiency of logic-based benders decomposition for p-batch scheduling problems with two-dimensional packing"],"prefix":"10.1016","volume":"333","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4139-1100","authenticated-orcid":false,"given":"Paulo Jorge","family":"Nascimento","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7693-9570","authenticated-orcid":false,"given":"Crist\u00f3v\u00e3o","family":"Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4754-2168","authenticated-orcid":false,"given":"Carlos Henggeler","family":"Antunes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4929-1748","authenticated-orcid":false,"given":"Christos T.","family":"Maravelias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7813-4514","authenticated-orcid":false,"given":"Samuel","family":"Moniz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2026.01.034_bib0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109330","article-title":"On the utility of production scheduling formulations including record keeping variables","volume":"181","author":"Adelgren","year":"2023","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/j.ejor.2026.01.034_bib0002","article-title":"Nested logic-based benders decomposition for an integrated home healthcare problem","author":"Algendi","year":"2025","journal-title":"European Journal of Operational Research"},{"issue":"January 2020","key":"10.1016\/j.ejor.2026.01.034_bib0003","article-title":"A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems","volume":"131","author":"Alicastro","year":"2021","journal-title":"Computers and Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.034_bib0004","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","article-title":"Partitioning procedures for solving mixed-variables programming problems","volume":"4","author":"Benders","year":"1962","journal-title":"Numerische Mathematik"},{"issue":"SUP1","key":"10.1016\/j.ejor.2026.01.034_bib0005","doi-asserted-by":"crossref","first-page":"S93","DOI":"10.1057\/jors.2008.169","article-title":"A tutorial in irregular shape packing problems","volume":"60","author":"Bennell","year":"2009","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2026.01.034_bib0006","series-title":"Handbooks in operations research and management science","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0927-0507(05)12010-6","article-title":"Constraint programming","volume":"12","author":"Bockmayr","year":"2005"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.034_bib0007","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ejor.2006.03.011","article-title":"Complete and robust no-fit polygon generation for the irregular stock cutting problem","volume":"179","author":"Burke","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0008","doi-asserted-by":"crossref","unstructured":"Cappart, Q., Moisan, T., Rousseau, L.-M., Pr\u00e9mont-Schwarz, I., & Cire, A.A. (2021). Combining reinforcement learning and constraint programming for combinatorial optimization. www.aaai.org.","DOI":"10.1609\/aaai.v35i5.16484"},{"key":"10.1016\/j.ejor.2026.01.034_bib0009","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105245","article-title":"Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing","volume":"130","author":"Che","year":"2021","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106706","article-title":"Logic-based benders decomposition for order acceptance and scheduling on heterogeneous factories with carbon caps","volume":"168","author":"Chen","year":"2024","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0011","doi-asserted-by":"crossref","DOI":"10.1016\/j.orp.2019.100125","article-title":"Optimality in nesting problems: New constraint programming models and a new global constraint for non-overlap","volume":"6","author":"Cherri","year":"2019","journal-title":"Operations Research Perspectives"},{"issue":"5","key":"10.1016\/j.ejor.2026.01.034_bib0012","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1017\/S0269888916000254","article-title":"Logic-based benders decomposition for planning and scheduling: A computational analysis","volume":"31","author":"Cir\u00e9","year":"2016","journal-title":"Knowledge Engineering Review"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.034_bib0013","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/opre.2013.1248","article-title":"Combinatorial benders\u2019 cuts for the strip packing problem","volume":"62","author":"C\u00f4t\u00e9","year":"2014","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.034_bib0014","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1287\/ijoc.2020.1014","article-title":"Combinatorial benders decomposition for the two-dimensional bin packing problem","volume":"33","author":"C\u00f4t\u00e9","year":"2021","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2026.01.034_bib0015","unstructured":"Dawson-Haggerty et al. (2019). Trimesh. https:\/\/trimesh.org\/."},{"key":"10.1016\/j.ejor.2026.01.034_bib0016","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.cor.2016.09.009","article-title":"Logic based Benders\u2019 decomposition for orthogonal stock cutting problems","volume":"78","author":"Delorme","year":"2017","journal-title":"Computers and Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.034_bib0017","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Mathematical Programming, Series B"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.034_bib0018","doi-asserted-by":"crossref","first-page":"401","DOI":"10.5267\/j.ijiec.2020.1.001","article-title":"A modified tabu search algorithm for the single-machine scheduling problem using additive manufacturing technology","volume":"11","author":"Fera","year":"2020","journal-title":"International Journal of Industrial Engineering Computations"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.034_bib0019","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2021.06.012","article-title":"A survey of scheduling with parallel batch (p-batch) processing","volume":"298","author":"Fowler","year":"2022","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejor.2024.04.013","article-title":"An accelerated benders decomposition algorithm for the solution of the multi-trip time-dependent vehicle routing problem with time windows","author":"Fragkogios","year":"2024","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2026.01.034_bib0021","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","article-title":"Generalized benders decomposition","volume":"10","author":"Geoffrion","year":"1972","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.034_bib0022","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0734-189X(90)90160-W","article-title":"A solution of polygon containment, spatial planning, and other related problems using Minkowski operations","volume":"49","author":"Ghosh","year":"1990","journal-title":"Computer Vision, Graphics, and Image Processing"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.034_bib0023","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1016\/j.ejor.2023.06.006","article-title":"Capacity reservation for humanitarian relief: A logic-based benders decomposition method with subgradient cut","volume":"311","author":"Guo","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.034_bib0024","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1287\/opre.1060.0371","article-title":"Planning and scheduling by logic-based benders decomposition","volume":"55","author":"Hooker","year":"2007","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0025","first-page":"1","article-title":"Logic-based benders decomposition for large-scale optimization","volume":"149","author":"Hooker","year":"2019"},{"key":"10.1016\/j.ejor.2026.01.034_bib0026","series-title":"Logic-Based benders decomposition","author":"Hooker","year":"2024"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.034_bib0027","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","article-title":"Logic-based benders decomposition","volume":"96","author":"Hooker","year":"2003","journal-title":"Mathematical Programming, Series B"},{"key":"10.1016\/j.ejor.2026.01.034_bib0028","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106474","article-title":"Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints","volume":"162","author":"Hu","year":"2024","journal-title":"Computers and Operations Research"},{"issue":"February","key":"10.1016\/j.ejor.2026.01.034_bib0029","article-title":"Scheduling unrelated additive manufacturing machines with practical constraints","volume":"144","author":"Hu","year":"2022","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0030","doi-asserted-by":"crossref","unstructured":"Huertas, J.A., & Van Hentenryck, P. (2025). Parallel batch scheduling with incompatible job families via constraint programming. http:\/\/arxiv.org\/abs\/2410.11981.","DOI":"10.1109\/TSM.2025.3601510"},{"key":"10.1016\/j.ejor.2026.01.034_bib0031","series-title":"Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Vol. 12735 lncs","first-page":"45","article-title":"Strengthening of feasibility cuts in logic-based benders decomposition","author":"Karlsson","year":"2021"},{"key":"10.1016\/j.ejor.2026.01.034_bib0032","series-title":"Proceedings of the 20th National Conference on Artificial Intelligence - Volume 1","first-page":"390","article-title":"Generalized nogoods in CSPs","author":"Katsirelos","year":"2005"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.034_bib0033","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1002\/prot.21117","article-title":"PIPER: An FFT-based protein docking program with pairwise potentials","volume":"65","author":"Kozakov","year":"2006","journal-title":"Proteins: Structure, Function and Genetics"},{"key":"10.1016\/j.ejor.2026.01.034_bib0034","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.cor.2019.01.006","article-title":"MILP models to minimise makespan in additive manufacturing machine scheduling problems","volume":"105","author":"Kucukkoc","year":"2019","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.034_bib0035","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1016\/j.ejor.2025.03.022","article-title":"Including mechanical requirements in a bi-objective nesting and scheduling model for additive manufacturing","volume":"325","author":"Kucukkoc","year":"2025","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.034_bib0036","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s11047-022-09911-4","article-title":"Pure and mixed lexicographic-paretian many-objective optimization: State of the art","volume":"22","author":"Lai","year":"2023","journal-title":"Natural Computing"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.034_bib0037","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1016\/j.ejor.2019.04.045","article-title":"Irregular packing problems: A review of mathematical models","volume":"282","author":"Leao","year":"2020","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0038","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107167","article-title":"Scheduling for two stages with a single machine and a job shop","volume":"183","author":"Lee","year":"2025","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0039","doi-asserted-by":"crossref","DOI":"10.1080\/00207543.2025.2557013","article-title":"The energy-aware nesting and scheduling problem on a single selective laser melting machine: Mathematical model and solution approach","author":"Lin","year":"2025","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0040","article-title":"Integrated scheduling and nesting optimization for hybrid additive\/formative\/subtractive manufacturing cells: A multi-objective heuristic approach","author":"Liu","year":"2025","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.034_bib0041","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.jmse.2022.10.001","article-title":"A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing","volume":"8","author":"Liu","year":"2023","journal-title":"Journal of Management Science and Engineering"},{"key":"10.1016\/j.ejor.2026.01.034_bib0042","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109318","article-title":"Improving additive Manufacturing production planning: A sub-second pixel-based packing algorithm","volume":"181","author":"Lu","year":"2023","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.034_bib0043","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1287\/opre.29.3.464","article-title":"Accelerating benders decomposition: Algorithmic enhancement and model selection criteria","volume":"29","author":"Magnanti","year":"1981","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.034_bib0044","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1016\/j.ejor.2024.05.001","article-title":"Combinatorial benders decomposition for single machine scheduling in additive manufacturing with two-dimensional packing constraints","volume":"317","author":"Mao","year":"2024","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0045","doi-asserted-by":"crossref","DOI":"10.1108\/JMTM-02-2023-0047","article-title":"A decision-support framework for selecting additive manufacturing technologies","author":"Maranha","year":"2023","journal-title":"Journal of Manufacturing Technology Management"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.034_bib0046","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.compchemeng.2005.09.011","article-title":"A decomposition framework for the scheduling of single- and multi-stage processes","volume":"30","author":"Maravelias","year":"2006","journal-title":"Computers and Chemical Engineering"},{"issue":"10","key":"10.1016\/j.ejor.2026.01.034_bib0047","doi-asserted-by":"crossref","first-page":"1921","DOI":"10.1016\/j.compchemeng.2004.03.016","article-title":"A hybrid MILP\/CP decomposition approach for the continuous time scheduling of multipurpose batch plants","volume":"28","author":"Maravelias","year":"2004","journal-title":"Computers and Chemical Engineering"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.034_bib0048","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.amc.2009.03.037","article-title":"Effective implementation of the \u03b5-constraint method in Multi-Objective mathematical programming problems","volume":"213","author":"Mavrotas","year":"2009","journal-title":"Applied Mathematics and Computation"},{"key":"10.1016\/j.ejor.2026.01.034_bib0049","series-title":"Integration of ai and or techniques in constraint programming for combinatorial optimization problems. cpaior 2012. lecture notes in computer science","first-page":"228","article-title":"Activity-based search for black-box constraint programming solvers","volume":"7298","author":"Michel","year":"2012"},{"issue":"11","key":"10.1016\/j.ejor.2026.01.034_bib0050","doi-asserted-by":"crossref","first-page":"2731","DOI":"10.1016\/j.cor.2004.04.001","article-title":"Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times","volume":"32","author":"M\u00f6nch","year":"2005","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0051","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.106014","article-title":"Two dimensional guillotine cutting stock and scheduling problem in printing industry","volume":"148","author":"Mostajabdaveh","year":"2022","journal-title":"Computers and Operations Research"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2026.01.034_bib0052","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1080\/00207543.2017.1394598","article-title":"A general heuristic for two-dimensional nesting problems with limited-size containers","volume":"56","author":"Mundim","year":"2018","journal-title":"International Journal of Production Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.034_bib0053","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.ejor.2024.03.004","article-title":"Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems","volume":"317","author":"Nascimento","year":"2024","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0054","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106592","article-title":"Nesting and scheduling optimization of additive manufacturing systems: Mapping the territory","volume":"165","author":"Pinto","year":"2024","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0055","article-title":"Just-in-time two-dimensional bin packing","volume":"102","author":"Polyakovskiy","year":"2021","journal-title":"Omega (United Kingdom)"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.034_bib0056","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","article-title":"The Benders decomposition algorithm: A literature review","volume":"259","author":"Rahmaniani","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0057","series-title":"Principles and practice of constraint programming \u2013 cp 2004. cp 2004. lecture notes in computer science","first-page":"557","article-title":"Impact-based search strategies for constraint programming","volume":"3258","author":"Refalo","year":"2004"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.034_bib0058","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/ijoc.1040.0110","article-title":"Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates","volume":"18","author":"Sadykov","year":"2006","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2026.01.034_bib0059","article-title":"Computational evaluation of cut strengthening techniques in logic based benders \u2019 Decomposition","volume":"4","author":"Saken","year":"2023"},{"key":"10.1016\/j.ejor.2026.01.034_bib0060","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2021.104603","article-title":"Learning variable ordering heuristics for solving constraint satisfaction problems","volume":"109","author":"Song","year":"2022","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.1016\/j.ejor.2026.01.034_bib0061","doi-asserted-by":"crossref","unstructured":"Stuckey, P.J. (2010). Lazy clause generation: Combining the power of SAT and CP (and MIP?) solving (pp. 5\u20139). https:\/\/doi.org\/10.1007\/978-3-642-13520-0_3.","DOI":"10.1007\/978-3-642-13520-0_3"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.034_bib0062","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1038\/s44334-024-00005-w","article-title":"Multi-material vat photopolymerization 3D printing: A review of mechanisms and applications","volume":"1","author":"Subedi","year":"2024","journal-title":"Npj Advanced Manufacturing"},{"issue":"September 2021","key":"10.1016\/j.ejor.2026.01.034_bib0063","article-title":"Sustainable negotiation-based nesting and scheduling in additive manufacturing systems : A case study and multi-objective meta-heuristic algorithms","volume":"112","author":"Tafakkori","year":"2022","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.034_bib0064","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.ijpe.2013.04.009","article-title":"The dotted-Board Model: A new MIP model for nesting irregular shapes","volume":"145","author":"Toledo","year":"2013","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.ejor.2026.01.034_bib0065","doi-asserted-by":"crossref","unstructured":"Varga, J., Karlsson, E., Raidl, G.R., R\u00f6nnberg, E., Lindsten, F., & Rodemann, T. (2024). Speeding up logic-based benders decomposition by strengthening cuts with graph neural networks (Vol. 1, Issue Ml, pp. 24\u201338). https:\/\/doi.org\/10.1007\/978-3-031-53969-5_3.","DOI":"10.1007\/978-3-031-53969-5_3"},{"issue":"10","key":"10.1016\/j.ejor.2026.01.034_bib0066","doi-asserted-by":"crossref","first-page":"3832","DOI":"10.1021\/ie303421h","article-title":"Reformulations and branching methods for mixed-integer programming chemical production scheduling models","volume":"52","author":"Velez","year":"2013","journal-title":"Industrial and Engineering Chemistry Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.034_bib0067","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.ejor.2023.08.050","article-title":"Flexibility in manufacturing system design: A review of recent approaches from Operations Research","volume":"315","author":"Weckenborg","year":"2024","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0068","doi-asserted-by":"crossref","DOI":"10.1080\/00207543.2025.2513575","article-title":"Nesting and scheduling for parallel additive manufacturing machines with uncertain processing times: A simulation-optimisation approach","author":"Wu","year":"2025","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0069","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107044","article-title":"Logic-based benders decomposition methods for the distributed permutation flow shop scheduling problem with production and transportation cost","volume":"179","author":"Xiong","year":"2025","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0070","doi-asserted-by":"crossref","DOI":"10.1080\/00207543.2025.2512228","article-title":"A combinatorial Benders decomposition approach for the constrained two-dimensional guillotine cutting problem with defects","author":"Yao","year":"2025","journal-title":"International Journal of Production Research"},{"issue":"January","key":"10.1016\/j.ejor.2026.01.034_bib0071","article-title":"Adjusted Iterated Greedy for the optimization of additive manufacturing scheduling problems","volume":"198","author":"Ying","year":"2022","journal-title":"Expert Systems With Applications"},{"issue":"10","key":"10.1016\/j.ejor.2026.01.034_bib0072","doi-asserted-by":"crossref","first-page":"1521","DOI":"10.1016\/j.ifacol.2022.09.606","article-title":"Mathematical models for minimizing total tardiness on parallel additive manufacturing machines","volume":"55","author":"Yu","year":"2022","journal-title":"IFAC PapersOnLine"},{"issue":"7","key":"10.1016\/j.ejor.2026.01.034_bib0073","doi-asserted-by":"crossref","first-page":"2212","DOI":"10.1080\/00207543.2021.1885068","article-title":"Constraint programming approach for multi-resource-constrained unrelated parallel machine scheduling problem with sequence-dependent setup times","volume":"60","author":"Yunusoglu","year":"2022","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0074","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106665","article-title":"A stabilised benders decomposition with adaptive oracles for large-scale stochastic programming with short-term and long-term uncertainty","volume":"167","author":"Zhang","year":"2024","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2026.01.034_bib0075","article-title":"Solving LBBD master problems with constraint programming and domain-independent dynamic programming","volume":"307","author":"Zhang","year":"2024","journal-title":"Leibniz International Proceedings in Informatics, LIPIcs"},{"key":"10.1016\/j.ejor.2026.01.034_bib0076","article-title":"Improved evolutionary algorithm for parallel batch processing machine scheduling in additive manufacturing","volume":"7543","author":"Zhang","year":"2020","journal-title":"International Journal of Production Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.034_bib0077","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1109\/TR.2022.3201333","article-title":"Parallel batch processing machine scheduling under two-dimensional bin-packing constraints","volume":"72","author":"Zhang","year":"2023","journal-title":"IEEE Transactions on Reliability"},{"key":"10.1016\/j.ejor.2026.01.034_bib0078","doi-asserted-by":"crossref","DOI":"10.1016\/j.cag.2024.103996","article-title":"Dynamics simulation-based packing of irregular 3D objects","volume":"123","author":"Zhuang","year":"2024","journal-title":"Computers and Graphics (Pergamon)"},{"key":"10.1016\/j.ejor.2026.01.034_bib0079","article-title":"Scheduling for additive manufacturing with two-dimensional packing and incompatible items","volume":"129","author":"Zipfel","year":"2024","journal-title":"Omega (United Kingdom)"},{"key":"10.1016\/j.ejor.2026.01.034_bib0080","article-title":"An iterated local search for customer order scheduling in additive manufacturing","author":"Zipfel","year":"2023","journal-title":"International Journal of Production Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.034_bib0081","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2024.10.040","article-title":"A new branch-and-cut approach for integrated planning in additive manufacturing","volume":"322","author":"Zipfel","year":"2025","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726000767?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726000767?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T17:22:15Z","timestamp":1775755335000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221726000767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":81,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["S0377221726000767"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2026.01.034","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Improving the efficiency of logic-based benders decomposition for p-batch scheduling problems with two-dimensional packing","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2026.01.034","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}