{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T13:58:31Z","timestamp":1784555911735,"version":"3.55.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,7,5]],"date-time":"2012-07-05T00:00:00Z","timestamp":1341446400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s10626-012-0141-3","type":"journal-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T16:33:38Z","timestamp":1346344418000},"page":"211-239","source":"Crossref","is-referenced-by-count":28,"title":["Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms"],"prefix":"10.1007","volume":"23","author":[{"given":"Tao","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kerem","family":"Akartunal\u0131","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jie","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leyuan","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,7,5]]},"reference":[{"issue":"2","key":"141_CR1","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/j.ejor.2007.11.033","volume":"193","author":"K Akartunal\u0131","year":"2009","unstructured":"Akartunal\u0131 K, Miller AJ (2009) A heuristic approach for big bucket multi-level production planning problems. Eur J Oper Res 193(2):396\u2013411","journal-title":"Eur J Oper Res"},{"issue":"3","key":"141_CR2","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1080\/00207540802446787","volume":"48","author":"B Almada-Lobo","year":"2010","unstructured":"Almada-Lobo B, James RJW (2010) Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups. Int J Prod Res 48(3):861\u2013878","journal-title":"Int J Prod Res"},{"issue":"10","key":"141_CR3","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1287\/mnsc.30.10.1255","volume":"30","author":"I Barany","year":"1984","unstructured":"Barany I, Van Roy TJ, Wolsey LA (1984) Strong formulations for multi-item capacitated lot-sizing. Manage Sci 30(10):1255\u20131261","journal-title":"Manage Sci"},{"issue":"5","key":"141_CR4","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1287\/mnsc.46.5.724.12048","volume":"46","author":"G Belvaux","year":"2000","unstructured":"Belvaux G, Wolsey LA (2000) Bc-prod: a specialized branch-and-cut system for lot-sizing problems. Manage Sci 46(5):724\u2013738","journal-title":"Manage Sci"},{"issue":"11","key":"141_CR5","doi-asserted-by":"crossref","first-page":"3644","DOI":"10.1016\/j.cor.2007.04.003","volume":"35","author":"P Beraldi","year":"2008","unstructured":"Beraldi P, Ghiani G, Grieco A, Guerriero E (2008) Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs. Comput Oper Res 35(11):3644\u20133656","journal-title":"Comput Oper Res"},{"issue":"10","key":"141_CR6","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1287\/mnsc.29.10.1126","volume":"29","author":"P Billington","year":"1983","unstructured":"Billington P, McClain J, Thomas L (1983) Mathematical programming approaches to capacity-constrained MRP systems: review, formulation and problem reduction. Manage Sci 29(10):1126\u20131141","journal-title":"Manage Sci"},{"issue":"11","key":"141_CR7","doi-asserted-by":"crossref","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","journal-title":"IIE Trans"},{"issue":"6","key":"141_CR8","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/opre.35.6.832","volume":"35","author":"GD Eppen","year":"1987","unstructured":"Eppen GD, Martin RK (1987) Solving multi-item lot-sizing problems using variable redefinition. Oper Res 35(6):832\u2013848","journal-title":"Oper Res"},{"issue":"4","key":"141_CR9","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/1520-6750(199306)40:4<459::AID-NAV3220400404>3.0.CO;2-8","volume":"40","author":"A Federgruen","year":"1993","unstructured":"Federgruen A, Tzur M (1993) The dynamic lot-sizing model with backlogging: a simple O(n log n) algorithm and minimal forecast horizon procedure. Nav Res Logist 40(4):459\u2013478","journal-title":"Nav Res Logist"},{"issue":"3","key":"141_CR10","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1287\/opre.1070.0392","volume":"55","author":"A Federgruen","year":"2007","unstructured":"Federgruen A, Meissner J, Tzur M (2007) Progressive interval heuristics for multi-item capacitated lot-sizing problems. Oper Res 55(3):490\u2013502","journal-title":"Oper Res"},{"key":"141_CR11","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1016\/j.ejor.2008.03.035","volume":"196","author":"D Ferreira","year":"2009","unstructured":"Ferreira D, Morabito R, Rangel S (2009) Solution approaches for the soft drink integrated production lot sizing and scheduling problem. Eur J Oper Res 196:697\u2013706","journal-title":"Eur J Oper Res"},{"issue":"1","key":"141_CR12","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/opre.1040.0163","volume":"53","author":"I Ganas","year":"2005","unstructured":"Ganas I, Papachristos S (2005) The single-product lot-sizing problem with constant parameters and backlogging: exact results, a new solution, and all parameter stability regions. Oper Res 53(1):170\u2013176","journal-title":"Oper Res"},{"issue":"6","key":"141_CR13","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 JM, Mohan S (2001) A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover. Manage Sci 47(6):851\u2013863","journal-title":"Manage Sci"},{"issue":"2","key":"141_CR14","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 Prod Econ 123(2):247\u2013256","journal-title":"Int J Prod Econ"},{"issue":"4","key":"141_CR15","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.cie.2003.09.006","volume":"45","author":"YF Hung","year":"2003","unstructured":"Hung YF, Chen CP, Shih CC, Hung MH (2003) Using tabu search with ranking candidate list to solve production planning problems with setups. Comput Ind Eng 45(4):615\u2013634","journal-title":"Comput Ind Eng"},{"issue":"12","key":"141_CR16","doi-asserted-by":"crossref","first-page":"1816","DOI":"10.1016\/j.cor.2011.02.005","volume":"38","author":"RJW James","year":"2011","unstructured":"James RJW, Almada-Lobo B (2011) Single and parallel machine capacitated lotsizing and scheduling: new iterative mip-based neighborhood search heuristics. Comput Oper Res 38(12):1816\u20131825","journal-title":"Comput Oper Res"},{"issue":"2","key":"141_CR17","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1057\/palgrave.jors.2601968","volume":"57","author":"B Karimi","year":"2006","unstructured":"Karimi B, Ghomiand SMTF, Wilson JM (2006) A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over. J Oper Res Soc 57(2):140\u2013147","journal-title":"J Oper Res Soc"},{"issue":"2","key":"141_CR18","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.cor.2009.05.007","volume":"37","author":"S Kim","year":"2010","unstructured":"Kim S, Han J, Lee Y, Park E (2010) Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum. Comput Oper Res 37(2):302\u2013314","journal-title":"Comput Oper Res"},{"key":"141_CR19","first-page":"155","volume-title":"Optimierung bei Graphentheoretischen und Ganzzahligen Probleme","author":"J Krarup","year":"1977","unstructured":"Krarup J, Bilde O (1977) Plant location, set covering and economic lot sizes: an O(mn) algorithm for structured problems. In: Optimierung bei Graphentheoretischen und Ganzzahligen Probleme. Birkhauser, Basel, pp\u00a0155\u2013180"},{"issue":"1","key":"141_CR20","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10107-007-0186-5","volume":"118","author":"S Kucukyavuz","year":"2009","unstructured":"Kucukyavuz S, Pochet Y (2009) Uncapacitated lot sizing with backlogging: the convex hull. Math Program 118(1):151\u2013175","journal-title":"Math Program"},{"issue":"1","key":"141_CR21","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1080\/07408179308964266","volume":"25","author":"R Kuik","year":"1993","unstructured":"Kuik R, Salomon M, Vanwassenhove LN, Maes J (1993) Linear-programming, simulated annealing and tabu search heuristics for lotsizing in bottleneck assembly systems. IIE Trans 25(1):62\u201372","journal-title":"IIE Trans"},{"issue":"1","key":"141_CR22","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10107-004-0521-z","volume":"108","author":"VV Mathieu","year":"2006","unstructured":"Mathieu VV (2006) Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity. Math Program 108(1):53\u201377","journal-title":"Math Program"},{"issue":"1","key":"141_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0925-5273(94)90042-6","volume":"34","author":"HH Millar","year":"1994","unstructured":"Millar HH, Yang MZ (1994) Lagrangian heuristics for the capacitated multiitem lot-sizing problem with backordering. Int J Prod Econ 34(1):1\u201315","journal-title":"Int J Prod Econ"},{"issue":"4","key":"141_CR24","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1287\/opre.51.4.557.16094","volume":"51","author":"AJ Miller","year":"2003","unstructured":"Miller AJ, Wolsey LA (2003) Tight MIP formulations for multi-item discrete lot-sizing problems. Oper Res 51(4):557\u2013565","journal-title":"Oper Res"},{"key":"141_CR25","unstructured":"Multi-LSB (2011) Multi-item lot-sizing problems with backlogging: a library of test instances. http:\/\/personal.strath.ac.uk\/kerem.akartunali\/research\/multi-lsb\/ . Accessed 15 June 2012"},{"issue":"3","key":"141_CR26","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF01580738","volume":"40","author":"Y Pochet","year":"1988","unstructured":"Pochet Y, Wolsey LA (1988) Lot-size models with backlogging: strong reformulations and cutting planes. Math Program 40(3):317\u2013335","journal-title":"Math Program"},{"issue":"1","key":"141_CR27","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/mnsc.37.1.53","volume":"37","author":"Y Pochet","year":"1991","unstructured":"Pochet Y, Wolsey LA (1991) Solving multi-item lot-sizing problems using strong cutting planes. Manage Sci 37(1):53\u201367","journal-title":"Manage Sci"},{"issue":"9","key":"141_CR28","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, Buschkuhl 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","journal-title":"Comput Oper Res"},{"issue":"6","key":"141_CR29","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1002\/nav.20097","volume":"52","author":"NC Simpson","year":"2005","unstructured":"Simpson NC, Erenguc SS (2005) Modeling multiple stage manufacturing systems with generalized costs and capacity issues. Nav Res Logist 52(6):560\u2013570","journal-title":"Nav Res Logist"},{"issue":"1","key":"141_CR30","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.ejor.2003.04.001","volume":"161","author":"YY Song","year":"2005","unstructured":"Song YY, Chan GH (2005) Single item lot-sizing problems with backlogging on a single machine at a finite production rate. Eur J Oper Res 161(1):191\u2013202","journal-title":"Eur J Oper Res"},{"issue":"2","key":"141_CR31","first-page":"173","volume":"31","author":"CR Sox","year":"1999","unstructured":"Sox CR, Gao YB (1999) The capacitated lot sizing problem with setup carry-over. IIE Trans 31(2):173\u2013181","journal-title":"IIE Trans"},{"issue":"3","key":"141_CR32","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.51.3.487.14949","volume":"51","author":"H Stadtler","year":"2003","unstructured":"Stadtler H (2003) Multilevel lot sizing with setup times and multiple constrained resources: internally rolling schedules with lot-sizing windows. Oper Res 51(3):487\u2013502","journal-title":"Oper Res"},{"issue":"8","key":"141_CR33","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 with linked lot sizes. Manage Sci 49(8):1039\u20131054","journal-title":"Manage Sci"},{"issue":"2","key":"141_CR34","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s00291-008-0130-y","volume":"31","author":"H Tempelmeier","year":"2009","unstructured":"Tempelmeier H, Buschkuhl 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","journal-title":"OR Spectrum"},{"issue":"5","key":"141_CR35","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1287\/mnsc.42.5.738","volume":"42","author":"H Tempelmeier","year":"1996","unstructured":"Tempelmeier H, Derstroff M (1996) A lagrangian-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Manage Sci 42(5):738\u2013757","journal-title":"Manage Sci"},{"issue":"2","key":"141_CR36","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1016\/j.ejor.2011.04.029","volume":"214","author":"T Wu","year":"2011","unstructured":"Wu T, Shi L, Geunes J, Akartunali K (2011a) An optimization framework for solving multi-level lot sizing problems with backlogging. Eur J Oper Res 214(2):428\u2013441","journal-title":"Eur J Oper Res"},{"issue":"2","key":"141_CR38","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s11518-011-5160-3","volume":"20","author":"T Wu","year":"2011b","unstructured":"Wu T, Zhang D, He Y (2011b) A novel mixed integer programming formulation and progressively stochastic search for capacitated lot sizing. J Syst Sci Syst Eng 20(2):173\u2013192","journal-title":"J Syst Sci Syst Eng"},{"issue":"2","key":"141_CR37","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/s10479-011-1026-9","volume":"196","author":"T Wu","year":"2012","unstructured":"Wu T, Shi L, Song J (2012a) An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times. Ann Oper Res 196(1):635\u2013650","journal-title":"Ann Oper Res."},{"issue":"4","key":"141_CR39","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1007\/s10898-011-9728-8","volume":"53","author":"T Wu","year":"2012","unstructured":"Wu T, Shi L, Geunes J, Akartunali K (2012b) On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times. J Global Optim 53(4):615\u2013639","journal-title":"J Global Optim"}],"container-title":["Discrete Event Dynamic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-012-0141-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10626-012-0141-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-012-0141-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:53Z","timestamp":1559246333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10626-012-0141-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,5]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["141"],"URL":"https:\/\/doi.org\/10.1007\/s10626-012-0141-3","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"value":"0924-6703","type":"print"},{"value":"1573-7594","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,5]]}}}