{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T17:51:15Z","timestamp":1773683475062,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T00:00:00Z","timestamp":1771200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T00:00:00Z","timestamp":1771200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"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":["52305557"],"award-info":[{"award-number":["52305557"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2024A1515011930"],"award-info":[{"award-number":["2024A1515011930"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Additive manufacturing (AM), also known as 3D printing, offers innovative solutions for customized production. This paper addresses an AM scheduling problem on unrelated parallel machines that considers different part release times. A mixed integer linear programming (MILP) model aimed at minimizing makespan is developed, enhanced by valid inequalities and symmetry-breaking constraints. We propose a logic-based Benders decomposition (LBBD) algorithm to divide the problem into a master problem (MP), which determines part assignment and grouping into batches, and multiple subproblems (SPs) that sequence the batches on each AM machine. An earliest release date (ERD) rule is introduced to quickly solve subproblems. Three feasibility cuts and two optimality cuts are proposed and combined into eight types of cuts for the master problem. In addition, a new heuristic is developed to quickly obtain an upper bound of the problem. Computational results across various instance sizes demonstrate the performance of the proposed LBBD algorithm, as well as the effectiveness of the proposed symmetry-breaking constraints and various types of cuts.<\/jats:p>","DOI":"10.1007\/s10479-026-07087-z","type":"journal-article","created":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T04:52:50Z","timestamp":1771217570000},"page":"1169-1198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Logic-based Benders decomposition for additive manufacturing scheduling on unrelated parallel machines"],"prefix":"10.1007","volume":"358","author":[{"given":"Jian","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjing","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4471-8671","authenticated-orcid":false,"given":"Mingyue","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiheng","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,16]]},"reference":[{"key":"7087_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105272","volume":"131","author":"M Alicastro","year":"2021","unstructured":"Alicastro, M., Ferone, D., Festa, P., Fugaro, S., & Pastore, T. (2021). A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems. Computers & Operations Research, 131, Article 105272.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"7087_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.ejor.2021.10.020","volume":"301","author":"FT Altekin","year":"2022","unstructured":"Altekin, F. T., & Bukchin, Y. (2022). A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing. European Journal of Operational Research, 301(1), 235\u2013253.","journal-title":"European Journal of Operational Research"},{"key":"7087_CR3","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00170-018-1932-y","volume":"97","author":"I Bahnini","year":"2018","unstructured":"Bahnini, I., Rivette, M., Rechia, A., Siadat, A., & Elmesbahi, A. (2018). Additive manufacturing technology: the status, applications, and prospects. The International Journal of Advanced Manufacturing Technology, 97, 147\u2013161.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"7087_CR4","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J Benders","year":"1962","unstructured":"Benders, J. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4, 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"7087_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105845","volume":"145","author":"ME Bruni","year":"2022","unstructured":"Bruni, M. E., Khodaparasti, S., & Moshref-Javadi, M. (2022). A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones. Computers & Operations Research, 145, Article 105845.","journal-title":"Computers & Operations Research"},{"key":"7087_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2023.102228","volume":"58","author":"J Chen","year":"2023","unstructured":"Chen, J., Ma, W., Ye, X., & Zhao, Z. (2023). Logic-based Benders decomposition for order acceptance and scheduling in distributed manufacturing. Advanced Engineering Informatics, 58, Article 102228.","journal-title":"Advanced Engineering Informatics"},{"key":"7087_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106706","volume":"168","author":"J Chen","year":"2024","unstructured":"Chen, J., Ye, X., Ma, W., & Xu, D. (2024). Logic-based Benders decomposition for order acceptance and scheduling on heterogeneous factories with carbon caps. Computers & Operations Research, 168, Article 106706.","journal-title":"Computers & Operations Research"},{"key":"7087_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.cor.2018.07.007","volume":"101","author":"L Fanjul-Peyro","year":"2019","unstructured":"Fanjul-Peyro, L., Ruiz, R., & Perea, F. (2019). Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times. Computers & Operations Research, 101, 173\u2013182.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"7087_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.5267\/j.ijiec.2018.1.001","volume":"9","author":"M Fera","year":"2018","unstructured":"Fera, M., Fruggiero, F., Lambiase, A., Macchiaroli, R., & Todisco, V. (2018). A modified genetic algorithm for time and cost optimization of an additive manufacturing single-machine scheduling. International Journal of Industrial Engineering Computations, 9(4), 423\u2013438.","journal-title":"International Journal of Industrial Engineering Computations"},{"issue":"3","key":"7087_CR10","doi-asserted-by":"publisher","first-page":"401","DOI":"10.5267\/j.ijiec.2020.1.001","volume":"11","author":"M Fera","year":"2020","unstructured":"Fera, M., Macchiaroli, R., Fruggiero, F., & Lambiase, A. (2020). A modified tabu search algorithm for the single-machine scheduling problem using additive manufacturing technology. International Journal of Industrial Engineering Computations, 11(3), 401\u2013414.","journal-title":"International Journal of Industrial Engineering Computations"},{"issue":"3","key":"7087_CR11","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1016\/j.ejor.2023.07.032","volume":"312","author":"M Forbes","year":"2024","unstructured":"Forbes, M., Harris, M., Jansen, H., van der Schoot, F., & Taimre, T. (2024). Combining optimisation and simulation using logic-based Benders decomposition. European Journal of Operational Research, 312(3), 840\u2013854.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"7087_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2021.06.012","volume":"298","author":"JW Fowler","year":"2022","unstructured":"Fowler, J. W., & M\u00f6nch, L. (2022). A survey of scheduling with parallel batch (p-batch) processing. European Journal of Operational Research, 298(1), 1\u201324.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"7087_CR13","doi-asserted-by":"publisher","first-page":"3118","DOI":"10.1080\/00207543.2015.1115909","volume":"54","author":"J Gardan","year":"2016","unstructured":"Gardan, J. (2016). Additive manufacturing technologies: state of the art and trends. International Journal of Production Research, 54(10), 3118\u20133132.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"7087_CR14","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1016\/j.ejor.2015.11.020","volume":"251","author":"R Gedik","year":"2016","unstructured":"Gedik, R., Rainwater, C., Nachtmann, H., & Pohl, E. A. (2016). Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals. European Journal of Operational Research, 251(2), 640\u2013650.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"7087_CR15","first-page":"1551","volume":"33","author":"C Guo","year":"2021","unstructured":"Guo, C., Bodur, M., Aleman, D. M., & Urbach, D. R. (2021). Logic-based benders decomposition and binary decision diagram based approaches for stochastic distributed operating room scheduling. INFORMS Journal on Computing, 33(4), 1551\u20131569.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"7087_CR16","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1016\/j.ejor.2023.06.006","volume":"311","author":"P Guo","year":"2023","unstructured":"Guo, P., & Zhu, J. (2023). Capacity reservation for humanitarian relief: A logic-based Benders decomposition method with subgradient cut. European Journal of Operational Research, 311(3), 942\u2013970.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"7087_CR17","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1002\/joom.1014","volume":"65","author":"CPT Hedenstierna","year":"2019","unstructured":"Hedenstierna, C. P. T., Disney, S. M., Eyers, D. R., Holmstr\u00f6m, J., Syntetos, A. A., & Wang, X. (2019). Economies of collaboration in build-to-model operations. Journal of Operations Management, 65(8), 753\u2013773.","journal-title":"Journal of Operations Management"},{"issue":"3","key":"7087_CR18","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1287\/opre.1060.0371","volume":"55","author":"JN Hooker","year":"2007","unstructured":"Hooker, J. N. (2007). Planning and scheduling by logic-based Benders decomposition. Operations research, 55(3), 588\u2013602.","journal-title":"Operations research"},{"issue":"1","key":"7087_CR19","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"JN Hooker","year":"2003","unstructured":"Hooker, J. N., & Ottosson, G. (2003). Logic-based Benders decomposition. Mathematical Programming, 96(1), 33\u201360.","journal-title":"Mathematical Programming"},{"key":"7087_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105847","volume":"144","author":"K Hu","year":"2022","unstructured":"Hu, K., Che, Y., & Zhang, Z. (2022). Scheduling unrelated additive manufacturing machines with practical constraints. Computers & Operations Research, 144, Article 105847.","journal-title":"Computers & Operations Research"},{"key":"7087_CR21","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1016\/j.jmapro.2023.10.024","volume":"107","author":"K Kanishka","year":"2023","unstructured":"Kanishka, K., & Acherjee, B. (2023). Revolutionizing manufacturing: A comprehensive overview of additive manufacturing processes, materials, developments, and challenges. Journal of Manufacturing Processes, 107, 574\u2013619.","journal-title":"Journal of Manufacturing Processes"},{"issue":"21","key":"7087_CR22","doi-asserted-by":"publisher","first-page":"6373","DOI":"10.1080\/00207543.2021.1991023","volume":"60","author":"MS Kapadia","year":"2022","unstructured":"Kapadia, M. S., Uzsoy, R., Starly, B., & Warsing, D. P., Jr. (2022). A genetic algorithm for order acceptance and scheduling in additive manufacturing. International Journal of Production Research, 60(21), 6373\u20136390.","journal-title":"International Journal of Production Research"},{"issue":"5","key":"7087_CR23","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1080\/00207543.2016.1229064","volume":"55","author":"M Khorram Niaki","year":"2017","unstructured":"Khorram Niaki, M., & Nonino, F. (2017). Additive manufacturing management: a review and future research agenda. International Journal of Production Research, 55(5), 1419\u20131439.","journal-title":"International Journal of Production Research"},{"key":"7087_CR24","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.cor.2019.01.006","volume":"105","author":"I Kucukkoc","year":"2019","unstructured":"Kucukkoc, I. (2019). Milp models to minimise makespan in additive manufacturing machine scheduling problems. Computers & Operations Research, 105, 58\u201367.","journal-title":"Computers & Operations Research"},{"key":"7087_CR25","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.cor.2017.01.013","volume":"83","author":"Q Li","year":"2017","unstructured":"Li, Q., Kucukkoc, I., & Zhang, D. Z. (2017). Production planning in additive manufacturing and 3d printing. Computers & Operations Research, 83, 157\u2013172.","journal-title":"Computers & Operations Research"},{"key":"7087_CR26","doi-asserted-by":"publisher","first-page":"3711","DOI":"10.1007\/s00170-019-03796-x","volume":"105","author":"Q Li","year":"2019","unstructured":"Li, Q., Zhang, D., Wang, S., & Kucukkoc, I. (2019). A dynamic order acceptance and scheduling approach for additive manufacturing on-demand production. The International Journal of Advanced Manufacturing Technology, 105, 3711\u20133729.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"20","key":"7087_CR27","doi-asserted-by":"publisher","first-page":"6104","DOI":"10.1080\/00207543.2021.1983224","volume":"60","author":"Y Li","year":"2022","unstructured":"Li, Y., C\u00f4t\u00e9, J. F., Coelho, L. C., & Wu, P. (2022). Novel efficient formulation and matheuristic for large-sized unrelated parallel machine scheduling with release dates. International Journal of Production Research, 60(20), 6104\u20136123.","journal-title":"International Journal of Production Research"},{"issue":"3","key":"7087_CR28","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1016\/j.ejor.2024.05.001","volume":"317","author":"Z Mao","year":"2024","unstructured":"Mao, Z., Fu, E., Huang, D., Fang, K., & Chen, L. (2024). Combinatorial benders decomposition for single machine scheduling in additive manufacturing with two-dimensional packing constraints. European Journal of Operational Research, 317(3), 890\u2013905.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"7087_CR29","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/j.ejor.2019.10.014","volume":"286","author":"B Naderi","year":"2020","unstructured":"Naderi, B., & Roshanaei, V. (2020). Branch-relax-and-check: A tractable decomposition method for order acceptance and identical parallel machine scheduling. European Journal of Operational Research, 286(3), 811\u2013827.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"7087_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoo.2021.0056","volume":"4","author":"B Naderi","year":"2022","unstructured":"Naderi, B., & Roshanaei, V. (2022). Critical-path-search logic-based benders decomposition approaches for flexible job shop scheduling. INFORMS Journal on Optimization, 4(1), 1\u201328.","journal-title":"INFORMS Journal on Optimization"},{"issue":"1","key":"7087_CR31","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.ejor.2024.03.004","volume":"317","author":"PJ Nascimento","year":"2024","unstructured":"Nascimento, P. J., Silva, C., Antunes, C. H., & Moniz, S. (2024). Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems. European Journal of Operational Research, 317(1), 92\u2013110.","journal-title":"European Journal of Operational Research"},{"key":"7087_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.addma.2020.101492","volume":"36","author":"Y Oh","year":"2020","unstructured":"Oh, Y., Witherell, P., Lu, Y., & Sprock, T. (2020). Nesting and scheduling problems for additive manufacturing: A taxonomy and review. Additive Manufacturing, 36, Article 101492.","journal-title":"Additive Manufacturing"},{"issue":"1","key":"7087_CR33","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10479-019-03346-4","volume":"285","author":"Z Pei","year":"2020","unstructured":"Pei, Z., Wan, M., & Wang, Z. (2020). A new approximation algorithm for unrelated parallel machine scheduling with release dates. Annals of Operations Research, 285(1), 397\u2013425.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"7087_CR34","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","volume":"259","author":"R Rahmaniani","year":"2017","unstructured":"Rahmaniani, R., Crainic, T. G., Gendreau, M., & Rei, W. (2017). The Benders decomposition algorithm: A literature review. European Journal of Operational Research, 259(3), 801\u2013817.","journal-title":"European Journal of Operational Research"},{"key":"7087_CR35","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.jmsy.2017.02.012","volume":"43","author":"K Ransikarbum","year":"2017","unstructured":"Ransikarbum, K., Ha, S., Ma, J., & Kim, N. (2017). Multi-objective optimization analysis for part-to-printer assignment in a network of 3d fused deposition modeling. Journal of Manufacturing Systems, 43, 35\u201346.","journal-title":"Journal of Manufacturing Systems"},{"issue":"2","key":"7087_CR36","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.ejor.2016.08.024","volume":"257","author":"V Roshanaei","year":"2017","unstructured":"Roshanaei, V., Luong, C., Aleman, D. M., & Urbach, D. (2017). Propagating logic-based Benders\u2019 decomposition approaches for distributed operating room scheduling. European Journal of Operational Research, 257(2), 439\u2013455.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"7087_CR37","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/j.cirp.2016.05.004","volume":"65","author":"MK Thompson","year":"2016","unstructured":"Thompson, M. K., Moroni, G., Vaneker, T., Fadel, G., Campbell, R. I., Gibson, I., Bernard, A., Schulz, J., Graf, P., Ahuja, B., et al. (2016). Design for additive manufacturing: Trends, opportunities, considerations, and constraints. CIRP annals, 65(2), 737\u2013760.","journal-title":"CIRP annals"},{"issue":"1","key":"7087_CR38","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.mattod.2017.07.001","volume":"21","author":"SA Tofail","year":"2018","unstructured":"Tofail, S. A., Koumoulos, E. P., Bandyopadhyay, A., Bose, S., O\u2019Donoghue, L., & Charitidis, C. (2018). Additive manufacturing: scientific and technological challenges, market uptake and opportunities. Materials today, 21(1), 22\u201337.","journal-title":"Materials today"},{"key":"7087_CR39","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.cor.2014.09.007","volume":"54","author":"J Verstichel","year":"2015","unstructured":"Verstichel, J., Kinable, J., De Causmaecker, P., & Berghe, G. V. (2015). A combinatorial Bender\u2019 decomposition for the lock scheduling problem. Computers & Operations Research, 54, 117\u2013128.","journal-title":"Computers & Operations Research"},{"key":"7087_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105990","volume":"148","author":"S Wang","year":"2022","unstructured":"Wang, S., Wu, R., Chu, F., & Yu, J. (2022). Unrelated parallel machine scheduling problem with special controllable processing times and setups. Computers & Operations Research, 148, Article 105990.","journal-title":"Computers & Operations Research"},{"key":"7087_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106528","volume":"164","author":"P Wu","year":"2024","unstructured":"Wu, P., Wang, Y., & Chu, C. (2024). Logic-based Benders decomposition for bi-objective parallel machine selection and job scheduling with release dates and resource consumption. Computers & Operations Research, 164, Article 106528.","journal-title":"Computers & Operations Research"},{"key":"7087_CR42","doi-asserted-by":"crossref","unstructured":"Xiong, F., Jing, L., Xiong, N., & Xiang, C. (2025). Enhanced logic-based Benders decomposition methods for the distributed heterogeneous non-permutation flow shop scheduling problem. International Journal of Production Research: 1\u201338 .","DOI":"10.1016\/j.cor.2025.107044"},{"key":"7087_CR43","doi-asserted-by":"crossref","unstructured":"Xiong, F. & Liu, H. (2025). Logic-based benders decomposition methods for the distributed flexible job shop scheduling problem. European Journal of Operational Research .","DOI":"10.1016\/j.cor.2025.107044"},{"key":"7087_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106335","volume":"142","author":"\u00d6F Y\u0131lmaz","year":"2020","unstructured":"Y\u0131lmaz, \u00d6. F. (2020). Examining additive manufacturing in supply chain context through an optimization model. Computers & Industrial Engineering, 142, Article 106335.","journal-title":"Computers & Industrial Engineering"},{"key":"7087_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.116908","volume":"198","author":"KC Ying","year":"2022","unstructured":"Ying, K. C., Fruggiero, F., Pourhejazy, P., & Lee, B. Y. (2022). Adjusted iterated greedy for the optimization of additive manufacturing scheduling problems. Expert Systems with Applications, 198, Article 116908.","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"7087_CR46","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1016\/j.ejor.2021.06.017","volume":"297","author":"Z Zhang","year":"2022","unstructured":"Zhang, Z., Song, X., Huang, H., Zhou, X., & Yin, Y. (2022). Logic-based Benders decomposition method for the seru scheduling problem with sequence-dependent setup time and DeJong\u2019s learning effect. European Journal of Operational Research, 297(3), 866\u2013877.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"7087_CR47","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1080\/00207543.2023.2167015","volume":"62","author":"B Zipfel","year":"2024","unstructured":"Zipfel, B., Neufeld, J., & Buscher, U. (2024). An iterated local search for customer order scheduling in additive manufacturing. International Journal of Production Research, 62(3), 605\u2013625.","journal-title":"International Journal of Production Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-026-07087-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-026-07087-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-026-07087-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T17:02:34Z","timestamp":1773680554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-026-07087-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,16]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["7087"],"URL":"https:\/\/doi.org\/10.1007\/s10479-026-07087-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,16]]},"assertion":[{"value":"28 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No potential conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}]}}