{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T12:17:59Z","timestamp":1766492279868,"version":"build-2065373602"},"reference-count":31,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:00:00Z","timestamp":1749772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>In inventory management, storage capacity constraints complicate multi-item lot-sizing decisions. As the number of items increases, deciding how much of each item to order without exceeding capacity becomes more difficult. Dynamic programming works efficiently for a single item, but when capacity constraints are nearly minimal across multiple items, novel heuristics are required. However, previous heuristics have mainly focused on inventory bound constraints. Therefore, this paper introduces push and pull heuristics to solve the multi-item uncapacitated lot-sizing problem under near-minimal capacities. First, a dynamic programming approach based on a network flow model was used to generate the initial replenishment plan for the single-item lot-sizing problem. Next, under storage capacity constraints, the push operation moved the selected replenishment quantities from the current period to subsequent periods to meet all demand requirements. Finally, the pull operation shifted the selected replenishment quantities from the current period into earlier periods, ensuring that all demand requirements were satisfied. The results of the random experiment showed that the proposed heuristic generated solutions whose performance compared well with the optimal solution. This heuristic effectively solves all randomly generated instances representing worst-case conditions, ensuring robust operation under near-minimal storage. For large-scale problems under near-minimal storage capacity constraints, the proposed heuristic achieved only small optimality gaps while requiring less running time. However, small- and medium-scale problems can be solved optimally by a Mixed-Integer Programming (MIP) solver with minimal running time.<\/jats:p>","DOI":"10.3390\/computation13060148","type":"journal-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T09:51:24Z","timestamp":1749808284000},"page":"148","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Effective Heuristics for Solving the Multi-Item Uncapacitated Lot-Sizing Problem Under Near-Minimal Storage Capacities"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9273-7151","authenticated-orcid":false,"given":"Warut","family":"Boonphakdee","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering, Faculty of Engineering at Kamphaeng Saen, Kasetsart University, Nakhon Pathom 73140, Thailand"}]},{"given":"Duangrat","family":"Hirunyasiri","sequence":"additional","affiliation":[{"name":"Department of Textile Science, Faculty of Agro-Industry, Kasetsart University, Bangkok 10900, Thailand"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6224-0232","authenticated-orcid":false,"given":"Peerayuth","family":"Charnsethikul","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, Faculty of Engineering at Kamphaeng Saen, Kasetsart University, Nakhon Pathom 73140, Thailand"}]}],"member":"1968","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1504\/IJMDA.2017.087623","article-title":"A Mixed Integer Linear Programming Model for the Multi-Item Uncapacitated Lot-Sizing Problem: A case study in the trailer manufacturing industry","volume":"1","author":"Mohammadi","year":"2017","journal-title":"Int. J. Multivar. Data Anal."},{"key":"ref_2","unstructured":"Ojeda, A. (2019). Multi-Level Production Planning with Raw-Material Perishability and Inventory Bounds. [Ph.D. Thesis, Concordia University]."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1007\/s10951-019-00606-w","article-title":"Sequencing Assembly Lines to Facilitate Synchronized Just-In-Time Part Supply","volume":"22","author":"Emde","year":"2019","journal-title":"J. Sched."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/j.ijpe.2008.08.034","article-title":"A Comparison of Simple Heuristics for Multi-Product Dynamic Demand Lot-Sizing with Limited Warehouse Capacity","volume":"118","author":"Minner","year":"2009","journal-title":"Int. J. Prod. Econ."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","article-title":"Dynamic Version of the Economic Lot Size Model","volume":"5","author":"Wagner","year":"1958","journal-title":"Manag. Sci."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1287\/mnsc.20.3.313","article-title":"Bounded Production and Inventory Models with Piecewise Concave Costs","volume":"20","author":"Love","year":"1973","journal-title":"Manag. Sci."},{"key":"ref_7","unstructured":"Toczylowski, E. (1995, January 10\u201313). An O (T2) Algorithm for the Lot-Sizing Problem with Limited Inventory Levels. Proceedings of the International Conference on Emerging Technologies and Factory Automation (ETFA), Paris, France. Available online: https:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?tp=&arnumber=496709&tag=1."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/PL00011411","article-title":"The Uncapacited Lot-Sizing Problem with Sales and Safety Stocks","volume":"89","author":"Loparic","year":"2001","journal-title":"Math. Program."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1023\/B:COAP.0000033966.31088.98","article-title":"An O (T log T) Algorithm for the Dynamic Lot Size Problem with Limited Storage and Linear Costs","volume":"28","author":"Gutierrez","year":"2004","journal-title":"Comput. Optim. Appl."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.ijpe.2007.01.010","article-title":"Production Planning with Limited Inventory Capacity and Allow Stockout","volume":"111","author":"Liu","year":"2008","journal-title":"Int. J. Prod. Econ."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.ejor.2012.05.019","article-title":"A Note on the Economic Lot Sizing Problem with Inventory Bounds","volume":"223","author":"Heuvel","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/TSMCA.2007.909492","article-title":"Single-Item Dynamic Lot-Sizing Models with Bounded Inventory and Outsourcing","volume":"38","author":"Chu","year":"2008","journal-title":"IEEE Trans. Syst. Man. Hum."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1002\/nav.21485","article-title":"Improved Algorithms for a Lot-Sizing Problem with Inventory Bounds and Backlogging","volume":"59","author":"Hwang","year":"2012","journal-title":"Nav. Res. Logist."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1080\/0740817X.2012.724187","article-title":"The Economic Lot- Sizing Problem with Lost Sales and Bounded Inventory","volume":"45","author":"Hwang","year":"2013","journal-title":"IIE Trans."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1504\/IJMOR.2022.126051","article-title":"Column Generation Approach for Solving Uncapacitated Dynamic Lot-Sizing Problems with Time-Varying Cost","volume":"23","author":"Boonphakdee","year":"2022","journal-title":"Int. J. Math. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1287\/opre.1050.0223","article-title":"Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation","volume":"53","year":"2005","journal-title":"Oper. Research."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1016\/j.cor.2005.05.029","article-title":"A Polynomial Algorithm for the Production\/Ordering Planning Problem with Limited Storage","volume":"34","author":"Colebrook","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1398","DOI":"10.1016\/j.ejor.2010.07.003","article-title":"Stochastic Lot-Sizing Problem with Inventory-Bounds an Constant Order-Capacities","volume":"207","author":"Guan","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.cie.2012.08.007","article-title":"A Polynomial Algorithm for a Lot-Sizing Problem with Backlogging, Outsourcing, and Limited Inventory, Comput","volume":"64","author":"Chu","year":"2013","journal-title":"Ind. Eng."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1007\/s00291-015-0404-0","article-title":"Models and Lagrangian Heuristics for a Two-Level Lot-Sizing Problem with Bounded Inventory","volume":"37","author":"Brahimi","year":"2015","journal-title":"OR Spectr."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1137\/090751451","article-title":"Lot-Sizing with Stock Upper Bounds and Fixed Charges","volume":"24","author":"Wolsey","year":"2010","journal-title":"SIAM J. Discret. Math."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1080\/07408179008964163","article-title":"Heuristic Procedures for Multi-Item Inventory Planning with Limited Storage","volume":"22","author":"Dixon","year":"1990","journal-title":"IIE Trans."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1080\/00207540412331327718","article-title":"An Integrated Approach for Production and Distribution Planning in Supply Chain Management","volume":"43","author":"Park","year":"2005","journal-title":"Int. J. Prod. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s11590-014-0746-6","article-title":"Multi-Item Uncapacitated Lot Sizing Problem with Inventory Bounds","volume":"9","author":"Akbalik","year":"2015","journal-title":"Optim. Lett."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"2844","DOI":"10.1016\/j.cor.2013.06.007","article-title":"Effective Replenishment Policies for the Multi-Item Dynamic Lot-Sizing Problem with Storage Capacities","volume":"40","author":"Colebrook","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1080\/00207543.2016.1215567","article-title":"Formulations and Heuristics for the Multi-Item Uncapacitated Lot-Sizing Problem with Inventory Bounds","volume":"55","author":"Melo","year":"2015","journal-title":"Int. J. Prod. Res."},{"key":"ref_27","first-page":"249","article-title":"A Heuristic for the Multi-Level Capacitated Lot Sizing Problem with Inventory Constraints. Int. J. Manag","volume":"14","author":"Witt","year":"2019","journal-title":"Sci. Eng. Manag."},{"key":"ref_28","unstructured":"MATLAB (2025, January 18). Heuristic for the Multi-Item Lot-Sizing with Storage Cap. MATLAB Central File Exchange. Available online: https:\/\/www.mathworks.com\/matlabcentral\/fileexchange\/179289-heuristic-for-the-multi-item-lot-sizinng-with-storage-cap."},{"key":"ref_29","unstructured":"MATLAB (2025, January 18). Heurictic of Gutierrez et al. 2013 Algorithm. MATLAB Central File Exchange. Available online: https:\/\/www.mathworks.com\/matlabcentral\/fileexchange\/179294-heurictic-of-gutierrez-et-al-2013-algorithm."},{"key":"ref_30","unstructured":"(2024, December 23). CPLEX Solver. Available online: https:\/\/documentation.aimms.com\/platform\/solvers\/cplex.html."},{"key":"ref_31","unstructured":"MATLAB (2025, May 15). Smoothing Heuristic Multi-Item Lot Size with Storage Cap. MATLAB Central File Exchange. Available online: https:\/\/www.mathworks.com\/matlabcentral\/fileexchange\/181148-smoothing-heuristic-multi-item-lot-size-with-storage-cap."}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/13\/6\/148\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:51:39Z","timestamp":1760032299000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/13\/6\/148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":31,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["computation13060148"],"URL":"https:\/\/doi.org\/10.3390\/computation13060148","relation":{},"ISSN":["2079-3197"],"issn-type":[{"type":"electronic","value":"2079-3197"}],"subject":[],"published":{"date-parts":[[2025,6,13]]}}}