{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:11:57Z","timestamp":1764936717467},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,4,27]],"date-time":"2014-04-27T00:00:00Z","timestamp":1398556800000},"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":["Optim Lett"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s11590-014-0746-6","type":"journal-article","created":{"date-parts":[[2014,4,26]],"date-time":"2014-04-26T07:30:21Z","timestamp":1398497421000},"page":"143-154","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Multi-item uncapacitated lot sizing problem with inventory bounds"],"prefix":"10.1007","volume":"9","author":[{"given":"Ayse","family":"Akbalik","sequence":"first","affiliation":[]},{"given":"Bernard","family":"Penz","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Rapine","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,27]]},"reference":[{"key":"746_CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1111\/j.1475-3995.2008.00627.x","volume":"15","author":"A Akbalik","year":"2008","unstructured":"Akbalik, A., Kebe, S., Penz, B., Sbihi, N.: Exact methods and a heuristic for the optimization of an integrated replenishment-storage planning problem. Int. Trans. Oper. Res 15, 195\u2013214 (2008)","journal-title":"Int. Trans. Oper. Res"},{"key":"746_CR2","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1287\/opre.1050.0223","volume":"53","author":"A Atamturk","year":"2005","unstructured":"Atamturk, A., Kucukyavuz, S.: Lot sizing with inventory bounds and fixed costs: polyhedral study and computation. Oper. Res. 53, 711\u2013730 (2005)","journal-title":"Oper. Res."},{"key":"746_CR3","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.orl.2007.08.004","volume":"36","author":"A Atamturk","year":"2008","unstructured":"Atamturk, A., Kucukyavuz, S.: An $$O(n^2)$$ O ( n 2 ) algorithm for lot sizing with inventory bounds and fixed costs. Oper. Res. Lett. 36, 297\u2013299 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"10","key":"746_CR4","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1287\/mnsc.28.10.1174","volume":"28","author":"GR Bitran","year":"1982","unstructured":"Bitran, G.R., Yanasse, H.H.: Computational complexity of the capacitated lot size problem. Manage. Sci. 28(10), 1174\u20131186 (1982)","journal-title":"Manage. Sci."},{"key":"746_CR5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02248584","volume":"26","author":"WH Chen","year":"1990","unstructured":"Chen, W.H., Thizy, J.M.: Analysis of relaxations for the multi-item capacitated lotsizing problem. Ann. Oper. Res. 26, 29\u201372 (1990)","journal-title":"Ann. Oper. Res."},{"key":"746_CR6","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.cie.2012.08.007","volume":"64","author":"C Chu","year":"2013","unstructured":"Chu, C., Chu, F., Zhong, J., Yang, S.: A polynomial algorithm for a lot-sizing problem with backlogging, outsourcing and limited inventory. Comput. Ind. Eng. 64, 200\u2013210 (2013)","journal-title":"Comput. Ind. Eng."},{"key":"746_CR7","volume-title":"Computers and Intractability : A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability : A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"746_CR8","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0305-0548(01)00105-8","volume":"30","author":"J Guti\u00e9rrez","year":"2002","unstructured":"Guti\u00e9rrez, J., Sedeno-Noda, A., Colebrook, M., Sicilia, J.: A new characterization for the dynamic lot size problem with bounded inventory. Comput. Oper. Res. 30, 383\u2013395 (2002)","journal-title":"Comput. Oper. Res."},{"key":"746_CR9","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1016\/j.cor.2005.05.029","volume":"34","author":"J Guti\u00e9rrez","year":"2007","unstructured":"Guti\u00e9rrez, J., Sedeno-Noda, A., Colebrook, M., Sicilia, J.: A polynomial algorithm for the production\/ordering planning problem with limited storage. Comput. Oper. Res. 34, 934\u2013937 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"3\u20134","key":"746_CR10","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1002\/nav.21485","volume":"59","author":"H-C Hwang","year":"2012","unstructured":"Hwang, H.-C., van den Heuvel, W.: Improved algorithms for a lot-sizing problem with inventory bounds and backlogging. Naval Res. Logistics 59(3\u20134), 244\u2013253 (2012)","journal-title":"Naval Res. Logistics"},{"issue":"2","key":"746_CR11","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1287\/moor.1070.0305","volume":"33","author":"R Levi","year":"2008","unstructured":"Levi, R., Lodi, A., Sviridenko, M.: Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities. Math. Oper. Res. 33(2), 461\u2013474 (2008)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"746_CR12","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1287\/mnsc.20.3.313","volume":"20","author":"SF Love","year":"1973","unstructured":"Love, S.F.: Bounded production and inventory models with piecewise concave costs. Manage. Sci. 20(3), 313\u2013318 (1973)","journal-title":"Manage. Sci."},{"key":"746_CR13","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/j.ijpe.2008.08.034","volume":"118","author":"S Minner","year":"2009","unstructured":"Minner, S.: A comparison of simple heuristics for multi-product dynamic demand lot-sizing with limited warehouse capacity. Int. J. Prod. Econ. 118, 305\u2013310 (2009)","journal-title":"Int. J. Prod. Econ."},{"key":"746_CR14","unstructured":"Onal, M., van den Heuvel, W., Liu, T.: Economic lot sizing problem with inventory bounds. Technical Report EI 2011\u201340, Econometric Institute Report"},{"key":"746_CR15","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, New York (2006)"},{"key":"746_CR16","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1023\/B:COAP.0000033966.31088.98","volume":"28","author":"A Sedeno-Noda","year":"2004","unstructured":"Sedeno-Noda, A., Guti\u00e9rrez, J., Abdul-Jalbar, B., Sicilia, J.: An $$O(T log(T))$$ O ( T l o g ( T ) ) algorithm for the dynamic lot size problem with limited storage and linear costs. Comput. Optim. Appl. 28, 311\u2013323 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"746_CR17","first-page":"78","volume":"3","author":"E Toczylowski","year":"1995","unstructured":"Toczylowski, E.: An $$O(T^2)$$ O ( T 2 ) algorithm for the lot-sizing problem with limited inventory levels. IEEE Symp. Emerg. Technol. Factory Autom. 3, 78\u201385 (1995)","journal-title":"IEEE Symp. Emerg. Technol. Factory Autom."},{"key":"746_CR18","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.ejor.2011.04.002","volume":"213","author":"W Heuvel van den","year":"2011","unstructured":"van den Heuvel, W., Gutierrez, J.M., Hwang, H.-C.: An efficient approach for solving the lot-sizing problem with time-varying storage capacities. Eur. J. Oper. Res. 213, 455\u2013457 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"746_CR19","doi-asserted-by":"crossref","first-page":"S145","DOI":"10.1287\/opre.40.1.S145","volume":"40","author":"A Wagelmans","year":"1992","unstructured":"Wagelmans, A., van Hoesel, S., Kolen, A.: Economic lot sizing: An $$O(n log n)$$ O ( n l o g n ) algorithm that runs in linear time in the Wagner-Whitin case. Oper. Res. 40(1), S145\u2013156 (1992)","journal-title":"Oper. Res."},{"key":"746_CR20","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10107-005-0675-3","volume":"107","author":"LA Wolsey","year":"2006","unstructured":"Wolsey, L.A.: Lot-sizing with production and delivery time windows. Math. Program. Ser. A 107, 471\u2013489 (2006)","journal-title":"Math. Program. Ser. A"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0746-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0746-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0746-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:38Z","timestamp":1559409098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0746-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,27]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["746"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0746-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,27]]}}}