{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T11:04:21Z","timestamp":1778756661891,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,12,31]],"date-time":"2014-12-31T00:00:00Z","timestamp":1419984000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10489-014-0626-x","type":"journal-article","created":{"date-parts":[[2014,12,29]],"date-time":"2014-12-29T23:16:44Z","timestamp":1419895004000},"page":"805-816","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Solving the capacitated lot sizing problem with setup carryover using a new sequential hybrid approach"],"prefix":"10.1007","volume":"42","author":[{"given":"Hacer G\u00fcner","family":"G\u00f6ren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Semra","family":"Tunal\u0131","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,31]]},"reference":[{"issue":"6","key":"626_CR1","doi-asserted-by":"crossref","first-page":"1582","DOI":"10.1080\/00207543.2011.559486","volume":"50","author":"H G\u00f6ren G\u00fcner","year":"2012","unstructured":"G\u00f6ren G\u00fcner H, Tunali S, Jans R (2012) A hybrid approach for the capacitated lot sizing problem with setup carryover. Int J of Produc Res 50(6):1582\u20131597","journal-title":"Int J of Produc Res"},{"key":"626_CR2","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1287\/mnsc.26.7.669","volume":"26","author":"M Florian","year":"1980","unstructured":"Florian M, Lenstra JK, Rinnooy Kan AHG (1980) Deterministic production planning: Algorithms and complexity. Manag Sci 26:669\u2013679","journal-title":"Manag Sci"},{"key":"626_CR3","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/mnsc.35.3.353","volume":"35","author":"W Trigeiro","year":"1989","unstructured":"Trigeiro W, Thomas LJ, McClain JO (1989) Capacitated Lot Sizing with setup times. Manag Sci 35:353\u2013366","journal-title":"Manag Sci"},{"key":"626_CR4","first-page":"105","volume-title":"On solving a large-scale resource allocation problem in production planning","author":"C Dillenberger","year":"1993","unstructured":"Dillenberger C, Escudero LF, Wollensak A, Zhang W (1993) Operations research in production planning and control. In: Fandel G , Gulledge T, Jones A (eds) On solving a large-scale resource allocation problem in production planning. Springer, Heidelberg, pp 105\u2013119"},{"key":"626_CR5","first-page":"173","volume":"31","author":"CR Sox","year":"1999","unstructured":"Sox CR, Gao Y (1999) The capacitated lot-sizing problem with set-up carryover. IIE IIE Transac 31:173\u2013181","journal-title":"IIE IIE Transac"},{"issue":"8","key":"626_CR6","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1287\/mnsc.49.8.1039.16406","volume":"49","author":"C Suerie","year":"2003","unstructured":"Suerie C, Stadtler H (2003) The capacitated lot-sizing problem with linked lot sizes. Manag Sci 49(8):1039\u20131054","journal-title":"Manag Sci"},{"issue":"9","key":"626_CR7","doi-asserted-by":"crossref","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. Computer and Op Res 36(9):2546\u20132553","journal-title":"Computer and Op Res"},{"key":"626_CR8","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.ijpe.2009.08.022","volume":"123","author":"S Helber","year":"2010","unstructured":"Helber S, Sahling F (2010) A fix-and-optimize approach for the multi-level capacitated lot sizing problem. Int J of Prod Econ 123:247\u2013256","journal-title":"Int J of Prod Econ"},{"key":"626_CR9","first-page":"214","volume":"3","author":"JC Lang","year":"2011","unstructured":"Lang JC, Shen Z-JM (2011) Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions. European J of Oper Res 3:214","journal-title":"European J of Oper Res"},{"issue":"16","key":"626_CR10","doi-asserted-by":"crossref","first-page":"5011","DOI":"10.1080\/00207543.2013.790570","volume":"51","author":"J Xiao","year":"2013","unstructured":"Xiao J, Zhang C, Zheng L, Gupta JND (2013) MIP-based fix-and-optimise algorithms for the parallel machine capacitated lot-sizing and scheduling problem. Int J of Produc Res 51(16):5011\u20135028","journal-title":"Int J of Produc Res"},{"issue":"6","key":"626_CR11","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1287\/mnsc.47.6.851.9813","volume":"47","author":"M Gopalakrishnan","year":"2001","unstructured":"Gopalakrishnan M, Ding K, Bourjolly J-M, Mohan S. (2001) A Tabu search heuristic for the capacitated lot-sizing problem with set-up carryover. Manag Sci 47(6):851\u2013863","journal-title":"Manag Sci"},{"key":"626_CR12","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1057\/palgrave.jors.2601968","volume":"57","author":"B Karimi","year":"2006","unstructured":"Karimi B, Ghomi FSMT, Wilson JM (2006) A tabu search heuristic for the CLSP with backlogging and set-up carryover. J of the Opl Res Soc 2006 57:140\u2013157","journal-title":"J of the Opl Res Soc 2006"},{"issue":"4","key":"626_CR13","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF03192568","volume":"14","author":"MC Nascimento","year":"2008","unstructured":"Nascimento MC, Toledo FMB (2008) A hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over. J of the Braz Computer Soc 14(4):7\u201315","journal-title":"J of the Braz Computer Soc"},{"key":"626_CR14","unstructured":"Haase K (1994) Lot sizing and scheduling for Production Planning. In: Lecture Notes in Economics and Mathematical Systems. Springer, Berlin, p 408"},{"key":"626_CR15","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/978-3-662-03742-3_6","volume-title":"Beyond Manufacturing Resource Planning (MRP II). 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. In: Drexl A, Kimms A (eds) Beyond Manufacturing Resource Planning (MRP II). Advanced Models and Methods for Production Planning. Springer, Berlin, pp 127\u2013146"},{"issue":"2","key":"626_CR16","first-page":"66","volume":"5","author":"B Karimi","year":"2002","unstructured":"Karimi B, Ghomi F (2002) A new heuristic for the CLSP problem with backlogging and set-up carryover. Int J of Adv Manuf Syst 5(2):66\u201377","journal-title":"Int J of Adv Manuf Syst"},{"key":"626_CR17","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/j.cor.2003.08.014","volume":"32","author":"D Gupta","year":"2005","unstructured":"Gupta D, Magnusson T (2005) The capacitated lot sizing and scheduling problem with sequence-dependent set-up costs and set-up times. Comp Op Res 32:727\u2013747","journal-title":"Comp Op Res"},{"key":"626_CR18","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.cor.2012.07.002","volume":"40","author":"F Seanner","year":"2013","unstructured":"Seanner F, Almada-Lobo B, Meyr H (2013) Combining the principles of variable neighborhood decomposition and the fix-and-optimize heuristic to solve the multi-level lot-sizing and scheduling problems. Comp Op Res 40:303\u2013317","journal-title":"Comp Op Res"},{"key":"626_CR19","volume-title":"Genetic Algorithms and Engineering Design","author":"M Gen","year":"1997","unstructured":"Gen M, Cheng R (1997) Genetic Algorithms and Engineering Design. John Wiley and Sons, New York"},{"issue":"3","key":"626_CR20","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/s10489-011-0278-z","volume":"36","author":"MH Kang","year":"2012","unstructured":"Kang MH, Choi HR, Kim HS, Park BJ (2012) Development of a maritime transportation planning support system for car carriers based on genetic algorithm. Appl Intell 36(3):585\u2013604","journal-title":"Appl Intell"},{"issue":"1","key":"626_CR21","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10489-006-6926-z","volume":"24","author":"B Ombuki","year":"2006","unstructured":"Ombuki B, Ross BJ, Hanshar F (2006) Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl Intell 24(1):17\u201330","journal-title":"Appl Intell"},{"issue":"2","key":"626_CR22","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s10489-008-0158-3","volume":"33","author":"EE Korkmaz","year":"2010","unstructured":"Korkmaz EE (2010) Multi-objective genetic algorithms for grouping problems. Appl Intell 33(2):179\u2013192","journal-title":"Appl Intell"},{"issue":"6","key":"626_CR23","doi-asserted-by":"crossref","first-page":"7201","DOI":"10.1016\/j.eswa.2010.12.038","volume":"38","author":"M Mohammadi","year":"2011","unstructured":"Mohammadi M, Ghomi FSMT (2011) Genetic algorithm-based heuristic for capacitated lot sizing problem in flow shops with sequence-dependent setups. Expert Syst Appl 38(6):7201\u20137207","journal-title":"Expert Syst Appl"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0626-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-014-0626-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0626-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:25:54Z","timestamp":1559139954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-014-0626-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,31]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["626"],"URL":"https:\/\/doi.org\/10.1007\/s10489-014-0626-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,31]]}}}