{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T10:45:29Z","timestamp":1760438729391,"version":"3.41.2"},"reference-count":25,"publisher":"Emerald","issue":"6","license":[{"start":{"date-parts":[[2018,9,7]],"date-time":"2018-09-07T00:00:00Z","timestamp":1536278400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JEIM"],"published-print":{"date-parts":[[2018,10,10]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>The capacitated lot sizing problem (CLSP) is one of the most important production planning problems which has been widely studied in lot sizing literature. The CLSP is the extension of the Wagner-Whitin problem where there is one product and no capacity constraints. The CLSP involves determining lot sizes for multiple products on a single machine with limited capacity that may change for each planning period. Determining the right lot sizes has a critical importance on the productivity and success of organizations. The paper aims to discuss these issues.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>This study focuses on the CLSP with setup carryover and backordering. The literature focusing on this problem is rather limited. To fill this gap, a number of problem-specific heuristics have been integrated with fix-and-optimize (FOPT) heuristic in this study. The authors have compared the performances of the proposed approaches to that of the commercial solver and recent results in literature. The obtained results have stated that the proposed approaches are efficient in solving this problem.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>The computational experiments have shown that the proposed approaches are efficient in solving this problem.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>To address the solution of the CLSP with setup carryover and backordering, a number of heuristic approaches consisting of FOPT heuristic are proposed in this paper.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/jeim-01-2017-0017","type":"journal-article","created":{"date-parts":[[2018,9,7]],"date-time":"2018-09-07T06:59:19Z","timestamp":1536303559000},"page":"879-890","source":"Crossref","is-referenced-by-count":5,"title":["Fix-and-optimize heuristics for capacitated lot sizing with setup carryover and backordering"],"prefix":"10.1108","volume":"31","author":[{"given":"Hacer","family":"G\u00fcner G\u00f6ren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Semra","family":"Tunali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2018,9,7]]},"reference":[{"issue":"2","key":"key2021041507574449200_ref300","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1051\/ro:2007014","article-title":"MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs","volume":"41","year":"2007","journal-title":"RAIRO \u2013 Operations Research"},{"issue":"20","key":"key2021041507574449200_ref001","doi-asserted-by":"crossref","first-page":"4873","DOI":"10.1080\/00207540601094465","article-title":"Single machine multi-product capacitated lot sizing with sequence-dependent setups","volume":"45","year":"2007","journal-title":"International Journal of Production Research"},{"key":"key2021041507574449200_ref002","unstructured":"Chen, C.L. (2015), \u201cFix-and-optimize heuristic and MP-based approaches for capacitated lot sizing problem with setup carryover, setup splitting and backlogging\u201d, MSc thesis, Arizona State University, Arizona, available at: https:\/\/repository.asu.edu\/attachments\/157976\/content\/Chen_asu_0010N_15168.pdf (accessed 13 April 2017)."},{"key":"key2021041507574449200_ref003","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.omega.2015.03.002","article-title":"Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems","volume":"56","year":"2015","journal-title":"Omega"},{"key":"key2021041507574449200_ref004","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1057\/palgrave.jors.2601166","article-title":"Solving the capacitated lot-sizing problem with backorder consideration","volume":"52","year":"2001","journal-title":"Journal of Operational Research Society"},{"issue":"6","key":"key2021041507574449200_ref005","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1287\/mnsc.47.6.851.9813","article-title":"A Tabu Search heuristic for the capacitated lot-sizing problem with set-up carryover","volume":"47","year":"2001","journal-title":"Management Science"},{"issue":"6","key":"key2021041507574449200_ref006","first-page":"805","article-title":"Solving the capacitated lot sizing problem with setup carryover using a new sequential hybrid approach","volume":"42","year":"2015","journal-title":"Appllied Intelligence"},{"issue":"6","key":"key2021041507574449200_ref007","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1504\/EJIE.2016.081019","article-title":"A comparative study of hybrid approaches for solving capacitated lot sizing problem with setup carryover and backordering","volume":"10","year":"2016","journal-title":"European Journal of Industrial Engineering"},{"issue":"6","key":"key2021041507574449200_ref008","doi-asserted-by":"crossref","first-page":"1582","DOI":"10.1080\/00207543.2011.559486","article-title":"A hybrid approach for the capacitated lot sizing problem with setup carryover","volume":"50","year":"2012","journal-title":"International Journal of Production Research"},{"key":"key2021041507574449200_ref009","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/j.cor.2003.08.014","article-title":"The capacitated lot sizing and scheduling problem with sequence-dependent set-up costs and set-up times","volume":"32","year":"2005","journal-title":"Computers and Operations Research"},{"key":"key2021041507574449200_ref010","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","year":"2010","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"key2021041507574449200_ref011","first-page":"66","article-title":"A new heuristic for the CLSP problem with backlogging and set-up carryover","volume":"5","year":"2002","journal-title":"International Journal of Advanced Manufacturing Systems"},{"key":"key2021041507574449200_ref012","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1057\/palgrave.jors.2601968","article-title":"A tabu search heuristic for the CLSP with backlogging and set-up carryover","volume":"57","year":"2006","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"key2021041507574449200_ref013","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/j.ejor.2011.05.014","article-title":"Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions","volume":"214","year":"2011","journal-title":"European Journal of Operational Research"},{"key":"key2021041507574449200_ref014","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0925-5273(94)90042-6","article-title":"Lagrangean heuristics for the capacitated multi-item lot sizing problem with backordering","volume":"34","year":"1994","journal-title":"International Journal of Production Economics"},{"issue":"4","key":"key2021041507574449200_ref015","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF03192568","article-title":"A hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over","volume":"14","year":"2008","journal-title":"Journal of the Brazilian Computers Society"},{"key":"key2021041507574449200_ref016","first-page":"317","article-title":"Lot-size models with backlogging: strong reformulations and cutting planes","volume":"40","year":"1988","journal-title":"Mathematical Programming Series A"},{"journal-title":"Production Planning by Mixed Integer Programming","year":"2003","key":"key2021041507574449200_ref301"},{"issue":"4","key":"key2021041507574449200_ref017","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1002\/nav.20345","article-title":"Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over","volume":"56","year":"2009","journal-title":"Naval Research Logistics"},{"issue":"9","key":"key2021041507574449200_ref018","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","year":"2009","journal-title":"Computers and Operations Research"},{"key":"key2021041507574449200_ref019","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.cor.2012.07.002","article-title":"Combining the principles of variable neighborhood decomposition and the fix-and-optimize heuristic to solve the multi-level lot-sizing and scheduling problems","volume":"40","year":"2013","journal-title":"Computers and Operations Research"},{"key":"key2021041507574449200_ref020","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1080\/07408179908969816","article-title":"The capacitated lot-sizing problem with set-up carryover","volume":"31","year":"1999","journal-title":"IIE Transactions"},{"issue":"8","key":"key2021041507574449200_ref021","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1287\/mnsc.49.8.1039.16406","article-title":"The capacitated lot-sizing problem with linked lot sizes","volume":"49","year":"2003","journal-title":"Management Science"},{"key":"key2021041507574449200_ref022","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/mnsc.35.3.353","article-title":"Capacitated lot sizing with setup times","volume":"35","year":"1989","journal-title":"Management Science"},{"issue":"16","key":"key2021041507574449200_ref023","doi-asserted-by":"crossref","first-page":"5011","DOI":"10.1080\/00207543.2013.790570","article-title":"MIP-based fix-and-optimise algorithms for the parallel machine capacitated lot-sizing and scheduling problem","volume":"51","year":"2013","journal-title":"International Journal of Production Research"}],"container-title":["Journal of Enterprise Information Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/JEIM-01-2017-0017\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/JEIM-01-2017-0017\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:30:36Z","timestamp":1753396236000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/jeim\/article\/31\/6\/879-890\/433912"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,7]]},"references-count":25,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2018,9,7]]},"published-print":{"date-parts":[[2018,10,10]]}},"alternative-id":["10.1108\/JEIM-01-2017-0017"],"URL":"https:\/\/doi.org\/10.1108\/jeim-01-2017-0017","relation":{},"ISSN":["1741-0398"],"issn-type":[{"type":"print","value":"1741-0398"}],"subject":[],"published":{"date-parts":[[2018,9,7]]}}}