{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T05:44:10Z","timestamp":1774158250785,"version":"3.50.1"},"reference-count":49,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004239","name":"Politechnika Pozna\u0144ska","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004239","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013088","name":"Qinglan Project of Jiangsu Province of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013088","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72571139"],"award-info":[{"award-number":["72571139"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72501141"],"award-info":[{"award-number":["72501141"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72571138"],"award-info":[{"award-number":["72571138"]}],"id":[{"id":"10.13039\/501100001809","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,5]]},"DOI":"10.1016\/j.ejor.2025.10.005","type":"journal-article","created":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:19:54Z","timestamp":1759627194000},"page":"745-759","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Benders decompositions for order acceptance and scheduling in additive manufacturing"],"prefix":"10.1016","volume":"330","author":[{"given":"Jian","family":"Chen","sequence":"first","affiliation":[]},{"given":"Xudong","family":"Ye","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7368-1746","authenticated-orcid":false,"given":"Naiming","family":"Xie","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4800-7167","authenticated-orcid":false,"given":"Yao-Wen","family":"Sang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3845-8194","authenticated-orcid":false,"given":"Malgorzata","family":"Sterna","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2025.10.005_bib0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105272","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 & Operations Research"},{"key":"10.1016\/j.ejor.2025.10.005_bib0002","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107115","article-title":"A heuristic approach for a scheduling problem in additive manufacturing under technological constraints","volume":"154","author":"Aloui","year":"2021","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2025.10.005_bib0003","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/j.bushor.2017.05.011","article-title":"The rise of 3-D printing: The advantages of additive manufacturing over traditional manufacturing","volume":"60","author":"Attaran","year":"2017","journal-title":"Business Horizons"},{"key":"10.1016\/j.ejor.2025.10.005_bib0004","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1137\/S0895480196300522","article-title":"Multiprocessor scheduling with rejection","volume":"13","author":"Bartal","year":"2000","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"10.1016\/j.ejor.2025.10.005_bib0005","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"},{"key":"10.1016\/j.ejor.2025.10.005_bib0006","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2023.102228","article-title":"Logic-based Benders decomposition for order acceptance and scheduling in distributed manufacturing","volume":"58","author":"Chen","year":"2023","journal-title":"Advanced Engineering Informatics"},{"key":"10.1016\/j.ejor.2025.10.005_bib0007","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 & Operations Research"},{"key":"10.1016\/j.ejor.2025.10.005_bib0008","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.2025.10.005_bib0009","doi-asserted-by":"crossref","first-page":"2428","DOI":"10.1287\/ijoc.2022.1184","article-title":"Stochastic planning and scheduling with logic-based Benders decomposition","volume":"34","author":"El\u00e7i","year":"2022","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2025.10.005_bib0010","doi-asserted-by":"crossref","first-page":"1471","DOI":"10.1007\/s40314-015-0302-8","article-title":"A Benders decomposition approach for order acceptance and scheduling problem: A robust optimization approach","volume":"36","author":"Emami","year":"2017","journal-title":"Computational and Applied Mathematics"},{"key":"10.1016\/j.ejor.2025.10.005_bib0011","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1080\/0951192X.2015.1068452","article-title":"A Lagrangian relaxation algorithm for order acceptance and scheduling problem: A globalised robust optimisation approach","volume":"29","author":"Emami","year":"2016","journal-title":"International Journal of Computer Integrated Manufacturing"},{"issue":"3","key":"10.1016\/j.ejor.2025.10.005_bib0012","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.1110.0458","article-title":"Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem","volume":"24","author":"Fazel-Zarandi","year":"2012","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"10.1016\/j.ejor.2025.10.005_bib0013","doi-asserted-by":"crossref","first-page":"423","DOI":"10.5267\/j.ijiec.2018.1.001","article-title":"A modified genetic algorithm for time and cost optimization of an additive manufacturing single-machine scheduling","volume":"9","author":"Fera","year":"2018","journal-title":"International Journal of Industrial Engineering Computations"},{"key":"10.1016\/j.ejor.2025.10.005_bib0014","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1057\/s41274-016-0007-4","article-title":"Maximizing the profit in customer\u2019s order acceptance and scheduling problem with weighted tardiness penalty","volume":"68","author":"Geramipour","year":"2017","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2025.10.005_bib0015","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.2025.10.005_bib0016","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"},{"key":"10.1016\/j.ejor.2025.10.005_bib0017","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 & Operations Research"},{"key":"10.1016\/j.ejor.2025.10.005_bib0018","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105847","article-title":"Scheduling unrelated additive manufacturing machines with practical constraints","volume":"144","author":"Hu","year":"2022","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.10.005_bib0019","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1016\/j.apm.2010.09.015","article-title":"A decision support system for order acceptance\/rejection in hybrid MTS\/MTO production systems","volume":"35","author":"Kalantari","year":"2011","journal-title":"Applied Mathematical Modelling"},{"key":"10.1016\/j.ejor.2025.10.005_bib0020","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"},{"key":"10.1016\/j.ejor.2025.10.005_bib0021","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110132","article-title":"Two-stage meta-heuristic for part-packing and build-scheduling problem in parallel additive manufacturing","volume":"136","author":"Lee","year":"2023","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.ejor.2025.10.005_bib0022","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.cor.2017.01.013","article-title":"Production planning in additive manufacturing and 3D printing","volume":"83","author":"Li","year":"2017","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.10.005_bib0023","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.ijpe.2017.11.015","article-title":"Single batch processing machine scheduling with two-dimensional bin packing constraints","volume":"196","author":"Li","year":"2018","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.ejor.2025.10.005_bib0024","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.ejor.2022.05.033","article-title":"Order assignment and scheduling under processing and distribution time uncertainty","volume":"305","author":"Li","year":"2023","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.10.005_bib0025","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.2025.10.005_bib0026","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1007\/s10878-020-00642-9","article-title":"New approximation algorithms for machine scheduling with rejection on single and parallel machine","volume":"40","author":"Liu","year":"2020","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/j.ejor.2025.10.005_bib0027","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.2025.10.005_bib0028","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/s10479-019-03137-x","article-title":"A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: Wheat distribution network","volume":"291","author":"Naderi","year":"2020","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2025.10.005_bib0029","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1016\/j.ejor.2019.10.014","article-title":"Branch-relax-and-check: A tractable decomposition method for order acceptance and identical parallel machine scheduling","volume":"286","author":"Naderi","year":"2020","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.10.005_bib0030","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":"327","author":"Nascimento","year":"2024","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.10.005_bib0031","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.cor.2010.06.003","article-title":"Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment","volume":"38","author":"Nobibon","year":"2011","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.10.005_bib0032","series-title":"Scheduling","author":"Pinedo","year":"2012"},{"key":"10.1016\/j.ejor.2025.10.005_bib0033","doi-asserted-by":"crossref","first-page":"1758","DOI":"10.1016\/j.cor.2008.04.010","article-title":"Order acceptance using genetic algorithms","volume":"36","author":"Rom","year":"2009","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.10.005_bib0034","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/j.ejor.2016.08.024","article-title":"Propagating logic-based Benders\u2019 decomposition approaches for distributed operating room scheduling","volume":"257","author":"Roshanaei","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.10.005_bib0035","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1287\/ijoc.2017.0745","article-title":"Collaborative operating room planning and scheduling","volume":"29","author":"Roshanaei","year":"2017","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2025.10.005_bib0036","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2019.03.001","article-title":"Reformulation, linearization, and decomposition techniques for balanced distributed operating room scheduling","volume":"93","author":"Roshanaei","year":"2020","journal-title":"Omega"},{"issue":"2","key":"10.1016\/j.ejor.2025.10.005_bib0037","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1002\/nav.22222","article-title":"Single machine scheduling with the total weighted late work and rejection cost","volume":"72","author":"Sang","year":"2025","journal-title":"Naval Research Logistics (NRL)"},{"key":"10.1016\/j.ejor.2025.10.005_bib0038","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","article-title":"A survey on offline scheduling with rejection","volume":"16","author":"Shabtay","year":"2013","journal-title":"Journal of Scheduling"},{"issue":"1","key":"10.1016\/j.ejor.2025.10.005_bib0039","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.09.042","article-title":"Order acceptance and scheduling: A taxonomy and review","volume":"212","author":"Slotnick","year":"2011","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.10.005_bib0040","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0305-0548(95)00015-E","article-title":"Selecting jobs for a heavily loaded shop with lateness penalties","volume":"23","author":"Slotnick","year":"1996","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.10.005_bib0041","doi-asserted-by":"crossref","first-page":"3029","DOI":"10.1016\/j.cor.2005.11.012","article-title":"Order acceptance with weighted tardiness","volume":"34","author":"Slotnick","year":"2007","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.10.005_bib0042","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105414","article-title":"Generalized order acceptance and scheduling problem with batch delivery: Models and metaheuristics","volume":"134","author":"Tarhan","year":"2021","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.10.005_bib0043","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1287\/ijoc.2015.0666","article-title":"Decomposition methods for the parallel machine scheduling problem with setups","volume":"28","author":"Tran","year":"2016","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2025.10.005_bib0044","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/j.cie.2018.11.021","article-title":"A hybrid algorithm for order acceptance and scheduling problem in make-to-stock\/make-to-order industries","volume":"127","author":"Wang","year":"2019","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2025.10.005_bib0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109395","article-title":"Order acceptance and scheduling in the instant delivery system","volume":"182","author":"Xue","year":"2023","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2025.10.005_bib0046","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.116908","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"},{"key":"10.1016\/j.ejor.2025.10.005_bib0047","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1016\/j.ejor.2008.10.006","article-title":"Single machine scheduling with release dates and rejection","volume":"198","author":"Zhang","year":"2009","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.10.005_bib0048","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108167","article-title":"Minimizing makespan on parallel batch processing machines with two-dimensional rectangular jobs","volume":"169","author":"Zhou","year":"2022","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2025.10.005_bib0049","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1080\/00207543.2023.2167015","article-title":"An iterated local search for customer order scheduling in additive manufacturing","volume":"62","author":"Zipfel","year":"2024","journal-title":"International Journal of Production Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725008069?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725008069?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T21:53:02Z","timestamp":1773179582000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221725008069"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["S0377221725008069"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2025.10.005","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Benders decompositions for order acceptance and scheduling in additive manufacturing","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2025.10.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}