{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T06:57:07Z","timestamp":1760425027265,"version":"3.38.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,2,24]],"date-time":"2011-02-24T00:00:00Z","timestamp":1298505600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10732-011-9161-7","type":"journal-article","created":{"date-parts":[[2011,2,24]],"date-time":"2011-02-24T02:25:00Z","timestamp":1298514300000},"page":"295-316","source":"Crossref","is-referenced-by-count":12,"title":["A MIP-based framework and its application on\u00a0a\u00a0lot\u00a0sizing problem with setup carryover"],"prefix":"10.1007","volume":"19","author":[{"given":"Marco","family":"Caserta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,2,24]]},"reference":[{"key":"9161_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1951.tb00067.x","volume":"13","author":"G.E.P. Box","year":"1951","unstructured":"Box, G.E.P., Wilson, K.B.: On the experimental attainment of optimum conditions. J. R. Stat. Soc. B 13, 1\u201345 (1951)","journal-title":"J. R. Stat. Soc. B"},{"issue":"2","key":"9161_CR2","doi-asserted-by":"crossref","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.: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. OR Spektrum 32(2), 231\u2013261 (2010)","journal-title":"OR Spektrum"},{"issue":"2","key":"9161_CR3","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/j.cor.2007.10.014","volume":"26","author":"M. Caserta","year":"2009","unstructured":"Caserta, M., Qui\u00f1onez, E.: A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setups. Comput. Oper. Res. 26(2), 530\u2013548 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9161_CR4","volume-title":"A Hybrid Algorithm for the Multi Level Capacitated Lot Sizing Problem with Setup Carryover","author":"M. Caserta","year":"2009","unstructured":"Caserta, M., Ramirez, A., Vo\u00df, S.: A Hybrid Algorithm for the Multi Level Capacitated Lot Sizing Problem with Setup Carryover. Physica, Heidelberg (2009). Chapter: S.\u00a0Vo\u00df, J.\u00a0Pahl and S.\u00a0Schwarze, Logistik Management, pp.\u00a0123\u2013138"},{"key":"9161_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1007\/978-3-642-12242-2_47","volume-title":"A Math-Heuristic for the Multi-Level Capacitated Lot Sizing Problem with Carryover","author":"M. Caserta","year":"2010","unstructured":"Caserta, M., Ramirez, A., Vo\u00df, S.: A Math-Heuristic for the Multi-Level Capacitated Lot Sizing Problem with Carryover. Lecture Notes in Computer Science, vol.\u00a06025, pp.\u00a0462\u2013471 (2010)"},{"key":"9161_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1007\/978-3-642-01129-0_89","volume-title":"A Corridor Method-based Algorithm for the Pre-marshalling Problem","author":"M. Caserta","year":"2009","unstructured":"Caserta, M., Vo\u00df, S.: A Corridor Method-based Algorithm for the Pre-marshalling Problem. Lecture Notes in Computer Science, vol.\u00a05484, pp.\u00a0788\u2013797 (2009)"},{"key":"9161_CR7","author":"M. Caserta","year":"2009","unstructured":"Caserta, M., Vo\u00df, S., Sniedovich, M.: Applying the corridor method to a blocks relocation problem. OR Spektrum (2009). doi: 10.1007\/s00291-009-0176-5","journal-title":"OR Spektrum"},{"issue":"4","key":"9161_CR8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.orl.2009.03.004","volume":"37","author":"E. Dana","year":"2009","unstructured":"Dana, E., Woodruff, D.: How to select a small set of diverse solutions to mixed integer programming problems: good news and bad news. Oper. Res. Lett. 37(4), 255\u2013260 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"9161_CR9","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s10479-005-5724-z","volume":"134","author":"P. Boer De","year":"2005","unstructured":"De\u00a0Boer, P., Kroese, D.P., Mannor, S., Rubinstein, R.Y.: A tutorial on the cross-entropy method. Ann. Oper. Res. 134(1), 19\u201367 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"1\u20133","key":"9161_CR10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. Program. B 98(1\u20133), 23\u201347 (2003)","journal-title":"Math. Program. B"},{"issue":"6","key":"9161_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.: A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover. Manag. Sci. 47(6), 851\u2013863 (2001)","journal-title":"Manag. Sci."},{"issue":"7","key":"9161_CR12","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1080\/00207549508904793","volume":"33","author":"M. Gopalakrishnan","year":"1995","unstructured":"Gopalakrishnan, M., Miller, D.M., Smith, C.P.: A framework for modeling setup carryover in the capacitated lot sizing problem. Int. J. Prod. Res. 33(7), 1973\u20131988 (1995)","journal-title":"Int. J. Prod. Res."},{"key":"9161_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-45735-7","volume-title":"Lotsizing and Scheduling for Production Planning","author":"K. Haase","year":"1994","unstructured":"Haase, K.: Lotsizing and Scheduling for Production Planning. Springer, Berlin (1994)"},{"issue":"3","key":"9161_CR14","doi-asserted-by":"crossref","first-page":"1855","DOI":"10.1016\/j.ejor.2005.12.008","volume":"177","author":"R. Jans","year":"2007","unstructured":"Jans, R., Degraeve, Z.: Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches. Eur. J. Oper. Res. 177(3), 1855\u20131875 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9161_CR15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0377-2217(91)90130-N","volume":"53","author":"J. Maes","year":"1991","unstructured":"Maes, J., McClain, J., Van Wassenhove, L.: Multilevel capacitated lotsizing complexity and LP-based heuristics. Eur. J. Oper. Res. 53(2), 131\u2013148 (1991)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"9161_CR16","doi-asserted-by":"crossref","first-page":"2291","DOI":"10.1080\/00207540500066762","volume":"43","author":"D. Quadt","year":"2005","unstructured":"Quadt, D., Kuhn, H.: Conceptual framework for lot-sizing and scheduling of flexible flow lines. Int. J. Prod. Res. 43(11), 2291\u20132308 (2005)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"9161_CR17","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10288-007-0057-1","volume":"6","author":"D. Quadt","year":"2008","unstructured":"Quadt, D., Kuhn, H.: Capacitated lot-sizing with extensions: a\u00a0review. 4OR 6(1), 61\u201383 (2008)","journal-title":"4OR"},{"issue":"9","key":"9161_CR18","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.: 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 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9161_CR19","first-page":"551","volume":"35","author":"M. Sniedovich","year":"2006","unstructured":"Sniedovich, M., Vo\u00df, S.: The corridor method: a dynamic programming inspired metaheuristic. Control Cybern. 35(3), 551\u2013578 (2006)","journal-title":"Control Cybern."},{"issue":"2","key":"9161_CR20","first-page":"173","volume":"31","author":"C.R. Sox","year":"1999","unstructured":"Sox, C.R., Gao, Y.: The capacitated lot sizing problem with setup carry-over. IIE Trans. 31(2), 173\u2013181 (1999)","journal-title":"IIE Trans."},{"issue":"3","key":"9161_CR21","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/0377-2217(95)00094-1","volume":"94","author":"H. Stadtler","year":"1996","unstructured":"Stadtler, H.: Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing. Eur. J. Oper. Res. 94(3), 561\u2013581 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"9161_CR22","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.: The capacitated lot-sizing problem with linked lot sizes. Manag. Sci. 49(8), 1039\u20131054 (2003)","journal-title":"Manag. Sci."},{"issue":"2","key":"9161_CR23","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s00291-008-0130-y","volume":"31","author":"H. Tempelmeier","year":"2009","unstructured":"Tempelmeier, H., Buschk\u00fchl, L.: A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures. OR Spektrum 31(2), 385\u2013404 (2009)","journal-title":"OR Spektrum"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9161-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9161-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9161-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T23:11:48Z","timestamp":1740957108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9161-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,24]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["9161"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9161-7","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2011,2,24]]}}}