{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T00:37:57Z","timestamp":1776213477142,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T00:00:00Z","timestamp":1322611200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s10479-011-1026-9","type":"journal-article","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T07:49:09Z","timestamp":1322639349000},"page":"635-650","source":"Crossref","is-referenced-by-count":22,"title":["An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times"],"prefix":"10.1007","volume":"196","author":[{"given":"Tao","family":"Wu","sequence":"first","affiliation":[]},{"given":"Leyuan","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,11,30]]},"reference":[{"issue":"2","key":"1026_CR1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1051\/ro:2007014","volume":"41","author":"N. Absi","year":"2007","unstructured":"Absi, N., & Kedad-Sidhoum, S. (2007). MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs. RAIRO. Recherche Op\u00e9rationnelle, 41(2), 171\u2013192.","journal-title":"RAIRO. Recherche Op\u00e9rationnelle"},{"issue":"2","key":"1026_CR2","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, A. J. (2009). A heuristic approach for big bucket multi-level production planning problems. European Journal of Operational Research, 193(2), 396\u2013411.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"1026_CR3","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1080\/00207540802446787","volume":"48","author":"B. Almada-Lobo","year":"2010","unstructured":"Almada-Lobo, B., & James, R. J. W. (2010). Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups. International Journal of Production Research, 48(3), 861\u2013878.","journal-title":"International Journal of Production Research"},{"issue":"10","key":"1026_CR4","first-page":"22","volume":"43","author":"I. Barany","year":"1984","unstructured":"Barany, I., Van Roy, T. J., & Wolsey, L. A. (1984). Uncapacitated lot sizing: The convex hull of solutions. Mathematical Programming Studies, 43(10), 22\u201332.","journal-title":"Mathematical Programming Studies"},{"issue":"5","key":"1026_CR5","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, L. A. (2000). Bc-prod: A specialized branch-and-cut system for lot-sizing problems. Management Science, 46(5), 724\u2013738.","journal-title":"Management Science"},{"issue":"10","key":"1026_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. Management Science, 29(10), 1126\u20131141.","journal-title":"Management Science"},{"issue":"4","key":"1026_CR7","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.cie.2003.09.006","volume":"45","author":"Y. F. Hung","year":"2003","unstructured":"Hung, Y. F., Chen, C. P., Shih, C. C., & Hung, M. H. (2003). Using tabu search with ranking candidate list to solve production planning problems with setups. Computers & Industrial Engineering, 45(4), 615\u2013634.","journal-title":"Computers & Industrial Engineering"},{"key":"1026_CR8","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 (pp.\u00a0155\u2013180). Basel: Birkh\u00e4user."},{"key":"1026_CR9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0377-2217(90)90153-3","volume":"45","author":"R. Kuik","year":"1990","unstructured":"Kuik, R., & Salomon, M. (1990). Multi-level lot-sizing problem: Evaluation of a simulated annealing heuristic. European Journal of Operational Research, 45, 25\u201337.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1026_CR10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0925-5273(03)00090-2","volume":"85","author":"C. Merc\u00e9","year":"2003","unstructured":"Merc\u00e9, C., & Fontan, G. (2003). Mip-based heuristics for capacitated lotsizing problems. International Journal of Production Economics, 85(1), 97\u2013111.","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"1026_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0925-5273(94)90042-6","volume":"34","author":"H. H. Millar","year":"1994","unstructured":"Millar, H. H., & Yang, M. Z. (1994). Lagrangian heuristics for the capacitated multiitem lot-sizing problem with backordering. International Journal of Production Economics, 34(1), 1\u201315.","journal-title":"International Journal of Production Economics"},{"issue":"11","key":"1026_CR12","first-page":"1043","volume":"32","author":"L. Ozdamar","year":"2000","unstructured":"Ozdamar, L., & Bozyel, M. A. (2000). The capacitated lot sizing problem with overtime decisions and setup times. IIE Transactions, 32(11), 1043\u20131057.","journal-title":"IIE Transactions"},{"issue":"9","key":"1026_CR13","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. Computers & Operations Research, 36(9), 2546\u20132553.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"1026_CR14","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. Operations Research, 51(3), 487\u2013502.","journal-title":"Operations Research"},{"issue":"8","key":"1026_CR15","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. Management Science, 49(8), 1039\u20131054.","journal-title":"Management Science"},{"issue":"2","key":"1026_CR16","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":"1026_CR17","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. Management Science, 42(5), 738\u2013757.","journal-title":"Management Science"},{"issue":"20","key":"1026_CR18","doi-asserted-by":"crossref","first-page":"6227","DOI":"10.1080\/00207543.2010.535043","volume":"49","author":"T. Wu","year":"2011","unstructured":"Wu, T., & Shi, L. (2011). Mathematical models for capacitated multi-level production planning problems with linked lot sizes. International Journal of Production Research, 49(20), 6227\u20136247.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"1026_CR19","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., Akartunal\u0131, K., & Geunes, J. (2011). An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging. European Journal of Operational Research, 214(2), 428\u2013441.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"1026_CR20","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/TASE.2009.2039134","volume":"7","author":"T. Wu","year":"2010","unstructured":"Wu, T., Shi, L., & Duffie, N. A. (2010). An HNP-MP approach for the capacitated multi-item lot sizing problem with setup times. IEEE Transactions on Automation Science and Engineering, 7(3), 500\u2013511.","journal-title":"IEEE Transactions on Automation Science and Engineering"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-1026-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-1026-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-1026-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:08:10Z","timestamp":1559138890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-1026-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,30]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1026"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-1026-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,30]]}}}