{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T05:35:57Z","timestamp":1768628157905,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T00:00:00Z","timestamp":1685491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T00:00:00Z","timestamp":1685491200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001807","name":"funda\u00e7\u00e3o de amparo \u00e0 pesquisa do estado de s\u00e3o paulo","doi-asserted-by":"publisher","award":["grants 2013\/07375-0, 2016\/01860-1, and 2018\/24293-0"],"award-info":[{"award-number":["grants 2013\/07375-0, 2016\/01860-1, and 2018\/24293-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"conselho nacional de desenvolvimento cient\u00edfico e tecnol\u00f3gico","doi-asserted-by":"publisher","award":["grants 306083\/2016-7 and 302682\/2019-8"],"award-info":[{"award-number":["grants 306083\/2016-7 and 302682\/2019-8"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-023-00230-7","type":"journal-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T09:05:33Z","timestamp":1685523933000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Relax-and-Fix Heuristics Applied to a Real-World Lot Sizing and Scheduling Problem in the Personal Care Consumer Goods Industry"],"prefix":"10.1007","volume":"4","author":[{"given":"K. A. G.","family":"Araujo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7466-7663","authenticated-orcid":false,"given":"E. G.","family":"Birgin","sequence":"additional","affiliation":[]},{"given":"M. S.","family":"Kawamura","sequence":"additional","affiliation":[]},{"given":"D. P.","family":"Ronconi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,31]]},"reference":[{"key":"230_CR1","unstructured":"ABIHPEC (2021) Industry Overview of the Brazilian Personal Care, Perfumery and Cosmetics Industry In Portuguese. Available at https:\/\/abihpec.org.br\/site2019\/wp-content\/uploads\/2021\/05\/Panorama_do_Setor_Atualizado_Abril-Rev3.pdf. Accessed 21 July 2021"},{"key":"230_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00291-015-0429-4","volume":"39","author":"K Copil","year":"2017","unstructured":"Copil K, W\u00f6rbelauer M, Meyr H, Tempelmeier H (2017) Simultaneous lotsizing and scheduling problems: a classification and review of models. OR Spectr 39:1\u201364","journal-title":"OR Spectr"},{"key":"230_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01539800","volume":"19","author":"B Fleischmann","year":"1997","unstructured":"Fleischmann B, Meyr H (1997) The general lotsizing and scheduling problem. OR Spectr 19:11\u201321","journal-title":"OR Spectr"},{"key":"230_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0377-2217(99)00159-9","volume":"120","author":"H Meyr","year":"2000","unstructured":"Meyr H (2000) Simultaneous lotsizing and scheduling by combining local search with dual reoptimization. Eur J Oper Res 120:311\u2013326","journal-title":"Eur J Oper Res"},{"key":"230_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0377-2217(01)00373-3","volume":"139","author":"H Meyr","year":"2002","unstructured":"Meyr H (2002) Simultaneous lotsizing and scheduling on parallel machines. Eur J Oper Res 139:277\u2013292","journal-title":"Eur J Oper Res"},{"key":"230_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0377-2217(97)00030-1","volume":"99","author":"A Drexl","year":"1997","unstructured":"Drexl A, Kimms A (1997) Lot sizing and scheduling-survey and extensions. Eur J Oper Res 99:221\u2013235","journal-title":"Eur J Oper Res"},{"key":"230_CR7","doi-asserted-by":"crossref","unstructured":"Quadt D, Kuhn H (2008) Capacitated lot-sizing with extensions: A review. 4OR\u00a06:61\u201383","DOI":"10.1007\/s10288-007-0057-1"},{"key":"230_CR8","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1080\/07408170600559706","volume":"38","author":"X Zhu","year":"2006","unstructured":"Zhu X, Wilhelm WE (2006) Scheduling and lot sizing with sequence-dependent setup: A literature review. IIE Trans 38:987\u20131007","journal-title":"IIE Trans"},{"key":"230_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.omega.2006.11.004","volume":"37","author":"P Robinson","year":"2009","unstructured":"Robinson P, Narayanan A, Sahin F (2009) Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms. Omega 37:3\u201315","journal-title":"Omega"},{"key":"230_CR10","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0305-0483(03)00059-8","volume":"31","author":"B Karimi","year":"2003","unstructured":"Karimi B, Ghomi SMTF, Wilson JM (2003) The capacitated lot sizing problem: A review of models and algorithms. Omega 31:365\u2013378","journal-title":"Omega"},{"key":"230_CR11","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1287\/mnsc.45.2.273","volume":"45","author":"S Kang","year":"1999","unstructured":"Kang S, Malik K, Thomas LJ (1999) Lotsizing and scheduling on parallel machines with sequence-dependent setup costs. Manage Sci 45:273\u2013289","journal-title":"Manage Sci"},{"key":"230_CR12","doi-asserted-by":"publisher","first-page":"2287","DOI":"10.1080\/00207540050028106","volume":"38","author":"AR Clark","year":"2000","unstructured":"Clark AR, Clark SJ (2000) Rolling-horizon lot-sizing when set-up times are sequence-dependent. Int J Prod Res 38:2287\u20132307","journal-title":"Int J Prod Res"},{"key":"230_CR13","doi-asserted-by":"publisher","first-page":"3644","DOI":"10.1016\/j.cor.2007.04.003","volume":"35","author":"P Beraldi","year":"2008","unstructured":"Beraldi P, Ghiani G, Grieco A, Guerriero E (2008) Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs. Comput Oper Res 35:3644\u20133656","journal-title":"Comput Oper Res"},{"key":"230_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ijpe.2006.08.026","volume":"112","author":"J J\u00f3zefowska","year":"2008","unstructured":"J\u00f3zefowska J, Zimniak A (2008) Optimization tool for short-term production planning and scheduling. Int J Prod Econ 112:109\u2013120","journal-title":"Int J Prod Econ"},{"key":"230_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10951-009-0156-2","volume":"13","author":"GR Mateus","year":"2010","unstructured":"Mateus GR, Ravetti MG, de Souza MC, Valeriano TM (2010) Capacitated lot sizing and sequence dependent setup scheduling: an iterative approach for integration. J Sched 13:245\u2013259","journal-title":"J Sched"},{"key":"230_CR16","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.ejor.2013.03.036","volume":"229","author":"H Meyr","year":"2013","unstructured":"Meyr H, Mann M (2013) A decomposition approach for the general lotsizing and scheduling problem for parallel production lines. Eur J Oper Res 229:718\u2013731","journal-title":"Eur J Oper Res"},{"key":"230_CR17","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.cor.2015.04.010","volume":"63","author":"J Xiao","year":"2015","unstructured":"Xiao J, Yang H, Zhang C, Zheng L, Gupta J (2015) A hybrid lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times. Comput Oper Res 63:72\u201382","journal-title":"Comput Oper Res"},{"key":"230_CR18","doi-asserted-by":"publisher","first-page":"2987","DOI":"10.1016\/j.cor.2004.04.012","volume":"32","author":"SG Dastidar","year":"2005","unstructured":"Dastidar SG, Nagi R (2005) Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs. Comput Oper Res 32:2987\u20133005","journal-title":"Comput Oper Res"},{"key":"230_CR19","doi-asserted-by":"publisher","first-page":"7315","DOI":"10.1080\/00207543.2010.535570","volume":"49","author":"C Almeder","year":"2011","unstructured":"Almeder C, Almada-Lobo B (2011) Synchronisation of scarce resources for a parallel machine lotsizing problem. Int J Prod Res 49:7315\u20137335","journal-title":"Int J Prod Res"},{"key":"230_CR20","doi-asserted-by":"crossref","unstructured":"Soler WO, Santos MO, Akartunali K (2019) MIP approaches for a lot sizing and scheduling problem on multiple production lines with scarce resources, temporary workstations, and perishable products. J Oper Res Soc, to appear","DOI":"10.1080\/01605682.2019.1640588"},{"key":"230_CR21","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1016\/j.ejor.2020.01.016","volume":"284","author":"Y\u00c1 R\u00edos-Sol\u00eds","year":"2020","unstructured":"R\u00edos-Sol\u00eds Y\u00c1, Ibarra-Rojas OJ, Cabo M, Possani E (2020) A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production. Eur J Oper Res 284:861\u2013873","journal-title":"Eur J Oper Res"},{"key":"230_CR22","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1080\/00207543.2019.1600763","volume":"58","author":"J de Armas","year":"2020","unstructured":"de Armas J, Laguna M (2020) Parallel machine, capacitated lot-sizing and scheduling for the pipe-insulation industry. Int J Prod Res 58:800\u2013817","journal-title":"Int J Prod Res"},{"key":"230_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00291-018-0536-0","volume":"41","author":"M W\u00f6rbelauer","year":"2019","unstructured":"W\u00f6rbelauer M, Meyr H, Almada-Lobo B (2019) Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification. OR Spectr 41:1\u201343","journal-title":"OR Spectr"},{"key":"230_CR24","unstructured":"Pochet Y, Wolsey LA (2006) Production Planning by Mixed Integer Programming. Series in Operations Research and Financial. Springer Verlag, New York, NY"},{"key":"230_CR25","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1287\/mnsc.20.5.783","volume":"20","author":"F Glover","year":"1974","unstructured":"Glover F, Karney D, Klingman D, Napier A (1974) A computation study on start procedures, basis change criteria, and solution algorithms for transportation problems. Manage Sci 20:793\u2013813","journal-title":"Manage Sci"},{"key":"230_CR26","volume-title":"Mathematical Programming","author":"NV Reinfeld","year":"1958","unstructured":"Reinfeld NV, Vogel WR (1958) Mathematical Programming. Prentice-Hall, Englewood Cliffs, NJ"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00230-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-023-00230-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00230-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:33:35Z","timestamp":1744216415000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-023-00230-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,31]]},"references-count":26,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,6]]}},"alternative-id":["230"],"URL":"https:\/\/doi.org\/10.1007\/s43069-023-00230-7","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,31]]},"assertion":[{"value":"22 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"47"}}