{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T01:56:32Z","timestamp":1768787792124,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T00:00:00Z","timestamp":1730937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T00:00:00Z","timestamp":1730937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["307466\/2021-3"],"award-info":[{"award-number":["307466\/2021-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015897","name":"Centro de Ci\u00eancias Matem\u00e1ticas Aplicadas \u00e1 Ind\u00fastria","doi-asserted-by":"publisher","award":["FAPESP grant 2013\/07375-0"],"award-info":[{"award-number":["FAPESP grant 2013\/07375-0"]}],"id":[{"id":"10.13039\/501100015897","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"crossref","award":["FA 9550-18-1-7003"],"award-info":[{"award-number":["FA 9550-18-1-7003"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"name":"S\u00e3o Paulo Research Foundation - FAPESP","award":["2024\/07482-5"],"award-info":[{"award-number":["2024\/07482-5"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10732-024-09539-w","type":"journal-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T10:07:15Z","timestamp":1730974035000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7467-2307","authenticated-orcid":false,"given":"Willy A. Oliveira","family":"Soler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maristela O.","family":"Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kerem","family":"Akartunal\u0131","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"issue":"3","key":"9539_CR1","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10589-012-9465-z","volume":"53","author":"K Akartunal\u0131","year":"2012","unstructured":"Akartunal\u0131, K., Miller, A.J.: A computational analysis of lower bounds for big bucket production planning problems. Comput. Optim. Appl. 53(3), 729\u2013753 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"9539_CR2","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1590\/0101-7438.2015.035.03.0439","volume":"35","author":"B Almada-Lobo","year":"2015","unstructured":"Almada-Lobo, B., Clark, A., Guimar\u00e3es, L., et al.: Industrial insights into lot sizing and scheduling modeling. Pesqui. Oper. 35(3), 439\u2013464 (2015)","journal-title":"Pesqui. Oper."},{"issue":"24","key":"9539_CR3","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.: Synchronisation of scarce resources for a parallel machine lotsizing problem. Int. J. Prod. Res. 49(24), 7315\u20137335 (2011)","journal-title":"Int. J. Prod. Res."},{"key":"9539_CR4","doi-asserted-by":"publisher","first-page":"106800","DOI":"10.1016\/j.cie.2020.106800","volume":"149","author":"R As\u2019ad","year":"2020","unstructured":"As\u2019ad, R., Hariga, M., Shamayleh, A.: Sustainable dynamic lot sizing models for cold products under carbon cap policy. Comput. Ind. Eng. 149, 106800 (2020)","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"9539_CR5","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1007\/s00291-015-0404-0","volume":"37","author":"N Brahimi","year":"2015","unstructured":"Brahimi, N., Absi, N., Dauz\u00e8re-P\u00e9r\u00e8s, S., et al.: Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory. OR Spectr. 37(4), 983\u20131006 (2015)","journal-title":"OR Spectr."},{"key":"9539_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.cor.2016.01.019","volume":"71","author":"DM Carvalho","year":"2016","unstructured":"Carvalho, D.M., Nascimento, M.C.: Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items. Comput. Oper. Res. 71, 137\u2013148 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9539_CR7","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/0377-2217(92)90201-J","volume":"59","author":"M Diaby","year":"1992","unstructured":"Diaby, M., Bahl, H., Karwan, M., et al.: Capacitated lot-sizing and scheduling by Lagrangean relaxation. Eur. J. Oper. Res. 59(3), 444\u2013458 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"9539_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"4","key":"9539_CR9","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1016\/j.cor.2009.06.007","volume":"37","author":"D Ferreira","year":"2010","unstructured":"Ferreira, D., Morabito, R., Rangel, S.: Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants. Comput. Oper. Res. 37(4), 684\u2013691 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9539_CR10","first-page":"213","volume":"217","author":"DJ Fiorotto","year":"2014","unstructured":"Fiorotto, D.J., de Araujo, S.A.: Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines. Ann. Oper. Res. 217(1), 213\u2013231 (2014)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"9539_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0377-2217(90)90245-7","volume":"44","author":"B Fleischmann","year":"1990","unstructured":"Fleischmann, B.: The discrete lot-sizing and scheduling problem. Eur. J. Oper. Res. 44(3), 337\u2013348 (1990)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9539_CR12","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/0377-2217(94)90083-3","volume":"75","author":"B Fleischmann","year":"1994","unstructured":"Fleischmann, B.: The discrete lot-sizing and scheduling problem with sequence-dependent setup costs. Eur. J. Oper. Res. 75(2), 395\u2013404 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"9539_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01539800","volume":"19","author":"B Fleischmann","year":"1997","unstructured":"Fleischmann, B., Meyr, H.: The general lotsizing and scheduling problem. Oper. Res. Spektrum 19, 11\u201321 (1997)","journal-title":"Oper. Res. Spektrum"},{"issue":"1","key":"9539_CR14","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.ejor.2018.11.033","volume":"275","author":"GB Fonseca","year":"2019","unstructured":"Fonseca, G.B., Nogueira, T.H., Ravetti, M.G.: A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem. Eur. J. Oper. Res. 275(1), 139\u2013154 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"9539_CR15","doi-asserted-by":"crossref","unstructured":"Gaudioso, M.: A View of Lagrangian Relaxation and its Applications, pp. 579\u2013617. State of the Art Algorithms, Numerical Nonsmooth Optimization (2020)","DOI":"10.1007\/978-3-030-34910-3_17"},{"key":"9539_CR16","unstructured":"Gavish, B., Graves, S.C.: The travelling salesman problem and related problems (1978)"},{"key":"9539_CR17","doi-asserted-by":"crossref","unstructured":"Geoffrion, A.: Lagrangian relaxation for integer programming mathematical programming study. The Mathematical Programming Society (1974)","DOI":"10.1007\/BFb0120690"},{"issue":"2","key":"9539_CR18","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"M Guignard","year":"1987","unstructured":"Guignard, M., Kim, S.: Lagrangean decomposition: a model yielding stronger Lagrangean bounds. Math. Program. 39(2), 215\u2013228 (1987)","journal-title":"Math. Program."},{"issue":"3","key":"9539_CR19","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/j.ejor.2014.05.018","volume":"239","author":"L Guimar\u00e3es","year":"2014","unstructured":"Guimar\u00e3es, L., Klabjan, D., Almada-Lobo, B.: Modeling lotsizing and scheduling problems with sequence dependent setups. Eur. J. Oper. Res. 239(3), 644\u2013662 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9539_CR20","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF01539882","volume":"18","author":"K Haase","year":"1996","unstructured":"Haase, K.: Capacitated lot-sizing with sequence dependent setup costs. Oper. Res. Spektrum 18(1), 51\u201359 (1996)","journal-title":"Oper. Res. Spektrum"},{"issue":"1","key":"9539_CR21","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M Held","year":"1974","unstructured":"Held, M., Wolfe, P., Crowder, H.P.: Validation of subgradient optimization. Math. Program. 6(1), 62\u201388 (1974)","journal-title":"Math. Program."},{"issue":"5","key":"9539_CR22","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1016\/j.cor.2003.11.001","volume":"32","author":"A Jain","year":"2005","unstructured":"Jain, A., Palekar, U.S.: Aggregate production planning for a continuous reconfigurable manufacturing process. Comput. Oper. Res. 32(5), 1213\u20131236 (2005)","journal-title":"Comput. Oper. Res."},{"key":"9539_CR23","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.orl.2003.06.001","volume":"32","author":"R Jans","year":"2004","unstructured":"Jans, R., Degraeve, Z.: Improved lower bounds for the capacitated lot sizing problem with setup times. Oper. Res. Lett. 32, 185\u2013195 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"9539_CR24","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1021\/ie901013k","volume":"49","author":"GM Kopanos","year":"2010","unstructured":"Kopanos, G.M., Puigjaner, L., Georgiadis, M.C.: Optimal production scheduling and lot-sizing in dairy plants: the yogurt production line. Ind. Eng. Chem. Res. 49(2), 701\u2013718 (2010)","journal-title":"Ind. Eng. Chem. Res."},{"key":"9539_CR25","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10951-010-0197-6","volume":"14","author":"AA Menezes","year":"2011","unstructured":"Menezes, A.A., Clark, A., Almada-Lobo, B.: Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups. J. Sched. 14, 209\u2013219 (2011)","journal-title":"J. Sched."},{"issue":"1","key":"9539_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0925-5273(94)90042-6","volume":"34","author":"HH Millar","year":"1994","unstructured":"Millar, H.H., Yang, M.: Lagrangian heuristics for the capacitated multi-item lot-sizing problem with backordering. Int. J. Prod. Econ. 34(1), 1\u201315 (1994)","journal-title":"Int. J. Prod. Econ."},{"issue":"4","key":"9539_CR27","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM (JACM) 7(4), 326\u2013329 (1960)","journal-title":"J. ACM (JACM)"},{"key":"9539_CR28","doi-asserted-by":"publisher","first-page":"515","DOI":"10.5540\/tema.2017.018.03.515","volume":"18","author":"WA Oliveira","year":"2017","unstructured":"Oliveira, W.A., Santos, M.O.: A new branching rule to solve the capacitated lot sizing and scheduling problem with sequence dependent setups. TEMA (S\u00e3o Carlos) 18, 515\u2013529 (2017)","journal-title":"TEMA (S\u00e3o Carlos)"},{"issue":"3","key":"9539_CR29","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak, B.T.: Minimization of unsmooth functionals. USSR Comput. Math. Math. Phys. 9(3), 14\u201329 (1969)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"9539_CR30","doi-asserted-by":"publisher","first-page":"e240377","DOI":"10.1590\/0101-7438.2021.041s1.00240377","volume":"41","author":"WA Soler","year":"2021","unstructured":"Soler, W.A., Santos, M.O., Akartunal\u0131, K.: Decomposition based heuristics for a lot sizing and scheduling problem on multiple heterogeneous production lines with perishable products. Pesqui. Oper. 41, e240377 (2021)","journal-title":"Pesqui. Oper."},{"issue":"8","key":"9539_CR31","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1080\/01605682.2019.1640588","volume":"72","author":"WAO Soler","year":"2021","unstructured":"Soler, W.A.O., Santos, M.O., Akartunal\u0131, K.: 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. 72(8), 1691\u20131706 (2021). https:\/\/doi.org\/10.1080\/01605682.2019.1640588","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"9539_CR32","doi-asserted-by":"publisher","first-page":"1949","DOI":"10.1051\/ro\/2021084","volume":"55","author":"WAO Soler","year":"2021","unstructured":"Soler, W.A.O., Santos, M.O., Rangel, S.: Optimization models for a lot sizing and scheduling problem on parallel production lines that share scarce resources. RAIRO Oper. Res. 55(3), 1949\u20131970 (2021)","journal-title":"RAIRO Oper. Res."},{"issue":"1","key":"9539_CR33","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.ejor.2007.11.052","volume":"194","author":"H S\u00fcral","year":"2009","unstructured":"S\u00fcral, H., Denizel, M., Van Wassenhove, L.N.: Lagrangean relaxation based heuristics for lot sizing with setup times. Eur. J. Oper. Res. 194(1), 51\u201363 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"9539_CR34","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1287\/mnsc.42.5.738","volume":"42","author":"H Tempelmeier","year":"1996","unstructured":"Tempelmeier, H., Derstroff, M.: A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Manag. Sci. 42(5), 738\u2013757 (1996)","journal-title":"Manag. Sci."},{"issue":"2","key":"9539_CR35","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1016\/j.ejor.2005.06.029","volume":"175","author":"FMB Toledo","year":"2006","unstructured":"Toledo, F.M.B., Armentano, V.A.: A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines. Eur. J. Oper. Res. 175(2), 1070\u20131083 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9539_CR36","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1287\/mnsc.35.3.353","volume":"35","author":"WW Trigeiro","year":"1989","unstructured":"Trigeiro, W.W., Thomas, L.J., McClain, J.O.: Capacitated lot sizing with setup times. Manag. Sci. 35(3), 353\u2013366 (1989)","journal-title":"Manag. Sci."},{"issue":"1","key":"9539_CR37","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ejor.2015.01.034","volume":"244","author":"C Wolosewicz","year":"2015","unstructured":"Wolosewicz, C., Dauz\u00e8re-P\u00e9r\u00e8s, S., Aggoune, R.: A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem. Eur. J. Oper. Res. 244(1), 3\u201312 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"9539_CR38","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1016\/j.cor.2013.01.021","volume":"40","author":"T Wu","year":"2013","unstructured":"Wu, T., Zhang, C., Liang, Z., et al.: A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders. Comput. Oper. Res. 40(7), 1852\u20131863 (2013)","journal-title":"Comput. Oper. Res."},{"key":"9539_CR39","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.cor.2018.05.024","volume":"98","author":"T Wu","year":"2018","unstructured":"Wu, T., Xiao, F., Zhang, C., et al.: The green capacitated multi-item lot sizing problem with parallel machines. Comput. Oper. Res. 98, 149\u2013164 (2018)","journal-title":"Comput. Oper. Res."},{"key":"9539_CR40","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., et al.: 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 (2015)","journal-title":"Comput. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-024-09539-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-024-09539-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-024-09539-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T13:17:43Z","timestamp":1741439863000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-024-09539-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,7]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["9539"],"URL":"https:\/\/doi.org\/10.1007\/s10732-024-09539-w","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,7]]},"assertion":[{"value":"1 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2024","order":4,"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 they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"1"}}