{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:39:08Z","timestamp":1743140348728,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642200083"},{"type":"electronic","value":"9783642200090"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20009-0_101","type":"book-chapter","created":{"date-parts":[[2011,6,25]],"date-time":"2011-06-25T18:32:23Z","timestamp":1309026743000},"page":"641-646","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving Multi-Level Capacitated Lot Sizing Problems via a Fix-and-Optimize Approach"],"prefix":"10.1007","author":[{"given":"Florian","family":"Sahling","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,21]]},"reference":[{"key":"101_CR1_101","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1287\/mnsc.29.10.1126","volume":"39","author":"PJ Billington","year":"1983","unstructured":"Billington PJ, McClain JO, Thomas LJ (1983) Mathematical programming approaches to capacity-constrained MRP systems: Review, formulation and problem reduction. Management Science 39: 1126\u20131141","journal-title":"Management Science"},{"key":"101_CR2_101","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 (2010) Dynamic capacitated lot-sizing problems \u2013 a classification and review of solution approaches. Operations Research Spectrum 32: 231\u2013261","journal-title":"Operations Research Spectrum"},{"key":"101_CR3_101","doi-asserted-by":"publisher","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. Management Science 26: 669\u2013679","journal-title":"Management Science"},{"key":"101_CR4_101","doi-asserted-by":"publisher","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. International Journal of Production Economics 123: 247\u2013256","journal-title":"International Journal of Production Economics"},{"key":"101_CR5_101","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 JO, van Wassenhove LN (1991) Multilevel capacitated lotsizing complexity and LP-based heuristics. European Journal of Operational Research 53: 131\u2013148","journal-title":"European Journal of Operational Research"},{"key":"101_CR6_101","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-8349-8708-2","volume-title":"Mehrstufige Losgr\u00f6\u00dfenplanung bei Kapazit\u00e4tsrestriktionen","author":"F Sahling","year":"2010","unstructured":"Sahling F (2010) Mehrstufige Losgr\u00f6\u00dfenplanung bei Kapazit\u00e4tsrestriktionen. Gabler, Wiesbaden"},{"key":"101_CR7_101","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, Helber S, Tempelmeier H (2009) Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic. Computers & Operations Research 36: 2546\u20132553","journal-title":"Computers & Operations Research"},{"key":"101_CR8_101","doi-asserted-by":"publisher","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. Operations Research 51: 487\u2013502","journal-title":"Operations Research"},{"key":"101_CR9_101","volume-title":"Description of MLCLSP test instances","author":"H Stadtler","year":"2000","unstructured":"Stadtler H, S\u00fcrie C (2000) Description of MLCLSP test instances. Tech. rep., Technische Universit\u00e4t Darmstadt"},{"key":"101_CR10_101","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1287\/mnsc.49.8.1039.16406","volume":"49","author":"C S\u00fcrie","year":"2003","unstructured":"S\u00fcrie C, Stadtler H (2003) The capacitated lot-sizing problem with linked lot sizes. Management Science 49: 1039\u20131054","journal-title":"Management Science"},{"key":"101_CR11_101","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1287\/mnsc.42.5.738","volume":"42","author":"H Tempelmeier","year":"1996","unstructured":"Tempelmeier H, Derstroff M (1996) A lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Management Science 42: 738\u2013757","journal-title":"Management Science"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2010"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20009-0_101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T14:20:26Z","timestamp":1674483626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-20009-0_101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642200083","9783642200090"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20009-0_101","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"21 June 2011","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}