A MACHINE SPEED OPTIMIZATION PROBLEM IN A CAPACITATED FELT PRODUCTION SYSTEM
Öz
In this study, we analyze a felt production system with unique requirements, such as maintaining machine speeds within specific limits to facilitate successful chemical reactions. By incorporating machine speed constraints and restrictions on both work-in-process (WIP) and end-product inventories, we aim to determine the optimal production quantities for each felt type and the corresponding machine speeds over a defined planning horizon. The objective is to minimize total costs, including machine setup and production costs as well as WIP and end-product inventory holding costs. To achieve this, we introduce the Machine Speed Optimization (MSO) problem and adapt it to the specific requirements of a felt manufacturing company operating in Istanbul, Türkiye. The MSO problem is formulated as a mixed-integer linear programming (MILP) model, which is NP-hard to solve for optimal production decisions. We validate the MSO model using the felt manufacturing company's case over five periods, demonstrating its effectiveness in automating production planning and machine speed decisions. The simulations for a 5-day planning horizon demonstrate a cost reduction of 3853 TL, a 24% decrease in WIP inventory, and up to a 15% improvement in machine utilization compared to the current practices of the felt manufacturing company. Additionally, the optimized machine speeds achieved through the MSO model enable the system to increase throughput by 11%. Experimental analysis of computational complexity reveals that the MSO model can generate an optimal 6-month production plan, including machine speeds, in under one hour.
Anahtar Kelimeler
Felt Production, Lot Sizing, Machine Speed, Mixed-Integer Programming
Kaynakça
- Akbalik, A., Penz, B., & Rapine, C. (2015). Capacitated lot sizing problems with inventory bounds. Annals of Operations Research, 229, 1–18. doi: https://doi.org/10.1007/s10479-015-1816-6
- Absi, N., Detienne B., & Dauzere-Peres, S. (2013). Heuristics for the multi-item capacitated lot-sizing problem with lost sales. Computers & Operations Research, 40(1), 264–272. doi: https://doi.org/10.1016/j.cor.2012.06.010
- Ben Ammar, H., Ayadi O., & Masmoudi, F. (2020). An effective multi-objective particle swarm optimization for the multi-item capacitated lot-sizing problem with set-up times and backlogging. Engineering Optimization, 52(7), 1198-1224. doi: https://doi.org/10.1080/0305215X.2019.1636978
- Brahimi, N., Dauzere-Peres, S., & Najid, N.M. (2005). Capacitated multi-item lot-sizing problems with time windows. Operations Research, 54, 951–967. doi: https://doi.org/10.1287/opre.1060.0325
- Chung-Yee, L., Çetinkaya, S., & Wagelmans, A.P.M. (2000). A dynamic lot-sizing model with demand time windows. Management Science, 47(10), 1384-1395. doi: https://doi.org/10.1287/mnsc.47.10.1384
- Florian, M., Lenstra, J.K., & Kan, A.H.G.R. (1980). Deterministic production planning: Algorithms and complexity. Management Science, 26(7), 669–679. doi: https://doi.org/10.1287/mnsc.26.7.669
- Ganesh, K. (2019). Capacitated lot sizing problems in process industries. Cham, Switzerland: Springer. doi: https://doi.org/10.1007/978-3-030-01222-9
- Geng, Z., & Yuan, J. (2023). Single-machine scheduling of multiple projects with controllable processing times. European Journal of Operational Research, 308(3), 1074-1090. doi: https://doi.org/10.1016/j.ejor.2023.01.026
- Gramani, M., França, P., & Arenales, M. (2009). A lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem. International Journal of Production Economics, 119(2), 219–227. doi: https://doi.org/10.1016/j.ijpe.2009.02.011
- Jans, R., & Degraeve, Z. (2008). Modeling industrial lot sizing problems: A review. International Journal of Production Research, 46, 1619–1643. doi: https://doi.org/10.1080/00207540600902262