{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T05:04:48Z","timestamp":1769749488653,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T00:00:00Z","timestamp":1671408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T00:00:00Z","timestamp":1671408000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100018222","name":"Universit\u00e4t Siegen","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100018222","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A problem of optimal mid-term or long-term planning of inspection and repair of freight containers in multiple facilities is introduced and investigated. The containers are of different types and quality levels, which define their repair costs and workforce requirements. The objective function includes the total holding, inspection, repair, transportation and rejection costs. We propose a deterministic, time-dependent, integer linear min-cost multi-commodity network-flow formulation. The problem is shown to be polynomially solvable if there is a single facility, a single time period and all the containers are repairable and have to be repaired. It is shown to be NP-hard for three important special cases. The computational results of our experiments on randomly generated instances based on real data show that instances of sizes 3 facilities, 4 container types and up to 9 container quality levels can be solved with CPLEX in 5 minutes on a conventional PC, even for 30 periods, with an optimality gap of less than 3%. This is sufficient for medium-term or weekly planning or for short-term recovery planning. However, there are instances of the same magnitude, but with 360 periods of a considerably longer planning horizon, for which an optimality gap of 28% remained even after 10 hours of CPLEX computation.<\/jats:p>","DOI":"10.1007\/s00291-022-00699-4","type":"journal-article","created":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T09:03:37Z","timestamp":1671440617000},"page":"181-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Cost minimizing planning of container inspection and repair in multiple facilities"],"prefix":"10.1007","volume":"45","author":[{"given":"Mikhail Y.","family":"Kovalyov","sequence":"first","affiliation":[]},{"given":"Mikhail N.","family":"Lukashevich","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0182-870X","authenticated-orcid":false,"given":"Erwin","family":"Pesch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,19]]},"reference":[{"issue":"2","key":"699_CR1","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/j.ejor.2018.01.052","volume":"269","author":"N Absi","year":"2018","unstructured":"Absi N, Archetti C, Dauz\u00e8re-P\u00e9r\u00e8s S, Feillet D, Speranza MG (2018) Comparing sequential and integrated approaches for the production routing problem. Eur J Oper Res 269(2):633\u2013646","journal-title":"Eur J Oper Res"},{"key":"699_CR2","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows. Theory, algorithms, and applications. Prentice Hall, Upper Saddle River, New Jersey"},{"key":"699_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s11590-014-0746-6","volume":"9","author":"A Akbalik","year":"2015","unstructured":"Akbalik A, Penz B, Rapine C (2015) Multi-item uncapacitated lot sizing problem with inventory bounds. Optim Lett 9:143\u2013154","journal-title":"Optim Lett"},{"issue":"6","key":"699_CR4","doi-asserted-by":"publisher","first-page":"1892","DOI":"10.1080\/00207543.2018.1511925","volume":"57","author":"K Altendorfer","year":"2019","unstructured":"Altendorfer K (2019) Effect of limited capacity on optimal planning parameters for a multi-item production system with setup times and advance demand information. Int J Prod Res 57(6):1892\u20131913","journal-title":"Int J Prod Res"},{"issue":"11","key":"699_CR5","doi-asserted-by":"publisher","first-page":"3437","DOI":"10.1080\/00207543.2019.1668071","volume":"58","author":"FG Beck","year":"2020","unstructured":"Beck FG, Glock CH (2020) The economic lot scheduling problem: a content analysis. Int J Prod Res 58(11):3437\u20133454","journal-title":"Int J Prod Res"},{"key":"699_CR6","doi-asserted-by":"publisher","first-page":"2628","DOI":"10.1111\/poms.13706","volume":"31","author":"P Berling","year":"2022","unstructured":"Berling P, Sonntag DR (2022) Inventory control in production-inventory systems with random yield and rework: The unit-tracking approach. Prod Oper Manag 31:2628\u20132645","journal-title":"Prod Oper Manag"},{"key":"699_CR7","doi-asserted-by":"crossref","unstructured":"Bernat NS, Schulte F, Vo\u00df S, B\u00f6se J (2016) Empty container management at ports considering pollution, repair options, and street-turns. Mathemat Problems Eng article ID 3847163","DOI":"10.1155\/2016\/3847163"},{"key":"699_CR8","doi-asserted-by":"publisher","first-page":"107891","DOI":"10.1016\/j.ress.2021.107891","volume":"215","author":"E Bismut","year":"2021","unstructured":"Bismut E, Straub D (2021) Optimal adaptive inspection and maintenance planning for deteriorating structural systems. Reliabil Eng & Syst Safety 215:107891","journal-title":"Reliabil Eng & Syst Safety"},{"issue":"3","key":"699_CR9","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/j.ejor.2007.02.058","volume":"189","author":"S Chubanov","year":"2008","unstructured":"Chubanov S, Kovalyov MY, Pesch E (2008) A single-item economic lot-sizing problem with a non-uniform resource: approximation. Eur J Oper Res 189(3):877\u2013889","journal-title":"Eur J Oper Res"},{"key":"699_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tre.2015.12.010","volume":"86","author":"BR Cobb","year":"2016","unstructured":"Cobb BR (2016) Inventory control for returnable transport items in a closed-loop supply chain. Transp Res Part E 86:53\u201368","journal-title":"Transp Res Part E"},{"key":"699_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.cor.2018.12.012","volume":"104","author":"JO Cunha","year":"2019","unstructured":"Cunha JO, Kramer HH, Melo RA (2019) Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing. Comput Oper Res 104:149\u2013158","journal-title":"Comput Oper Res"},{"key":"699_CR12","first-page":"3","volume-title":"Reverse logistics-quantitative models for closed-loop supply chains","author":"M de Brito","year":"2004","unstructured":"de Brito M, Dekker R (2004) Reverse logistics: a framework. In: Dekker R, Fleischmann M, Inderfurth K, van Wassenhove LN (eds) Reverse logistics-quantitative models for closed-loop supply chains. Springer International Publishing, Berlin, pp 3\u201327"},{"issue":"1","key":"699_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(97)00230-0","volume":"103","author":"M Fleischmann","year":"1997","unstructured":"Fleischmann M, Bloemhof-Ruwaard JM, Dekker R, van der Laan E, van Nunen JAEE, Van Wassenhove LN (1997) Quantitative models for reverse logistics: a review. European J Operat Res 103(1):1\u201317","journal-title":"European J Operat Res"},{"key":"699_CR14","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Freeman and Co, San Francisco, CA"},{"key":"699_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.endm.2018.01.014","volume":"64","author":"E Grande","year":"2018","unstructured":"Grande E, Nicosia G, Pacifici A, Roselli V (2018) An exact algorithm for a multicommodity min-cost flow over time problem. Electronic Notes Discrete Mathemat 64:125\u2013134","journal-title":"Electronic Notes Discrete Mathemat"},{"key":"699_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.jtrangeo.2016.12.015","volume":"58","author":"T Hjortnaes","year":"2017","unstructured":"Hjortnaes T, Wiegmans B, Negenborn RR, Zuidwijk RA, Klijnhout R (2017) Minimizing cost of empty container repositioning in port hinterlands, while taking repair operations into account. J Transp Geogr 58:209\u2013219","journal-title":"J Transp Geogr"},{"key":"699_CR17","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s40092-018-0286-2","volume":"15","author":"A Hosseini","year":"2019","unstructured":"Hosseini A, Sahlin T (2019) An optimization model for management of empty containers in distribution network of a logistics company under uncertainty. J Indust Eng Int 15:585\u2013602","journal-title":"J Indust Eng Int"},{"key":"699_CR18","doi-asserted-by":"publisher","first-page":"1595","DOI":"10.1016\/j.cor.2004.11.009","volume":"33","author":"K Inderfurth","year":"2006","unstructured":"Inderfurth K, Janiak A, Kovalyov MY, Werner F (2006) Batching work and rework processes with limited deterioration of reworkables. Comput Oper Res 33:1595\u20131605","journal-title":"Comput Oper Res"},{"key":"699_CR19","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ijpe.2004.02.010","volume":"105","author":"K Inderfurth","year":"2007","unstructured":"Inderfurth K, Kovalyov MY, Ng CT, Werner F (2007) Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables. Int J Prod Econ 105:345\u2013356","journal-title":"Int J Prod Econ"},{"key":"699_CR20","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.cor.2018.07.019","volume":"100","author":"Y Kang","year":"2018","unstructured":"Kang Y, Albey E, Uzsoy R (2018) Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior. Comput Oper Res 100:54\u201365","journal-title":"Comput Oper Res"},{"issue":"2","key":"699_CR21","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1287\/opre.27.2.279","volume":"27","author":"EPC Kao","year":"1979","unstructured":"Kao EPC (1979) A multi-product dynamic lot-size model with individual and joint set-up costs. Oper Res 27(2):279\u2013289","journal-title":"Oper Res"},{"issue":"3","key":"699_CR22","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF01581152","volume":"66","author":"AV Karzanov","year":"1994","unstructured":"Karzanov AV (1994) Minimum cost multiflows in undirected networks. Math Program 66(3):313\u2013325","journal-title":"Math Program"},{"key":"699_CR23","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1007\/s11590-019-01519-5","volume":"15","author":"S Khodayifar","year":"2021","unstructured":"Khodayifar S (2021) Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle. Optim Lett 15:1009\u20131026","journal-title":"Optim Lett"},{"issue":"12","key":"699_CR24","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1080\/24725854.2019.1593555","volume":"51","author":"OA Kilic","year":"2019","unstructured":"Kilic OA, van den Heuvel W (2019) Economic lot sizing with remanufacturing: structural properties and polynomial-time heuristics. IISE Transactions 51(12):1318\u20131331","journal-title":"IISE Transactions"},{"key":"699_CR25","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tre.2014.01.011","volume":"64","author":"T Kim","year":"2014","unstructured":"Kim T, Glock CH (2014) On the use of RFID in the management of reusable containers in closed-loop supply chains under stochastic container return quantities. Transp Res Part E 64:12\u201327","journal-title":"Transp Res Part E"},{"issue":"1\u20132","key":"699_CR26","first-page":"36","volume":"20","author":"BS Kim","year":"2013","unstructured":"Kim BS, Lee WS (2013) A multi-product dynamic inbound ordering and shipment scheduling problem at a third-party warehouse. Int J Indust Eng 20(1\u20132):36\u201346","journal-title":"Int J Indust Eng"},{"key":"699_CR27","doi-asserted-by":"crossref","unstructured":"Kovalyov MY, Lukashevich MN, Pesch E (2022) Cost minimizing planning of freight container inspection and repair at multiple facilities (research data), https:\/\/github.com\/MNLukashevich\/ContainerIR","DOI":"10.1007\/s00291-022-00699-4"},{"key":"699_CR28","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.omega.2018.06.004","volume":"85","author":"KA Kuzmicz","year":"2019","unstructured":"Kuzmicz KA, Pesch E (2019) Approaches to empty container repositioning problems in the context of Eurasian intermodal transportation. Omega 85:194\u2013213","journal-title":"Omega"},{"issue":"19","key":"699_CR29","doi-asserted-by":"publisher","first-page":"5348","DOI":"10.1080\/00207543.2011.626459","volume":"50","author":"WZ Li","year":"2012","unstructured":"Li WZ, Tao Y, Wang F (2012) An effective approach to multi-item capacitated dynamic lot-sizing problems. Int J Prod Res 50(19):5348\u20135362","journal-title":"Int J Prod Res"},{"key":"699_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.strusafe.2021.102140","volume":"94","author":"PG Morato","year":"2022","unstructured":"Morato PG, Papakonstantinou KG, Andriotis CP, Nielsen JS, Rigo P (2022) Optimal inspection and maintenance planning for deteriorating structural components through dynamic Bayesian networks and Markov decision processes. Struct Safety 94:102140","journal-title":"Struct Safety"},{"issue":"1","key":"699_CR31","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"HM Wagner","year":"1958","unstructured":"Wagner HM, Whitin TM (1958) Dynamic version of the economic lot size model. Manage Sci 5(1):89\u201396","journal-title":"Manage Sci"},{"issue":"1","key":"699_CR32","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10479-010-0701-6","volume":"187","author":"SF Weele","year":"2010","unstructured":"Weele SF, Ramirez-Marquez JE (2010) Optimization of container inspection strategy via a genetic algorithm. Ann Oper Res 187(1):229\u2013247","journal-title":"Ann Oper Res"},{"key":"699_CR33","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.cor.2018.05.024","volume":"98","author":"T Wu","year":"2018","unstructured":"Wu T, Xiao F, Zhang C, He Y, Liang Z (2018) The green capacitated multi-item lot sizing problem with parallel machines. Comput Oper Res 98:148\u2013164","journal-title":"Comput Oper Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-022-00699-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-022-00699-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-022-00699-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T16:18:15Z","timestamp":1676305095000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-022-00699-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,19]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["699"],"URL":"https:\/\/doi.org\/10.1007\/s00291-022-00699-4","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,19]]},"assertion":[{"value":"16 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}