{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T11:36:58Z","timestamp":1777117018408,"version":"3.51.4"},"reference-count":41,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T00:00:00Z","timestamp":1776988800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100005669","name":"Research Support Foundation of Para\u00edba State","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005669","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordination for the improvement of Higher Education Personnel","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"National Council for Scientific and Technological Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","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,9]]},"DOI":"10.1016\/j.cor.2026.107520","type":"journal-article","created":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T23:01:48Z","timestamp":1776985308000},"page":"107520","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Combining relax-and-fix and fix-and-optimize approaches to solve the Multi-Item Capacitated Lot-Sizing Problem with Unrelated Parallel Machines"],"prefix":"10.1016","volume":"193","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-9543-8553","authenticated-orcid":false,"given":"Ricardo Lukas de Medeiros","family":"Fran\u00e7a","sequence":"first","affiliation":[]},{"given":"Leonardo Andrade","family":"Apolin\u00e1rio","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-8093-5146","authenticated-orcid":false,"given":"Valdir Soares da","family":"Silva","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6324-6556","authenticated-orcid":false,"given":"Luciano","family":"Costa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4720-7546","authenticated-orcid":false,"given":"Hugo Harry","family":"Kramer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.cor.2026.107520_b1","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1287\/ijoc.2016.0712","article-title":"Local cuts and two-period convex hull closures for big-bucket lot-sizing problems","volume":"28","author":"Akartunal\u0131","year":"2016","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107520_b2","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/j.ejor.2007.11.033","article-title":"A heuristic approach for big bucket multi-level production planning problems","volume":"193","author":"Akartunal\u0131","year":"2009","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107520_b3","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1007\/s10589-012-9465-z","article-title":"A computational analysis of lower bounds for big bucket production planning problems","volume":"53","author":"Akartunal\u0131","year":"2012","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.cor.2026.107520_b4","series-title":"Planning and Control Systems: A Framework for Analysis","author":"Anthony","year":"1965"},{"issue":"5","key":"10.1016\/j.cor.2026.107520_b5","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1287\/mnsc.46.5.724.12048","article-title":"Bc\u2014prod: a specialized branch-and-cut system for lot-sizing problems","volume":"46","author":"Belvaux","year":"2000","journal-title":"Manag. Sci."},{"issue":"3","key":"10.1016\/j.cor.2026.107520_b6","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1287\/mnsc.36.3.348","article-title":"Economic lot scheduling for multiple products on parallel identical processors","volume":"36","author":"Carreno","year":"1990","journal-title":"Manag. Sci."},{"issue":"1","key":"10.1016\/j.cor.2026.107520_b7","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.ejor.2021.03.050","article-title":"Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setups","volume":"296","author":"Carvalho","year":"2022","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107520_b8","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.cor.2018.12.012","article-title":"Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing","volume":"104","author":"Cunha","year":"2019","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107520_b9","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1287\/ijoc.2014.0636","article-title":"Period decompositions for the capacitated lot sizing problem with setup times","volume":"27","author":"de Araujo","year":"2015","journal-title":"INFORMS J. Comput."},{"issue":"5","key":"10.1016\/j.cor.2026.107520_b10","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1287\/opre.1070.0404","article-title":"A new dantzig-wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times","volume":"55","author":"Degraeve","year":"2007","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107520_b11","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.ejor.2017.11.014","article-title":"Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: Zero setup case","volume":"267","author":"Doostmohammadi","year":"2018","journal-title":"European J. Oper. Res."},{"issue":"6","key":"10.1016\/j.cor.2026.107520_b12","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/opre.35.6.832","article-title":"Solving multi-item capacitated lot-sizing problems using variable redefinition","volume":"35","author":"Eppen","year":"1987","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107520_b13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0272-6963(85)90009-9","article-title":"An efficient implementation of the wagner-whitin algorithm for dynamic lot-sizing","volume":"5","author":"Evans","year":"1985","journal-title":"J. Oper. Manage."},{"issue":"3","key":"10.1016\/j.cor.2026.107520_b14","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1287\/opre.1070.0392","article-title":"Progressive interval heuristics for multi-item capacitated lot-sizing problems","volume":"55","author":"Federgruen","year":"2007","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107520_b15","first-page":"213","article-title":"Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines","volume":"217","author":"Fiorotto","year":"2014","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cor.2026.107520_b16","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.cor.2015.04.015","article-title":"Hybrid methods for lot sizing on parallel machines","volume":"63","author":"Fiorotto","year":"2015","journal-title":"Comput. Oper. Res."},{"issue":"20","key":"10.1016\/j.cor.2026.107520_b17","doi-asserted-by":"crossref","first-page":"6350","DOI":"10.1080\/00207543.2019.1680892","article-title":"Impact analysis of setup carryover and crossover on lot sizing problems","volume":"58","author":"Fiorotto","year":"2020","journal-title":"Int. J. Prod. Res."},{"issue":"7","key":"10.1016\/j.cor.2026.107520_b18","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1287\/mnsc.26.7.669","article-title":"Deterministic production planning: Algorithms and complexity","volume":"26","author":"Florian","year":"1980","journal-title":"Manag. Sci."},{"issue":"2","key":"10.1016\/j.cor.2026.107520_b19","article-title":"How many parts to make at once","volume":"10","author":"Harris","year":"1913","journal-title":"Fact. - Mag. Manag."},{"issue":"2","key":"10.1016\/j.cor.2026.107520_b20","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.ijpe.2009.08.022","article-title":"A fix-and-optimize approach for the multi-level capacitated lot sizing problem","volume":"123","author":"Helber","year":"2010","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.cor.2026.107520_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.106038","article-title":"Generalized relax-and-fix heuristic","volume":"149","author":"Joncour","year":"2023","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"10.1016\/j.cor.2026.107520_b22","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0305-0483(03)00059-8","article-title":"The capacitated lot sizing problem: a review of models and algorithms","volume":"31","author":"Karimi","year":"2003","journal-title":"Omega"},{"key":"10.1016\/j.cor.2026.107520_b23","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1016\/j.cie.2018.11.014","article-title":"A fix-and-optimize heuristic for the integrated fleet sizing and replenishment planning problem with predetermined delivery frequencies","volume":"127","author":"Karimi Dastjerd","year":"2019","journal-title":"Comput. Ind. Eng."},{"issue":"21","key":"10.1016\/j.cor.2026.107520_b24","doi-asserted-by":"crossref","first-page":"6573","DOI":"10.1080\/00207543.2021.1995792","article-title":"Clustering-based solution approach for a capacitated lot-sizing problem on parallel machines with sequence-dependent setups","volume":"60","author":"Larroche","year":"2022","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107520_b25","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1287\/opre.19.4.946","article-title":"An efficient algorithm for multi-item scheduling","volume":"19","author":"Lasdon","year":"1971","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107520_b26","series-title":"2015 IEEE Congress on Evolutionary Computation","first-page":"2721","article-title":"Solving a multi-level capacitated lot sizing problem with random demand via a fix-and-optimize heuristic","author":"Li","year":"2015"},{"issue":"2","key":"10.1016\/j.cor.2026.107520_b27","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0377-2217(91)90130-N","article-title":"Multilevel capacitated lotsizing complexity and LP-based heuristics","volume":"53","author":"Maes","year":"1991","journal-title":"European J. Oper. Res."},{"issue":"11","key":"10.1016\/j.cor.2026.107520_b28","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1057\/jors.1988.169","article-title":"Multi-item single-level capacitated dynamic lot-sizing heuristics: A general review","volume":"39","author":"Maes","year":"1988","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"10.1016\/j.cor.2026.107520_b29","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1287\/mnsc.4.2.115","article-title":"Programming of economic lot sizes","volume":"4","author":"Manne","year":"1958","journal-title":"Manag. Sci."},{"issue":"2","key":"10.1016\/j.cor.2026.107520_b30","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1080\/00207543.2016.1215567","article-title":"Formulations and heuristics for the multi-item uncapacitated lot-sizing problem with inventory bounds","volume":"55","author":"Melo","year":"2017","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107520_b31","series-title":"Planejamento da produ\u00e7\u00e3o em m\u00e1quinas paralelas sob restri\u00e7\u00f5es de capacidade [Production Planning in Parallel Machines with Capacity Constraints]","author":"Sabbag Neto","year":"1993"},{"issue":"9","key":"10.1016\/j.cor.2026.107520_b32","doi-asserted-by":"crossref","first-page":"2546","DOI":"10.1016\/j.cor.2008.10.009","article-title":"Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic","volume":"36","author":"Sahling","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107520_b33","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110503","article-title":"Energy-aware production lot-sizing and parallel machine scheduling with product-specific machining tools and power requirements","volume":"196","author":"Sel","year":"2024","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"10.1016\/j.cor.2026.107520_b34","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.51.3.487.14949","article-title":"Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows","volume":"51","author":"Stadtler","year":"2003","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107520_b35","series-title":"Dimensionamento de lotes em m\u00e1quinas paralelas [Lot-Sizing in Parallel Machines]","author":"Toledo","year":"1998"},{"issue":"2","key":"10.1016\/j.cor.2026.107520_b36","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1016\/j.ejor.2005.06.029","article-title":"A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines","volume":"175","author":"Toledo","year":"2006","journal-title":"European J. Oper. Res."},{"issue":"5","key":"10.1016\/j.cor.2026.107520_b37","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1007\/s10732-015-9295-0","article-title":"A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems","volume":"21","author":"Toledo","year":"2015","journal-title":"J. Heuristics"},{"issue":"3","key":"10.1016\/j.cor.2026.107520_b38","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/mnsc.35.3.353","article-title":"Capacitated lot sizing with setup times","volume":"35","author":"Trigeiro","year":"1989","journal-title":"Manag. Sci."},{"issue":"21","key":"10.1016\/j.cor.2026.107520_b39","doi-asserted-by":"crossref","first-page":"6689","DOI":"10.1080\/00207543.2019.1685699","article-title":"A population-based metaheuristic for the capacitated lot-sizing problem with unrelated parallel machines","volume":"58","author":"Vincent","year":"2020","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107520_b40","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","article-title":"Dynamic version of the economic lot size model","volume":"5","author":"Wagner","year":"1958","journal-title":"Manag. Sci."},{"issue":"2","key":"10.1016\/j.cor.2026.107520_b41","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1287\/ijoc.2017.0777","article-title":"Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines","volume":"30","author":"Wu","year":"2018","journal-title":"INFORMS J. Comput."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001383?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001383?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T10:51:04Z","timestamp":1777114264000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":41,"alternative-id":["S0305054826001383"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107520","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Combining relax-and-fix and fix-and-optimize approaches to solve the Multi-Item Capacitated Lot-Sizing Problem with Unrelated Parallel Machines","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107520","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107520"}}