{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T18:43:09Z","timestamp":1778611389614,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,7,2]],"date-time":"2015-07-02T00:00:00Z","timestamp":1435795200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10732-015-9295-0","type":"journal-article","created":{"date-parts":[[2015,9,23]],"date-time":"2015-09-23T02:36:21Z","timestamp":1442975781000},"page":"687-717","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":88,"title":["A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems"],"prefix":"10.1007","volume":"21","author":[{"given":"Claudio Fabiano Motta","family":"Toledo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M\u00e1rcio","family":"da Silva Arantes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcelo Yukio Bressan","family":"Hossomi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paulo Morelato","family":"Fran\u00e7a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kerem","family":"Akartunal\u0131","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,2]]},"reference":[{"issue":"1","key":"9295_CR1","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/j.cor.2012.06.010","volume":"40","author":"N Absi","year":"2013","unstructured":"Absi, N., Detienne, B., Dauz\u00e8re-P\u00e9r\u00e8s, S.: Heuristics for the multi-item capacitated lot-sizing problem with lost sales. Comput. Oper. Res. 40(1), 264\u2013272 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9295_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.: A heuristic approach for big bucket multi-level production planning problems. Eur. J. Oper. Res. 193(2), 396\u2013411 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9295_CR3","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1007\/s10589-012-9465-z","volume":"53","author":"K Akartunal\u0131","year":"2012","unstructured":"Akartunal\u0131, K., Miller, A.J.: A computational analysis of lower bounds for big bucket production planning problems. Comput. Optim. Appl. 53(3), 729\u2013753 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"9295_CR4","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s10589-009-9235-8","volume":"47","author":"B Almada-Lobo","year":"2010","unstructured":"Almada-Lobo, B., Klabjan, D., Carravilla, M.A., Oliveira, J.F.: Multiple machine continuous setup lotsizing with sequence-dependent setups. Comput. Optim. Appl. 47(3), 529\u2013552 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"9295_CR5","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/j.ejor.2009.01.019","volume":"200","author":"C Almeder","year":"2010","unstructured":"Almeder, C.: A hybrid optimization approach for multi-level capacitated lot-sizing problems. Eur. J. Oper. Res. 200, 599\u2013606 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9295_CR6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.cor.2013.10.001","volume":"43","author":"MF Baki","year":"2014","unstructured":"Baki, M.F., Chaouch, B.A., Abdul-Kader, W.: A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery. Comput. Oper. Res. 43, 225\u2013236 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9295_CR7","first-page":"21","volume":"16","author":"MO Ball","year":"2011","unstructured":"Ball, M.O.: Heuristics based on mathematical programming. Surv. Oper. Res. Manage. Sci. 16(1), 21\u201338 (2011)","journal-title":"Surv. Oper. Res. Manage. Sci."},{"key":"9295_CR8","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BFb0121006","volume":"22","author":"I Barany","year":"1984","unstructured":"Barany, I., van Roy, T.J., Wolsey, L.A.: Uncapacitated lot sizing: the convex hull of solutions. Math. Program Study 22, 32\u201343 (1984)","journal-title":"Math. Program Study"},{"issue":"5","key":"9295_CR9","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.: bc-prod: a specialized branch-and-cut system for lot-sizing problems. Manage. Sci. 46(5), 724\u2013738 (2000)","journal-title":"Manage. Sci."},{"key":"9295_CR10","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1287\/mnsc.32.8.989","volume":"32","author":"PJ Billington","year":"1986","unstructured":"Billington, P.J., McClain, J.O., Thomas, L.J.: Heuristics for multilevel lot-sizing with a bottleneck. Manage. Sci. 32, 989\u20131006 (1986)","journal-title":"Manage. Sci."},{"issue":"5","key":"9295_CR11","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1287\/opre.1070.0404","volume":"55","author":"Z Degraeve","year":"2007","unstructured":"Degraeve, Z., Jans, R.: A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times. Oper. Res. 55(5), 909\u2013920 (2007)","journal-title":"Oper. Res."},{"issue":"6","key":"9295_CR12","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/opre.35.6.832","volume":"35","author":"GD Eppen","year":"1987","unstructured":"Eppen, G.D., Martin, R.K.: Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper. Res. 35(6), 832\u2013848 (1987)","journal-title":"Oper. Res."},{"issue":"3","key":"9295_CR13","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1287\/opre.1070.0392","volume":"55","author":"A Federgruen","year":"2007","unstructured":"Federgruen, A., Meissner, J., Tzur, M.: Progressive interval heuristics for multi-item capacitated lot sizing problem. Oper. Res. 55(3), 490\u2013502 (2007)","journal-title":"Oper. Res."},{"issue":"7","key":"9295_CR14","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1287\/mnsc.26.7.669","volume":"26","author":"M Florian","year":"1980","unstructured":"Florian, M., Lenstra, J.K., Rinnooy Kan, H.G.: Deterministic production planning: algorithms and complexity. Manage. Sci. 26(7), 669\u2013679 (1980)","journal-title":"Manage. Sci."},{"key":"9295_CR15","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.ijpe.2009.08.022","volume":"123","author":"S Helber","year":"2010","unstructured":"Helber, S., Sahling, F.: A fix-and-optimize approach for the multi-level capacitated lot sizing problem. Int. J. Prod. Econ. 123, 247\u2013256 (2010)","journal-title":"Int. J. Prod. Econ."},{"issue":"6","key":"9295_CR16","doi-asserted-by":"crossref","first-page":"2477","DOI":"10.1007\/s10845-011-0514-8","volume":"23","author":"S K\u00e9b\u00e9","year":"2012","unstructured":"K\u00e9b\u00e9, S., Sbihi, N., Penz, B.: A lagrangean heuristic for a two-echelon storage capacitated lot-sizing problem. J. Intell. Manuf. 23(6), 2477\u20132483 (2012)","journal-title":"J. Intell. Manuf."},{"key":"9295_CR17","doi-asserted-by":"crossref","unstructured":"Krarup, J., Bilde, O.: Plant location, set covering and economic lotsizes: an O( $$mn$$ m n ) algorithm for structured problems. Optimierung bel Graphentheoretischen und Ganzzahligen Probleme, pp. 155\u2013180. Birkhauser (1997)","DOI":"10.1007\/978-3-0348-5936-3_10"},{"issue":"1","key":"9295_CR18","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10107-007-0186-5","volume":"118","author":"S K\u00fc\u00e7\u00fckyavuz","year":"2009","unstructured":"K\u00fc\u00e7\u00fckyavuz, S., Pochet, Y.: Uncapacitated lot-sizing with backlogging: The convex hull. Math. Program. 118(1), 151\u2013175 (2009)","journal-title":"Math. Program."},{"issue":"2\u20133","key":"9295_CR19","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10107-002-0325-y","volume":"94","author":"AJ Miller","year":"2003","unstructured":"Miller, A.J., Nemhauser, G.L., Savelsbergh, M.W.P.: On the polyhedral structure of a multi-item production planning model with setup times. Math. Program. 94(2\u20133), 375\u2013405 (2003)","journal-title":"Math. Program."},{"key":"9295_CR20","unstructured":"MIPLIB. A library of pure and mixed integer problems (2010). http:\/\/miplib.zib.de\/ . Accessed on 29 Dec 2014"},{"key":"9295_CR21","unstructured":"Multi-LSB. Multi-item lot-sizing problems with backlogging: a library of test instances (2014). http:\/\/dx.doi.org\/10.15129\/252b7827-b62b-4af4-8869-64b12b1c69a1 . Accessed 29 Dec 2014"},{"key":"9295_CR22","volume-title":"Production Planning by Mixed Integer Programming","author":"Y Pochet","year":"2006","unstructured":"Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer, Berlin (2006)"},{"issue":"7","key":"9295_CR23","doi-asserted-by":"crossref","first-page":"5134","DOI":"10.1016\/j.apm.2012.10.024","volume":"37","author":"R Ramezanian","year":"2013","unstructured":"Ramezanian, R., Saidi-Mehrabad, M.: Hybrid simulated annealing and mip-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system. Appl Math Modell 37(7), 5134\u20135147 (2013)","journal-title":"Appl Math Modell"},{"issue":"1","key":"9295_CR24","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0377-2217(93)90263-M","volume":"71","author":"RL Rardin","year":"1993","unstructured":"Rardin, R.L., Wolsey, L.A.: Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems. Eur. J. Oper. Res. 71(1), 95\u2013109 (1993)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9295_CR25","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.cor.2012.07.002","volume":"40","author":"F Seeanner","year":"2013","unstructured":"Seeanner, F., Almada-Lobo, B., Meyr, H.: Combining the principles of variable neighborhood decomposition search and the fix & optimize heuristic to solve multi-level lot-sizing and scheduling problems. Comput. Oper. Res. 40(1), 303\u2013317 (2013)","journal-title":"Comput. Oper. Res."},{"key":"9295_CR26","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.: Multilevel lot sizing with setup times and multiple constrained resources: internally rolling schedules with lot-sizing windows. Oper. Res. 51, 487\u2013502 (2003)","journal-title":"Oper. Res."},{"issue":"3","key":"9295_CR27","doi-asserted-by":"crossref","first-page":"1352","DOI":"10.1016\/j.asoc.2012.03.074","volume":"13","author":"CFM Toledo","year":"2013","unstructured":"Toledo, C.F.M., da Silva Arantes, M., de Oliveira, R.R.R., Almada-Lobo, B.: Glass container production scheduling through hybrid multi-population based evolutionary algorithm. Appl. Soft Comput. 13(3), 1352\u20131364 (2013)","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"9295_CR28","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1016\/j.cor.2012.11.002","volume":"40","author":"CFM Toledo","year":"2013","unstructured":"Toledo, C.F.M., de Oliveira, R.R.R., Fran\u00e7a, P.M.: A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging. Comput. Oper. Res. 40(4), 910\u2013919 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9295_CR29","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/ijoc.1030.0042","volume":"16","author":"M Vyve Van","year":"2004","unstructured":"Van Vyve, M., Pochet, Y.: A general heuristic for production planning problems. INFORMS J. Comput. 16(3), 316\u2013327 (2004)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"9295_CR30","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., Geunes, J., Akartunal\u0131, K.: An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging. Eur. J. Oper. Res. 214(2), 428\u2013441 (2011)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-015-9295-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-015-9295-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-015-9295-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T18:03:35Z","timestamp":1567188215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-015-9295-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,2]]},"references-count":30,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9295"],"URL":"https:\/\/doi.org\/10.1007\/s10732-015-9295-0","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,2]]}}}