A Mixed-integer Linear Programming Model for Solving Multi-item Uncapacitated Lot-sizing Problems with Storage Capacities Limitations: A Case Study of an Apparel Manufacturing Company
DOI:
https://doi.org/10.55003/ETH.410102Keywords:
Multi-item lot size, Storage capacity limitations, Apparel manufacturing company, Mixed-integer linear programmingAbstract
This study aimed to use a mixed-integer linear programming model to solve the multi-item uncapacitated lot size problem with storage capacity limitations for apparel manufacturing. In real-world operations, sometimes the storage capacity of cloth rolls can be insufficient at any given time. This would be because the sum of the remaining cloth rolls from the previous period and the receiving cloth rolls from the existing period would be a vast number. Furthermore, the extra cloth on the rolls would have to be carried and kept in the production line. Consequently, this caused the late issue of the distribution of the material, the loss of the cloth rolls, and the failure to count the cloth rolls. As a result, we conducted a multi-item cloth roll replenishment plan to meet the production line's demand and keep all the inventory and receiving cloth rolls. Using mixed-integer linear programming, the multi-item lot size of each period and the sum of the cloth, ordering, and holding costs was calculated, including the number of occupied cloth racks that did not exceed the number of available cloth racks in the cloth storage. Then, this result was compared with the calculation of a mixed-integer linear programming model based on the procurement policies of a case study company. This study used OpenSolver and GAMS/CPLEX software to calculate the solutions. The results found that in using the procurement policy, we could provide the maximum number of occupied cloth racks, about 368 racks, or 2.78 times the racks on the available shelves of the cloth storage. The result of the proposed model indicated that the number of occupied cloth racks to be installed did not exceed the number of available racks on the shelves. The total cost of the model of the procurement policy was less than the proposed model by about 0.26 percent because ordering occurred only about 25 times.
References
H. M. Wagner and T. M. Whitin, “Dynamic Version of the Economic Lot Size Model,” Management Science, vol. 5, no. 1, pp. 89–96, 1958, doi: 10.1287/mnsc.5.1.89.
S. F. Love, “Bounded Production and Inventory Models with Piecewise Concave Costs,” Management Science, vol. 20, no. 3, pp. 313–318, 1973, doi: 10.1287/mnsc.20.3.313.
Y. Pochet and L.A. Wolsey, “Lot-sizing with Constant Batches: Formulation and Valid Inequalities,” Mathematics of Operations Research, vol. 18, no. 4, pp.767–785, 1993, doi: 10.1287/moor.18.4.767.
E. Toczylowski, “An O(T/sup 2/) algorithm for the lot-sizing problem with limited inventory levels,” in Proc. 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation (ETFA'95), Paris, France, Oct. 10–13, 1995, pp. 78–85, doi: 10.1109/ETFA.1995.496709.
M. Loparic, Y. Pochet and L.A. Wolsey, “The Uncapacitated Lot-sizing Problem with Sales and Safety stocks,” Mathematical Programming, vol. 89, pp. 487–504, 2001, doi: 10.1007/PL00011411.
M. V. Vyve and F. Ortega, “Lot-sizing with Fixed Charges on Stocks: the Convex Hull,” Discrete Optimization, vol. 1, no. 2, pp. 189–203, 2004, doi: 10.1016/j.disopt.2004.07.001.
N. Absi and S. Kedad-Sidhoum, “The Multi-Item Capacitated Lot-Sizing Problem With Safety Stocks and Demand Shortage Costs,” Computer & Operations Research, vol. 36, no. 11, pp. 2926–2936, 2009, doi: 10.1016/j.cor.2009.01.007.
J. Krarup and O. Bilde, “Plant location, set covering and economic lot sizes: An O(mn)-algorithm for structured problems,” in Numerische Methoden bei Optimierungsaufgaben Band 3, L. Collatz, G. Meinardus and W. Wetterling eds., Basel, Switzerland: Springer Basel AG, 1997, ch. 10, pp. 155–180, 1977.
H. -C. Hwang and W. V. D. Heuvel, “Improved Algorithms for a Lot-sizing Problem with Inventory Bounds and Backlogging,” Naval Research Logistics, vol. 59, no. 3–4, pp. 244–253, 2012, doi: 10.1002/nav.21485.
J. Gutierrez, M. Colebrook, B. Abdul-Jalbar and J. Sicilia, “Effective Replenishment Policies for the Multi-item Dynamic Lot-sizing Problem with Storage capacities,” Computers & Operational Research, vol. 40, no. 12, pp. 2844–2851, 2013, doi: 10.1016/j.cor.2013.06.007.
A. Akbalik, B. Penz and C. Rapine, “Multi-item uncapacitated lot sizing problem with inventory bounds,” Optimization Letters, vol. 9, pp. 143–154, 2015, doi: 10.1007/s11590-014-0746-6.
R. A. Melo and C. C. Riberio, “Formulations and heuristics for the multi-item uncapacitated lot-sizing problem with inventory bounds,” International Journal of Production Research, vol. 55, no. 2, pp. 576–592, 2016, doi: 10.1080/00207543.2016.1215567.
K. Phabu1, V. Punyangarm and N. Chumrit. “Dynamic lot sizing model: a case study of inventory for paddy in rice mill,” in IE Network Conference 2012, Phetchaburi, Thailand, Oct. 17–19, 2012, pp. 1899–1904
N. Chaimongkol, S. Supapa and P. Yanpirat, “Application of integer programming for aggregate production planning in the production and purchase of vaccines,” Thai Journal of Operations Research, vol. 10, no. 2, pp. 35–43, 2022.
S. Poolbun and W. Wongmanee, “Imported raw material procurement (tin free steel in coil) relates to storage capacity and production planning: A case study AAA company” in 5th National Conference (Graduate School Conference 2023), Bangkok, Thailand, Apr. 3, 2023, pp. 220–226.
W. Boonphakdee and P. Charnsethikul, “Column Generation Approach for Solving Uncapacitated Dynamic Lot-sizing Problems with Time-varying Cost,” International Journal of Mathematics in Operational Research, vol. 23, no. 1, pp. 55–75, 2022, doi: 10.1504/IJMOR.2022.126051.
J. -C. Lange, “Design and Management of Networks with Fixed Transportation Costs for the Reverse Flows of Reusable Package,” Ph.D. dissertation, Dept. Sci. Econ., Univ. Catholique de Louvain, Belgium, 2010.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 School of Engineering, King Mongkut’s Institute of Technology Ladkrabang
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
The published articles are copyrighted by the School of Engineering, King Mongkut's Institute of Technology Ladkrabang.
The statements contained in each article in this academic journal are the personal opinions of each author and are not related to King Mongkut's Institute of Technology Ladkrabang and other faculty members in the institute.
Responsibility for all elements of each article belongs to each author; If there are any mistakes, each author is solely responsible for his own articles.
