{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:57:44Z","timestamp":1781895464533,"version":"3.54.5"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T00:00:00Z","timestamp":1722902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T00:00:00Z","timestamp":1722902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-024-00350-8","type":"journal-article","created":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T09:10:21Z","timestamp":1722935421000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Modeling and Hybridized Decomposition Approach for the Multi-level Capacitated Lot-Sizing Problem with Setup Carryover, Backlogging, and Emission Control"],"prefix":"10.1007","volume":"5","author":[{"given":"Nusrat T.","family":"Chowdhury","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed F.","family":"Baki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahmed","family":"Azab","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,6]]},"reference":[{"issue":"10","key":"350_CR1","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1287\/mnsc.29.10.1126","volume":"29","author":"PJ Billington","year":"1983","unstructured":"Billington PJ, McClain JO, Thomas LJ (1983) Mathematical programming approaches to capacity-constrained MRP systems: review, formulation and problem reduction. Manage Sci 29(10):1126\u20131141. https:\/\/doi.org\/10.1287\/mnsc.29.10.1126","journal-title":"Manage Sci"},{"issue":"2","key":"350_CR2","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s00291-008-0150-7","volume":"32","author":"L Buschk\u00fchl","year":"2010","unstructured":"Buschk\u00fchl L, Sahling F, Helber S, Tempelmeier H (2010) Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. OR Spectrum 32(2):231\u2013261. https:\/\/doi.org\/10.1007\/s00291-008-0150-7","journal-title":"OR Spectrum"},{"issue":"11","key":"350_CR3","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1080\/07408170500245562","volume":"38","author":"D Briskorn","year":"2006","unstructured":"Briskorn D (2006) A note on capacitated lot sizing with setup carry over. IIE Trans 38(11):1045\u20131047. https:\/\/doi.org\/10.1080\/07408170500245562","journal-title":"IIE Trans"},{"key":"350_CR4","first-page":"127","volume-title":"Advanced Models and Methods for Production Planning","author":"K Haase","year":"1998","unstructured":"Haase K (1998) Capacitated lot-sizing with linked production quantities of adjacent periods. Beyond Manufacturing Resource Planning (MRP II). Advanced Models and Methods for Production Planning. Springer Berlin Heidelberg., Berlin, Heidelberg, pp 127\u2013146"},{"issue":"2","key":"350_CR5","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.orl.2012.12.003","volume":"41","author":"X Chen","year":"2013","unstructured":"Chen X, Benjaafar S, Elomri A (2013) The carbon-constrained EOQ. Oper Res Lett 41(2):172\u2013179. https:\/\/doi.org\/10.1016\/j.orl.2012.12.003","journal-title":"Oper Res Lett"},{"issue":"1","key":"350_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"HM Wagner","year":"1958","unstructured":"Wagner HM, Whitin TM (1958) Dynamic version of the economic lot size model. Manage Sci 5(1):89\u201396. https:\/\/doi.org\/10.1287\/mnsc.5.1.89","journal-title":"Manage Sci"},{"key":"350_CR7","doi-asserted-by":"publisher","unstructured":"Federgruen A, Tzur M (1991) A simple forward algorithm to solve general dynamic lot sizing models with n periods in 0(n log\u00a0n) or 0(n) time. Manag Sci 37(8):909\u2013925.\u00a0https:\/\/doi.org\/10.2307\/2632555 \u00a0\u00a0","DOI":"10.2307\/2632555"},{"key":"350_CR8","doi-asserted-by":"publisher","unstructured":"Florian M, Lenstra JK, Kan AHGR (1980) Deterministic production planning: algorithms and complexity. Manag Sci 26(7):669\u2013679.\u00a0\u00a0https:\/\/doi.org\/10.1287\/mnsc.26.7.669","DOI":"10.1287\/mnsc.26.7.669"},{"key":"350_CR9","doi-asserted-by":"publisher","unstructured":"Bitran GR, Yanasse H (1982) Computational complexity of the capacitated lot size problem. Manag Sci 28(10):1174\u20131186. https:\/\/doi.org\/10.1287\/mnsc.28.10.1174","DOI":"10.1287\/mnsc.28.10.1174"},{"issue":"5","key":"350_CR10","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 (1996) A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Manage Sci 42(5):738\u2013757","journal-title":"Manage Sci"},{"issue":"2","key":"350_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/a:1007520703382","volume":"31","author":"CR Sox","year":"1999","unstructured":"Sox CR, Gao Y (1999) The capacitated lot sizing problem with setup carry-over. IIE Trans 31(2):173\u2013181. https:\/\/doi.org\/10.1023\/a:1007520703382","journal-title":"IIE Trans"},{"issue":"2","key":"350_CR12","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s00291-008-0130-y","volume":"31","author":"H Tempelmeier","year":"2009","unstructured":"Tempelmeier H, Buschk\u00fchl L (2009) A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures. OR Spectrum 31(2):385\u2013404. https:\/\/doi.org\/10.1007\/s00291-008-0130-y","journal-title":"OR Spectrum"},{"issue":"9","key":"350_CR13","doi-asserted-by":"publisher","first-page":"2546","DOI":"10.1016\/j.cor.2008.10.009","volume":"36","author":"F Sahling","year":"2009","unstructured":"Sahling F, Buschk\u00fchl L, Tempelmeier H, Helber S (2009) Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic. Comput Oper Res 36(9):2546\u20132553. https:\/\/doi.org\/10.1016\/j.cor.2008.10.009","journal-title":"Comput Oper Res"},{"issue":"2","key":"350_CR14","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10626-012-0141-3","volume":"23","author":"T Wu","year":"2013","unstructured":"Wu T, Akartunal\u0131 K, Song J, Shi L (2013) Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms. Discrete Event Dynamic Systems 23(2):211\u2013239. https:\/\/doi.org\/10.1007\/s10626-012-0141-3","journal-title":"Discrete Event Dynamic Systems"},{"key":"350_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.cor.2018.07.008","volume":"100","author":"DM Carvalho","year":"2018","unstructured":"Carvalho DM, Nascimento MCV (2018) A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over. Comput Oper Res 100:43\u201353. https:\/\/doi.org\/10.1016\/j.cor.2018.07.008","journal-title":"Comput Oper Res"},{"key":"350_CR16","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1016\/j.cie.2018.11.023","volume":"127","author":"M Ghirardi","year":"2019","unstructured":"Ghirardi M, Amerio A (2019) Matheuristics for the lot sizing problem with back-ordering, setup carry-overs, and non-identical machines. Comput Ind Eng 127:822\u2013831. https:\/\/doi.org\/10.1016\/j.cie.2018.11.023","journal-title":"Comput Ind Eng"},{"issue":"20","key":"350_CR17","doi-asserted-by":"publisher","first-page":"6350","DOI":"10.1080\/00207543.2019.1680892","volume":"58","author":"DJ Fiorotto","year":"2020","unstructured":"Fiorotto DJ, del Carmen J, Neyra H, de Araujo SA (2020) Impact analysis of setup carryover and crossover on lot sizing problems. Int J Prod Res 58(20):6350\u20136369. https:\/\/doi.org\/10.1080\/00207543.2019.1680892","journal-title":"Int J Prod Res"},{"issue":"1","key":"350_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/TASE.2012.2203304","volume":"10","author":"S Benjaafar","year":"2013","unstructured":"Benjaafar S, Li Y, Daskin M (2013) Carbon footprint and the management of supply chains: insights from simple models. IEEE Trans Autom Sci Eng 10(1):99\u2013116. https:\/\/doi.org\/10.1109\/TASE.2012.2203304","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"1","key":"350_CR19","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.ejor.2014.06.030","volume":"241","author":"MJ Retel Helmrich","year":"2015","unstructured":"Retel Helmrich MJ, Jans R, van den Heuvel W, Wagelmans APM (2015) The economic lot-sizing problem with an emission capacity constraint. Eur J Oper Res 241(1):50\u201362. https:\/\/doi.org\/10.1016\/j.ejor.2014.06.030","journal-title":"Eur J Oper Res"},{"key":"350_CR20","doi-asserted-by":"crossref","unstructured":"Mashud AHM, Roy D, Daryanto Y, Mishra U, Tseng M (2022) Sustainable production lot sizing problem: a sensitivity analysis on controlling carbon emissions through green investment. Comput Ind Eng 169(108143)","DOI":"10.1016\/j.cie.2022.108143"},{"key":"350_CR21","doi-asserted-by":"crossref","unstructured":"Mashud AHM, Roy D, Daryanto Y, Chakrabortty RK, Tseng M (2021) A sustainable inventory model with controllable carbon emissions, deterioration and advance payments. J Clean Prod 296(126608)","DOI":"10.1016\/j.jclepro.2021.126608"},{"key":"350_CR22","doi-asserted-by":"crossref","unstructured":"Sepehri A (2021) Controllable carbon emissions in an inventory model for perishable items under trade credit policy for credit-risk customers. Carbon Capture Sci Technol 1(100004)","DOI":"10.1016\/j.ccst.2021.100004"},{"key":"350_CR23","doi-asserted-by":"publisher","unstructured":"Konur D, Schaefer B (2014) Integrated inventory control and transportation decisions under carbon emissions regulations: LTL vs. TL carriers. Trans Res Part E-Log 68:14\u201338. https:\/\/doi.org\/10.1016\/j.tre.2014.04.012","DOI":"10.1016\/j.tre.2014.04.012"},{"issue":"3","key":"350_CR24","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1080\/19397038.2020.1800858","volume":"14","author":"A Ghosh","year":"2021","unstructured":"Ghosh A (2021) Optimisation of a production-inventory model under two different carbon policies and proposal of a hybrid carbon policy under random demand. Int J Sustain Eng 14(3):280\u2013292","journal-title":"Int J Sustain Eng"},{"issue":"6","key":"350_CR25","doi-asserted-by":"publisher","first-page":"5129","DOI":"10.1016\/j.aej.2021.03.075","volume":"60","author":"AAH Ahmadini","year":"2021","unstructured":"Ahmadini AAH, Modibbo UM, Shaikh AA, Ali I (2021) Multi-objective optimization modelling of sustainable green supply chain in inventory and production management. Alex Eng J 60(6):5129\u20135146","journal-title":"Alex Eng J"},{"issue":"2","key":"350_CR26","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1287\/mnsc.4.2.115","volume":"4","author":"AS Manne","year":"1958","unstructured":"Manne AS (1958) Programming of economic lot sizes. Manage Sci 4(2):115\u2013135. https:\/\/doi.org\/10.1287\/mnsc.4.2.115","journal-title":"Manage Sci"},{"issue":"5","key":"350_CR27","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1287\/opre.1070.0404","volume":"55","author":"Z Degraeve","year":"2007","unstructured":"Degraeve Z, Jans R (2007) A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times. Oper Res 55(5):909\u2013920. https:\/\/doi.org\/10.1287\/opre.1070.0404","journal-title":"Oper Res"},{"issue":"2","key":"350_CR28","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1080\/10556780902992837","volume":"25","author":"CMO Pimentel","year":"2010","unstructured":"Pimentel CMO, Alvelos FPE, de Carvalho Val\u00e9rio JM (2010) Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem. Optimization Methods and Software 25(2):299\u2013319. https:\/\/doi.org\/10.1080\/10556780902992837","journal-title":"Optimization Methods and Software"},{"key":"350_CR29","doi-asserted-by":"crossref","unstructured":"Caserta M, Vo\u00df S (2012) A math-heuristic Dantzig-Wolfe algorithm for the capacitated lot sizing problem. Learning and Intelligent Optimization: 6th International Conference, LION 6, Paris, France, January 16\u201320, 2012, Revised Selected Papers, 31\u201341.","DOI":"10.1007\/978-3-642-34413-8_3"},{"issue":"Supplement C","key":"350_CR30","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.cor.2015.04.015","volume":"63","author":"DJ Fiorotto","year":"2015","unstructured":"Fiorotto DJ, de Araujo SA, Jans R (2015) Hybrid methods for lot sizing on parallel machines. Comput Oper Res 63(Supplement C):136\u2013148. https:\/\/doi.org\/10.1016\/j.cor.2015.04.015","journal-title":"Comput Oper Res"},{"issue":"3","key":"350_CR31","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1287\/ijoc.2016.0691","volume":"28","author":"F Ioannis","year":"2016","unstructured":"Ioannis F, Degraeve Z, De Reyck B (2016) A horizon decomposition approach for the capacitated lot-sizing problem with setup times. INFORMS J Comput 28(3):465\u2013482. https:\/\/doi.org\/10.1287\/ijoc.2016.0691","journal-title":"INFORMS J Comput"},{"key":"350_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105068","author":"T Wu","year":"2020","unstructured":"Wu T, Shi Z, Liang Z, Zhang X, Zhang C (2020) Dantzig-Wolfe decomposition for the facility location and production planning problem. Comput Oper Res. https:\/\/doi.org\/10.1016\/j.cor.2020.105068","journal-title":"Comput Oper Res"},{"key":"350_CR33","doi-asserted-by":"publisher","unstructured":"G\u00f6ren HG, Tunali S (2018) Fix-and-optimize heuristics for capacitated lot sizing with setup carryover and backordering. J Enterp Inf Manag 31(6):879\u2013890. https:\/\/doi.org\/10.1108\/JEIM-01-2017-0017","DOI":"10.1108\/JEIM-01-2017-0017"},{"issue":"1","key":"350_CR34","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/opre.48.1.111.12453","volume":"48","author":"F Vanderbeck","year":"2000","unstructured":"Vanderbeck F (2000) On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Oper Res 48(1):111\u2013128. https:\/\/doi.org\/10.1287\/opre.48.1.111.12453","journal-title":"Oper Res"},{"issue":"3","key":"350_CR35","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.orl.2005.05.009","volume":"34","author":"F Vanderbeck","year":"2006","unstructured":"Vanderbeck F, Savelsbergh MWP (2006) A generic view of Dantzig-Wolfe decomposition in mixed integer programming. Oper Res Lett 34(3):296\u2013306. https:\/\/doi.org\/10.1016\/j.orl.2005.05.009","journal-title":"Oper Res Lett"},{"key":"350_CR36","unstructured":"Ramsay TEJ (1981) Integer programming approaches to capacitated concave cost production planning problem. (Ph.D Dissertation), Georgia Institute of Technology."},{"key":"350_CR37","doi-asserted-by":"publisher","unstructured":"Chowdhury NT, Baki F, Azab A (2023) The setup carryover assignment problem. Oper Res Forum 4(25):1\u201313. https:\/\/doi.org\/10.1007\/s43069-023-00207-6","DOI":"10.1007\/s43069-023-00207-6"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00350-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-024-00350-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00350-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T13:08:41Z","timestamp":1728565721000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-024-00350-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,6]]},"references-count":37,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,9]]}},"alternative-id":["350"],"URL":"https:\/\/doi.org\/10.1007\/s43069-024-00350-8","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,6]]},"assertion":[{"value":"6 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors certify that for this manuscript the following is fulfilled.\u00a0This material is the author\u2019s own original work, which has not been previously published elsewhere.\u00a0The paper is not currently being considered for publication elsewhere.\u00a0The paper reflects the authors' own research and analysis in a truthful and complete manner.\u00a0The paper properly credits the meaningful contributions of co-authors and co-researchers.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"68"}}