{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:19:42Z","timestamp":1765354782826,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100006831","name":"U.S. Air Force","doi-asserted-by":"publisher","award":["FA9550- 17-1-0105"],"award-info":[{"award-number":["FA9550- 17-1-0105"]}],"id":[{"id":"10.13039\/100006831","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In a single item dynamic lot-sizing problem, we are given a time horizon and demand for a single item in every time period. The problem seeks a solution that determines how much to produce and carry at each time period, so that we will incur the least amount of production and inventory cost. When the remanufacturing option is included, the input comprises of number of returned products at each time period that can be potentially remanufactured to satisfy the demands, where remanufacturing and inventory costs are applicable. For this problem, we first show that it cannot have a fully polynomial time approximation scheme. We then provide a polynomial time algorithm, when we make certain realistic assumptions on the cost structure.\n<\/jats:p>","DOI":"10.1007\/s11590-021-01768-3","type":"journal-article","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T07:02:47Z","timestamp":1624950167000},"page":"421-432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Economic lot-sizing problem with remanufacturing option: complexity and algorithms"],"prefix":"10.1007","volume":"16","author":[{"given":"Ashwin","family":"Arulselvan","sequence":"first","affiliation":[]},{"given":"Kerem","family":"Akartunal\u0131","sequence":"additional","affiliation":[]},{"given":"Wilco","family":"van den Heuvel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,29]]},"reference":[{"issue":"6","key":"1768_CR1","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1007\/s11590-011-0287-1","volume":"6","author":"S Agrali","year":"2012","unstructured":"Agrali, S.: A dynamic uncapacitated lot-sizing problem with co-production. Optim. Lett. 6(6), 1051\u20131061 (2012)","journal-title":"Optim. Lett."},{"key":"1768_CR2","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice hall, Hoboken (1993)"},{"issue":"3","key":"1768_CR3","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10589-012-9465-z","volume":"53","author":"K Akartunal\u0131","year":"2012","unstructured":"Akartunal\u0131, K., Miller, A.: 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."},{"key":"1768_CR4","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.cie.2015.11.024","volume":"92","author":"JO Cunha","year":"2016","unstructured":"Cunha, J.O., Melo, R.A.: A computational comparison of formulations for the economic lot-sizing with remanufacturing. Comput. Ind. Eng. 92, 72\u201381 (2016)","journal-title":"Comput. Ind. Eng."},{"key":"1768_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1287\/mnsc.18.1.12","volume":"18","author":"M Florian","year":"1971","unstructured":"Florian, M., Klein, M.: Deterministic production planning with concave costs and capacity constraints. Manag. Sci. 18, 12\u201320 (1971)","journal-title":"Manag. Sci."},{"issue":"7","key":"1768_CR6","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, J., Rinnooy-Kan, H.: Deterministic production planning: algorithms and complexity. Manag. Sci. 26(7), 669\u2013679 (1980)","journal-title":"Manag. Sci."},{"key":"1768_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"11","key":"1768_CR8","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1080\/07408170108936890","volume":"33","author":"B Golany","year":"2001","unstructured":"Golany, B., Yang, J., Yu, G.: Economic lot-sizing with remanufacturing options. IIE Trans. 33(11), 995\u20131003 (2001)","journal-title":"IIE Trans."},{"key":"1768_CR9","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/moor.26.2.339.10552","volume":"26","author":"CV Hoesel","year":"2001","unstructured":"Hoesel, C.V., Wagelmans, A.: Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems. Math. Oper. Res. 26, 339\u2013357 (2001)","journal-title":"Math. Oper. Res."},{"issue":"12","key":"1768_CR10","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1080\/24725854.2019.1593555","volume":"51","author":"OA Kilic","year":"2019","unstructured":"Kilic, O.A., van den Heuvel, W.: Economic lot sizing with remanufacturing: Structural properties and polynomial-time heuristics. IISE Trans. 51(12), 1318\u20131331 (2019)","journal-title":"IISE Trans."},{"issue":"1","key":"1768_CR11","first-page":"1","volume":"1","author":"M \u00d6nal","year":"2020","unstructured":"\u00d6nal, M., Albey, E.: Economic lot sizing problem with inventory dependent demand. Optim. Lett. 1(1), 1\u201320 (2020)","journal-title":"Optim. Lett."},{"key":"1768_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1080\/0740817X.2013.802842","volume":"46","author":"M Retel-Helmrich","year":"2014","unstructured":"Retel-Helmrich, M., Jans, R., van den Heuvel, W., Wagelmans, A.: Economic lot-sizing with remanufacturing: complexity and efficient formulations. IIE Trans. 46, 67\u201386 (2014)","journal-title":"IIE Trans."},{"key":"1768_CR13","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.ijpe.2018.07.002","volume":"203","author":"SA Syed Ali","year":"2018","unstructured":"Syed Ali, S.A., Doostmohammadi, M., Akartunal\u0131, K., van der Meer, R.: A theoretical and computational analysis of lot-sizing in remanufacturing with separate setups. Int. J. Prod. Econ. 203, 276\u2013285 (2018)","journal-title":"Int. J. Prod. Econ."},{"issue":"20","key":"1768_CR14","doi-asserted-by":"publisher","first-page":"4377","DOI":"10.1080\/00207540600693564","volume":"44","author":"R Teunter","year":"2006","unstructured":"Teunter, R., Bay\u0131nd\u0131r, Z., van den Heuvel, W.: Dynamic lot sizing with product returns and remanufacturing. Int. J. Prod. Res. 44(20), 4377\u20134400 (2006)","journal-title":"Int. J. Prod. Res."},{"key":"1768_CR15","unstructured":"van\u00a0den Heuvel, W.: On the complexity of the economic lot-sizing problem with remanufacturing options. Econometric Institute Research Papers EI 2004-46, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute (2004)"},{"key":"1768_CR16","unstructured":"van\u00a0den Heuvel W.: The economic lot-sizing problem: new results and extensions. PhD thesis, Erasmus Research Institute of Management, Rotterdam. p168 (2006)"},{"key":"1768_CR17","volume-title":"Approximation Algorithms","author":"V Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, New York (2001)"},{"key":"1768_CR18","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"H Wagner","year":"1958","unstructured":"Wagner, H., Whitin, T.: Dynamic version of the economic lot size model. Management Science 5, 89\u201396 (1958)","journal-title":"Management Science"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01768-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01768-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01768-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T13:29:05Z","timestamp":1645018145000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01768-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1768"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01768-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2021,6,29]]},"assertion":[{"value":"5 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}