{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T04:19:15Z","timestamp":1778041155797,"version":"3.51.4"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,10,30]],"date-time":"2007-10-30T00:00:00Z","timestamp":1193702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s10288-007-0057-1","type":"journal-article","created":{"date-parts":[[2007,10,29]],"date-time":"2007-10-29T09:32:03Z","timestamp":1193650323000},"page":"61-83","source":"Crossref","is-referenced-by-count":121,"title":["Capacitated lot-sizing with extensions: a review"],"prefix":"10.1007","volume":"6","author":[{"given":"Daniel","family":"Quadt","sequence":"first","affiliation":[]},{"given":"Heinrich","family":"Kuhn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,30]]},"reference":[{"issue":"3","key":"57_CR1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0272-6963(82)90005-5","volume":"2","author":"OA Aras","year":"1982","unstructured":"Aras OA and Swanson LA (1982). A lot sizing and sequencing algorithm for dynamic demands upon a single facility. J Oper Manage 2(3): 177\u2013185","journal-title":"J Oper Manage"},{"issue":"3","key":"57_CR2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1287\/opre.35.3.329","volume":"35","author":"HC Bahl","year":"1987","unstructured":"Bahl HC, Ritzman LP and Gupta JND (1987). Determining lot sizes and resource requirements: a review. Oper Res 35(3): 329\u2013345","journal-title":"Oper Res"},{"key":"57_CR3","unstructured":"Baker T, Muckstadt J Jr (1989) The CHES problems. Working paper, Chesapeake Decision Sciences, Inc., NJ"},{"issue":"5","key":"57_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 and Wolsey LA (2000). bc \u2013 prod: a specialized branch-and-cut system for lot-sizing problems. Manage Sci 46(5): 724\u2013738","journal-title":"Manage Sci"},{"issue":"10","key":"57_CR5","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1287\/mnsc.29.10.1126","volume":"29","author":"PJ Billington","year":"1983","unstructured":"Billington PJ, McClain JO and Thomas LJ (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":"10","key":"57_CR6","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1287\/mnsc.28.10.1174","volume":"28","author":"GR Bitran","year":"1982","unstructured":"Bitran GR and Yanasse HH (1982). Computational complexity of the capacitated lot size problem. Manage Sci 28(10): 1174\u20131186","journal-title":"Manage Sci"},{"key":"57_CR7","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1057\/palgrave.jors.2601166","volume":"52","author":"CH Cheng","year":"2001","unstructured":"Cheng CH, Madan MS, Gupta Y and So S (2001). Solving the capacitated lot-sizing problem with backorder consideration. J Oper Res Soc 52: 952\u2013959","journal-title":"J Oper Res Soc"},{"issue":"3","key":"57_CR8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.jom.2004.08.009","volume":"24","author":"DL Cooke","year":"2006","unstructured":"Cooke DL and Rohleder TR (2006). Inventory evaluation and product slate management in large-scale continuous process industries. J Oper Manage 24(3): 235\u2013249","journal-title":"J Oper Manage"},{"key":"57_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-57874-8","volume-title":"Mehrstufige Losgr\u00f6\u00dfenplanung mit Kapazit\u00e4tsbeschr\u00e4nkungen","author":"MC Derstroff","year":"1995","unstructured":"Derstroff MC (1995). Mehrstufige Losgr\u00f6\u00dfenplanung mit Kapazit\u00e4tsbeschr\u00e4nkungen. Physica, Heidelberg"},{"issue":"9","key":"57_CR10","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1287\/mnsc.38.9.1329","volume":"38","author":"M Diaby","year":"1992","unstructured":"Diaby M, Bahl HC, Karwan MH and Zionts S (1992). A lagrangean relaxation approach for very-large-scale capacitated lot-sizing. Manage Sci 38(9): 1329\u20131340","journal-title":"Manage Sci"},{"key":"57_CR11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-642-78063-9_7","volume-title":"Operations research in production planning and control","author":"C Dillenberger","year":"1993","unstructured":"Dillenberger C, Escudero LF, Wollensak A and Zhang W (1993). On solving a large-scale resource allocation problem in production planning. In: Fandel, G, Gulledge, T, and Jones, A (eds) Operations research in production planning and control, pp 105\u2013119. Springer, Berlin"},{"issue":"2","key":"57_CR12","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0377-2217(94)90074-4","volume":"75","author":"C Dillenberger","year":"1994","unstructured":"Dillenberger C, Escudero LF, Wollensak A and Zhang W (1994). On practical resource allocation for production planning and scheduling with period overlapping setups. Eur J Oper Res 75(2): 275\u2013286","journal-title":"Eur J Oper Res"},{"key":"57_CR13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0377-2217(97)00030-1","volume":"99","author":"A Drexl","year":"1997","unstructured":"Drexl A and Kimms A (1997). Lot sizing and scheduling\u2014survey and extensions. Eur J Oper Res 99: 221\u2013235","journal-title":"Eur J Oper Res"},{"issue":"6","key":"57_CR14","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/opre.35.6.832","volume":"35","author":"GD Eppen","year":"1987","unstructured":"Eppen GD and Martin RK (1987). Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper Res 35(6): 832\u2013848","journal-title":"Oper Res"},{"key":"57_CR15","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/moor.12.4.634","volume":"12","author":"R Erickson","year":"1987","unstructured":"Erickson R, Monma C and Veinott A (1987). Send-and-split methods for minimum-concave-cost network flows. Math Oper Res 12: 634\u2013664","journal-title":"Math Oper Res"},{"key":"57_CR16","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01539800","volume":"19","author":"B Fleischmann","year":"1997","unstructured":"Fleischmann B and Meyr H (1997). The general lotsizing and scheduling problem. OR Spektrum 19: 11\u201321","journal-title":"OR Spektrum"},{"issue":"6","key":"57_CR17","first-page":"937","volume":"17","author":"Y Gao","year":"2000","unstructured":"Gao Y (2000). A heuristic procedure for the capacitated lot sizing problem with set-up carry-over. Control Theory Appl 17(6): 937\u2013940","journal-title":"Control Theory Appl"},{"issue":"14","key":"57_CR18","doi-asserted-by":"crossref","first-page":"3421","DOI":"10.1080\/002075400418324","volume":"38","author":"M Gopalakrishnan","year":"2000","unstructured":"Gopalakrishnan M (2000). A modified framework for modelling set-up carryover in the capacitated lotsizing problem. Int J Prod Res 38(14): 3421\u20133424","journal-title":"Int J Prod Res"},{"key":"57_CR19","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1080\/00207549508904793","volume":"33","author":"M Gopalakrishnan","year":"1995","unstructured":"Gopalakrishnan M, Miller D and Schmidt C (1995). A framework for modelling setup carryover in the capacitated lot sizing problem. Int J Prod Res 33: 1973\u20131988","journal-title":"Int J Prod Res"},{"issue":"6","key":"57_CR20","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 and 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"},{"key":"57_CR21","volume-title":"Multi-level sequence-dependent dynamic lotsizing and scheduling","author":"T Gr\u00fcnert","year":"1998","unstructured":"Gr\u00fcnert T (1998). Multi-level sequence-dependent dynamic lotsizing and scheduling. Shaker, Aachen"},{"key":"57_CR22","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 (1994). Lotsizing and scheduling for production planning. Springer, Berlin"},{"key":"57_CR23","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01539882","volume":"18","author":"K Haase","year":"1996","unstructured":"Haase K (1996). Capacitated lot-sizing with sequence dependent setup costs. OR Spektrum 18: 51\u201359","journal-title":"OR Spektrum"},{"key":"57_CR24","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/978-3-662-03742-3_6","volume-title":"Beyond manufacturing resource planning (MRP II)\u2014advanced 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 and Kimms, A (eds) Beyond manufacturing resource planning (MRP II)\u2014advanced models and methods for production planning, pp 127\u2013146. Springer, Berlin"},{"key":"57_CR25","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0925-5273(99)00119-X","volume":"66","author":"K Haase","year":"2000","unstructured":"Haase K and Kimms A (2000). Lot sizing and scheduling with sequence dependent setup costs and times and efficient rescheduling opportunities. Int J Prod Econ 66: 159\u2013169","journal-title":"Int J Prod Econ"},{"key":"57_CR26","volume-title":"Kapazit\u00e4tsorientierte Losgr\u00f6\u00dfenplanung in PPS-Systemen","author":"S Helber","year":"1994","unstructured":"Helber S (1994). Kapazit\u00e4tsorientierte Losgr\u00f6\u00dfenplanung in PPS-Systemen. M&P Verlag f\u00fcr Wissenschaft und Forschung, Stuttgart"},{"key":"57_CR27","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0377-2217(92)90198-I","volume":"59","author":"RMJ Heuts","year":"1992","unstructured":"Heuts RMJ, Seidel HP and Selen WJ (1992). A comparison of two lot sizing-sequencing heuristics for the process industry. Eur J Oper Res 59: 413\u2013424","journal-title":"Eur J Oper Res"},{"key":"57_CR28","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1057\/jors.1995.65","volume":"46","author":"KS Hindi","year":"1995","unstructured":"Hindi KS (1995a). Algorithms for capacitated, multi-item lot-sizing without set-ups. J Oper Res Soc 46: 465\u2013472","journal-title":"J Oper Res Soc"},{"issue":"4","key":"57_CR29","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1016\/0360-8352(95)00027-X","volume":"28","author":"KS Hindi","year":"1995","unstructured":"Hindi KS (1995b). Solving the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs by tabu search. Comput Ind Eng 28(4): 701\u2013707","journal-title":"Comput Ind Eng"},{"issue":"11","key":"57_CR30","doi-asserted-by":"crossref","first-page":"1309","DOI":"10.1057\/palgrave.jors.2601026","volume":"51","author":"YF Hung","year":"2000","unstructured":"Hung YF and Chien KL (2000). A multi-class multi-level capacitated lot sizing model. J Oper Res Soc 51(11): 1309\u20131318","journal-title":"J Oper Res Soc"},{"issue":"2","key":"57_CR31","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/mnsc.45.2.273","volume":"45","author":"S Kang","year":"1999","unstructured":"Kang S, Malik K and Thomas LJ (1999). Lotsizing and scheduling on parallel machines with sequence-dependent setup costs. Manage Sci 45(2): 273\u2013289","journal-title":"Manage Sci"},{"issue":"5","key":"57_CR32","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0305-0483(03)00059-8","volume":"31","author":"B Karimi","year":"2003","unstructured":"Karimi B, Fathemi Ghomi SMT and Wilson JM (2003). The capacitated lot sizing problem: a review of models and algorithms. Omega Int J Manage Sci 31(5): 365\u2013378","journal-title":"Omega Int J Manage Sci"},{"issue":"2","key":"57_CR33","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1057\/palgrave.jors.2601968","volume":"57","author":"B Karimi","year":"2006","unstructured":"Karimi B, Fathemi Ghomi SMT and 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":"6","key":"57_CR34","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1287\/mnsc.44.6.859","volume":"44","author":"E Katok","year":"1998","unstructured":"Katok E, Lewis HS and Harrison TP (1998). Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources. Manage Sci 44(6): 859\u2013877","journal-title":"Manage Sci"},{"issue":"2","key":"57_CR35","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1287\/opre.23.2.299","volume":"23","author":"P Kleindorfer","year":"1975","unstructured":"Kleindorfer P and Newson E (1975). A lower bounding structure for lot-size scheduling problems. Oper Res 23(2): 299\u2013311","journal-title":"Oper Res"},{"issue":"2","key":"57_CR36","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0377-2217(94)90072-8","volume":"75","author":"R Kuik","year":"1994","unstructured":"Kuik R, Salomon M and Van Wassenhove LN (1994). Batching decisions: structure and models. Eur J Oper Res 75(2): 243\u2013263","journal-title":"Eur J Oper Res"},{"key":"57_CR37","first-page":"125","volume":"31","author":"M Laguna","year":"1999","unstructured":"Laguna M (1999). A heuristic for production scheduling and inventory control in the presence of sequence-dependent setup-times. IIE Trans 31: 125\u2013134","journal-title":"IIE Trans"},{"issue":"11","key":"57_CR38","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1057\/jors.1988.169","volume":"39","author":"J Maes","year":"1988","unstructured":"Maes J and Van Wassenhove LN (1988). Multi-item single-level capacitated dynamic lot-sizing heuristics: a general review. J Oper Res Soc 39(11): 991\u20131004","journal-title":"J Oper Res Soc"},{"key":"57_CR39","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 JO and Van Wassenhove LN (1991). Multilevel capacitated lotsizing complexity and LP-based heuristics. Eur J Oper Res 53: 131\u2013148","journal-title":"Eur J Oper Res"},{"key":"57_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-89140-2","volume-title":"Simultane Losgr\u00f6\u00dfen- und Reihenfolgeplanung f\u00fcr kontinuierliche Produktionslinien \u2013 Modelle und Methoden im Rahmen des Supply Chain Management","author":"H Meyr","year":"1999","unstructured":"Meyr H (1999). Simultane Losgr\u00f6\u00dfen- und Reihenfolgeplanung f\u00fcr kontinuierliche Produktionslinien \u2013 Modelle und Methoden im Rahmen des Supply Chain Management. Gabler, Wiesbaden"},{"issue":"2","key":"57_CR41","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0377-2217(99)00159-9","volume":"120","author":"H Meyr","year":"2000","unstructured":"Meyr H (2000). Simultaneous lotsizing and scheduling by combining local search with dual reoptimization. Eur J Oper Res 120(2): 311\u2013326","journal-title":"Eur J Oper Res"},{"issue":"2","key":"57_CR42","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0377-2217(01)00373-3","volume":"139","author":"H Meyr","year":"2002","unstructured":"Meyr H (2002). Simultaneous lotsizing and scheduling on parallel machines. Eur J Oper Res 139(2): 277\u2013292","journal-title":"Eur J Oper Res"},{"issue":"4","key":"57_CR43","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/0305-0548(93)90085-W","volume":"20","author":"HH Millar","year":"1993","unstructured":"Millar HH and Yang M (1993). An application of lagrangean decomposition to the capacitated multi-item lot sizing problem. Comput Oper Res 20(4): 409\u2013420","journal-title":"Comput Oper Res"},{"issue":"1","key":"57_CR44","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 and Yang M (1994). Lagrangian heuristics for the capacitated multi-item lot-sizing problem with backordering. Int J Prod Econ 34(1): 1\u201315","journal-title":"Int J Prod Econ"},{"key":"57_CR45","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/S0377-2217(99)00461-0","volume":"125","author":"AJ Miller","year":"2000","unstructured":"Miller AJ, Nemhauser GL and Savelsbergh MWP (2000). On the capacitated lot-sizing and continuous 0\u20131 knapsack polyhedra. Eur J Oper Res 125: 298\u2013315","journal-title":"Eur J Oper Res"},{"key":"57_CR46","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0925-5273(99)00051-1","volume":"64","author":"O Moursli","year":"2000","unstructured":"Moursli O and Pochet Y (2000). A branch-and-bound algorithm for the hybrid flowshop. Int J Prod Econ 64: 113\u2013125","journal-title":"Int J Prod Econ"},{"key":"57_CR47","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1057\/palgrave.jors.2600773","volume":"50","author":"L \u00d6zdamar","year":"1999","unstructured":"\u00d6zdamar L and Barbarosoglu G (1999). Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem. J Oper Res Soc 50: 810\u2013825","journal-title":"J Oper Res Soc"},{"issue":"3","key":"57_CR48","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/S0377-2217(97)00269-5","volume":"110","author":"L \u00d6zdamar","year":"1998","unstructured":"\u00d6zdamar L and Birbil SI (1998). Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions. Eur J Oper Res 110(3): 525\u2013547","journal-title":"Eur J Oper Res"},{"issue":"11","key":"57_CR49","first-page":"1043","volume":"32","author":"L \u00d6zdamar","year":"2000","unstructured":"\u00d6zdamar L and Bozyel MA (2000). The capacitated lot sizing problem with overtime decisions and setup times. IIE Trans 32(11): 1043\u20131057","journal-title":"IIE Trans"},{"key":"57_CR50","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF01580738","volume":"40","author":"Y Pochet","year":"1988","unstructured":"Pochet Y and Wolsey L (1988). Lot size models with back-logging: strong reformulations and cutting planes. Math Program 40: 317\u2013335","journal-title":"Math Program"},{"key":"57_CR51","doi-asserted-by":"crossref","unstructured":"Quadt D (2004) Lot-sizing and scheduling for flexible flow lines. Lecture Notes in Economics and Mathematical Systems, Springer, Berlin","DOI":"10.1007\/978-3-642-17101-7"},{"key":"57_CR52","unstructured":"Quadt D, Kuhn H (2004) Capacitated lot-sizing and scheduling with parallel machines, back-orders and setup carry-over. Working paper, Ingolstadt School of Management, Catholic University of Eichst\u00e4tt-Ingolstadt, Ingolstadt, Germany"},{"issue":"11","key":"57_CR53","doi-asserted-by":"crossref","first-page":"2291","DOI":"10.1080\/00207540500066762","volume":"43","author":"D Quadt","year":"2005","unstructured":"Quadt D and Kuhn H (2005). A conceptual framework for lot-sizing and scheduling of flexible flow lines. Int J Prod Res 43(11): 2291\u20132308","journal-title":"Int J Prod Res"},{"key":"57_CR54","unstructured":"Riane F (1998) Scheduling hybrid flowshops: algorithms and applications. Ph.D. thesis, Facult\u00e9s Universitaires Catholiques de Mons"},{"key":"57_CR55","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0377-2217(90)90154-4","volume":"45","author":"WJ Selen","year":"1990","unstructured":"Selen WJ and Heuts RMJ (1990). Operational production planning in a chemical manufacturing environment. Eur J Oper Res 45: 38\u201346","journal-title":"Eur J Oper Res"},{"key":"57_CR56","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1080\/00207548808947890","volume":"26","author":"VL Smith-Daniels","year":"1988","unstructured":"Smith-Daniels VL and Ritzman LP (1988). A model for lot-sizing and sequencing in process industries. Int J Prod Res 26: 647\u2013674","journal-title":"Int J Prod Res"},{"key":"57_CR57","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1080\/07408178608974705","volume":"18","author":"VL Smith-Daniels","year":"1986","unstructured":"Smith-Daniels VL and Smith-Daniels DE (1986). A mixed integer programming model for lot sizing and sequencing packaging lines in the process industries. IIE Trans 18: 278\u2013285","journal-title":"IIE Trans"},{"key":"57_CR58","first-page":"173","volume":"31","author":"CR Sox","year":"1999","unstructured":"Sox CR and Gao Y (1999). The capacitated lot sizing problem with setup carry-over. IIE Trans 31: 173\u2013181","journal-title":"IIE Trans"},{"issue":"3","key":"57_CR59","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 (1996). Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing. Eur J Oper Res 94(3): 561\u2013581","journal-title":"Eur J Oper Res"},{"key":"57_CR60","unstructured":"S\u00fcrie C (2005) Time continuity in discrete time models. Lecture Notes in Economics and Mathematical Systems, Springer, Berlin"},{"issue":"8","key":"57_CR61","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1287\/mnsc.49.8.1039.16406","volume":"49","author":"C S\u00fcrie","year":"2003","unstructured":"S\u00fcrie C and Stadtler H (2003). The capacitated lot-sizing problem with linked lot-sizes. Manage Sci 49(8): 1039\u20131054","journal-title":"Manage Sci"},{"issue":"5","key":"57_CR62","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1287\/mnsc.42.5.738","volume":"42","author":"H Tempelmeier","year":"1996","unstructured":"Tempelmeier H and Derstroff M (1996). A lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Manage Sci 42(5): 738\u2013757","journal-title":"Manage Sci"},{"key":"57_CR63","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/0377-2217(94)90076-0","volume":"75","author":"H Tempelmeier","year":"1994","unstructured":"Tempelmeier H and Helber S (1994). A heuristic for the dynamic multi-item multi-level capacitated lotsizing for general product structures. Eur J Oper Res 75: 296\u2013311","journal-title":"Eur J Oper Res"},{"issue":"1","key":"57_CR64","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01719725","volume":"17","author":"H Tempelmeier","year":"1995","unstructured":"Tempelmeier H and Helber S (1995). Lot sizing in capacitated production planning and control systems. OR Spectrum 17(1): 5\u201318","journal-title":"OR Spectrum"},{"issue":"4","key":"57_CR65","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1080\/07408178508975308","volume":"17","author":"JM Thizy","year":"1985","unstructured":"Thizy JM and Van Wassenhove LN (1985). Lagrangean relaxation for the multi-item capacitated lot-sizing problem: a heuristic implementation. IIE Trans 17(4): 308\u2013313","journal-title":"IIE Trans"},{"issue":"3","key":"57_CR66","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/mnsc.35.3.353","volume":"35","author":"WW Trigeiro","year":"1989","unstructured":"Trigeiro WW, Thomas LJ and McClain JO (1989). Capacitated lot sizing with setup times. Manage Sci 35(3): 353\u2013366","journal-title":"Manage Sci"},{"key":"57_CR67","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1018967121276","volume":"86","author":"S Voss","year":"1999","unstructured":"Voss S (1999). The steiner tree problem with hop constraints. Ann Oper Res 86: 321\u2013345","journal-title":"Ann Oper Res"},{"issue":"4","key":"57_CR68","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/opre.36.3.445","volume":"36","author":"RJ Wittrock","year":"1988","unstructured":"Wittrock RJ (1988). An adaptable scheduling algorithm for flexible flow lines. Oper Res 36(4): 445\u2013453","journal-title":"Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0057-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-007-0057-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0057-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:55Z","timestamp":1559131975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-007-0057-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,30]]},"references-count":68,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["57"],"URL":"https:\/\/doi.org\/10.1007\/s10288-007-0057-1","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,30]]}}}