{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T13:53:01Z","timestamp":1770990781034,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642122415","type":"print"},{"value":"9783642122422","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12242-2_47","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T17:12:14Z","timestamp":1270055534000},"page":"462-471","source":"Crossref","is-referenced-by-count":9,"title":["A Math-Heuristic for the Multi-Level Capacitated Lot Sizing Problem with Carryover"],"prefix":"10.1007","author":[{"given":"Marco","family":"Caserta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adriana","family":"Ramirez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1951.tb00067.x","volume":"13","author":"G. Box","year":"1951","unstructured":"Box, G., Wilson, K.: On the Experimental Attainment of Optimum Conditions. Journal of the Royal Statistical Society\u00a0B-13, 1\u201345 (1951)","journal-title":"Journal of the Royal Statistical Society B-"},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"Buschk\u00fchl, L., Sahling, F., Helber, S., Tempelmeier, H.: Dynamic capacitated lot-sizing problems: a clasification and review of solution approaches. OR Spectrum (2008), doi:10.1007\/s00291-008-0150-7","DOI":"10.1007\/s00291-008-0150-7"},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-7908-2362-2_6","volume-title":"Logistik Management","author":"M. Caserta","year":"2009","unstructured":"Caserta, M., Ramirez, A., Vo\u00df, S., Moreno, R.: A hybrid algorithm for the multi level capacitated lot sizing problem with setup carryover. In: Vo\u00df, S., Pahl, J., Schwarze, S. (eds.) Logistik Management, pp. 123\u2013138. Physica, Heidelberg (2009)"},{"issue":"2","key":"47_CR4","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.cor.2007.10.014","volume":"36","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. Computers and Operations Research\u00a036(2), 530\u2013548 (2009)","journal-title":"Computers and Operations Research"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Caserta, M., Vo\u00df, S., Sniedovich, M.: Applying the corridor method to a block relocation problem. OR Spectrum (2009), doi:10.1007\/s00291-009-0176-5","DOI":"10.1007\/s00291-009-0176-5"},{"key":"47_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1007\/978-3-642-01129-0_89","volume-title":"Applications of Evolutionary Computing","author":"M. Caserta","year":"2009","unstructured":"Caserta, M., Vo\u00df, S.: A corridor method-based algorithm for the pre-marshalling problem. In: Giacobini, M., et al. (eds.) EvoWorkshops 2009. LNCS, vol.\u00a05484, pp. 788\u2013797. Springer, Heidelberg (2009)"},{"issue":"1","key":"47_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10479-005-5724-z","volume":"134","author":"P. Boer De","year":"2005","unstructured":"De Boer, P., Kroese, D.P., Mannor, S., Rubinstein, R.Y.: A tutorial on the cross-entropy method. Annals of Operations Research\u00a0134(1), 19\u201367 (2005)","journal-title":"Annals of Operations Research"},{"key":"47_CR8","doi-asserted-by":"publisher","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. European Journal of Operational Research\u00a053, 131\u2013148 (1991)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"47_CR9","doi-asserted-by":"publisher","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 review. 4OR: A Quarterly Journal of Operations Research\u00a06(1), 61\u201383 (2008)","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"issue":"9","key":"47_CR10","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.: Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic. Computers and Operations Research\u00a036(9), 2546\u20132553 (2009)","journal-title":"Computers and Operations Research"},{"issue":"3","key":"47_CR11","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 and Cybernetics\u00a035(3), 551\u2013578 (2006)","journal-title":"Control and Cybernetics"},{"issue":"8","key":"47_CR12","doi-asserted-by":"publisher","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. Management Science\u00a049(8), 1039\u20131054 (2003)","journal-title":"Management Science"},{"issue":"5","key":"47_CR13","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1287\/mnsc.42.5.738","volume":"42","author":"H. Tempelmeier","year":"1996","unstructured":"Tempelmeier, H., Destroff, M.: A lagrangian-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Management Science\u00a042(5), 738\u2013757 (1996)","journal-title":"Management Science"},{"key":"47_CR14","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.: A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures. OR Spectrum\u00a031, 385\u2013404 (2009)","journal-title":"OR Spectrum"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12242-2_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T20:09:27Z","timestamp":1739995767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12242-2_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642122415","9783642122422"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12242-2_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}