{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T09:44:32Z","timestamp":1769247872541,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T00:00:00Z","timestamp":1679270400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T00:00:00Z","timestamp":1679270400000},"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-023-00207-6","type":"journal-article","created":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T07:02:55Z","timestamp":1679295775000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Setup Carryover Assignment Problem"],"prefix":"10.1007","volume":"4","author":[{"given":"Nusrat T.","family":"Chowdhury","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fazle","family":"Baki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Azab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,20]]},"reference":[{"issue":"11","key":"207_CR1","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"},{"issue":"3","key":"207_CR2","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1016\/j.ejor.2006.09.010","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi A, Soroush HM (2008) The significance of reducing setup times\/setup costs. Eur J Oper Res 187(3):978\u2013984. https:\/\/doi.org\/10.1016\/j.ejor.2006.09.010","journal-title":"Eur J Oper Res"},{"issue":"2","key":"207_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","volume":"246","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi A (2015) The third comprehensive survey on scheduling problems with setup times\/costs. Eur J Oper Res 246(2):345\u2013378. https:\/\/doi.org\/10.1016\/j.ejor.2015.04.004","journal-title":"Eur J Oper Res"},{"issue":"2","key":"207_CR4","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"},{"key":"207_CR5","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1016\/j.cie.2018.11.035","volume":"127","author":"S Abdullah","year":"2019","unstructured":"Abdullah S, Shamayleh A, Ndiaye M (2019) Three stage dynamic heuristic for multiple plants capacitated lot sizing with sequence-dependent transient costs. Comput Ind Eng 127:1024\u20131036. https:\/\/doi.org\/10.1016\/j.cie.2018.11.035","journal-title":"Comput Ind Eng"},{"issue":"2","key":"207_CR6","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":"207_CR7","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"},{"key":"207_CR8","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":"207_CR9","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"},{"key":"207_CR10","doi-asserted-by":"publisher","unstructured":"Zhang C, Dandan Zhang D, Wu T (2021) Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover. Comput Oper Res 132:(105289). ISSN 0305\u20130548. https:\/\/doi.org\/10.1016\/j.cor.2021.105289","DOI":"10.1016\/j.cor.2021.105289"},{"key":"207_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0024-3795(76)90047-1","volume":"13","author":"AJ Hoffman","year":"1976","unstructured":"Hoffman AJ (1976) Total unimodularity and combinatorial theorems. Linear Algebra Appl 13:103\u2013108","journal-title":"Linear Algebra Appl"},{"key":"207_CR12","doi-asserted-by":"crossref","unstructured":"Hoffman AJ, Kruskal JB (2010) Integral boundary points of convex polyhedra.\u00a050\u00a0Years of integer programming 1958\u20132008, Springer, Berlin, Heidelberg, 49\u201376","DOI":"10.1007\/978-3-540-68279-0_3"},{"key":"207_CR13","unstructured":"Huang K (2005) Multi-stage stochastic programming models in production planning. Ph.D. thesis. Georgia Institute of Technology"},{"key":"207_CR14","doi-asserted-by":"publisher","unstructured":"Zhou Z, Guan Y (2010) Stochastic lot-sizing problem with deterministic demands and Wagner\u2013Whitin costs. Oper Res Lett 38(5):414\u2013419. ISSN 0167\u20136377. https:\/\/doi.org\/10.1016\/j.orl.2010.05.007","DOI":"10.1016\/j.orl.2010.05.007"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00207-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-023-00207-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00207-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T12:22:14Z","timestamp":1688386934000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-023-00207-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,20]]},"references-count":14,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,6]]}},"alternative-id":["207"],"URL":"https:\/\/doi.org\/10.1007\/s43069-023-00207-6","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,20]]},"assertion":[{"value":"25 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 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":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"All authors give their consent for the publication of this research article in Operations Research Forum.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"25"}}