journal article·2025-09-24Open access

A Robust Optimization Approach for the Multi-Period Strip Cutting Problem with Multi-Cutter Slitting Machines

Sungwon Hong, Jongyoon Park, Younsoo Lee

Applied Sciences· Volume 15· Issue 19

Abstract

This paper studies a multi-period strip cutting problem motivated by the paper industry. The focus is on multi-cutter slitting machines, which allow the simultaneous production of items with different lengths and provide higher cutting flexibility compared to conventional single-cutter machines. We propose a pattern-based mixed-integer programming formulation to evaluate the benefits of multi-cutter machines and compare it with heuristic strategies and a single-cutter benchmark. To address demand uncertainty, we extend the model using robust optimization with budgeted uncertainty sets and derive a tractable reformulation. Computational experiments with real-world data show that multi-cutter machines can substantially reduce raw material usage costs compared to the single-cutter setting. Under demand uncertainty, the budgeted robust model provides lower realized costs and smaller variability than both deterministic and box-type robust models.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Optimization and Packing Problems · Metal Forming Simulation Techniques · Assembly Line Balancing Optimization

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Department of Industrial Engineering, Seoul National University, Seoul 08826, Republic of Korea

College of Business Administration, Hongik University, Seoul 04066, Republic of Korea

Department of Industrial and Information Systems Engineering, Soongsil University, Seoul 06978, Republic of Korea

References (33)

Show source-provided references
1. A heuristic for the skiving and cutting stock problem in paper and plastic film industries10.1111/itor.12390 ↗
2. Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation10.1016/j.ejor.2020.03.060 ↗
3. On solving the 1.5-dimensional cutting stock problem with heterogeneous slitting lines allocation in the steel industry10.1016/j.cie.2024.110120 ↗
4. A heuristic algorithm to improving the coil slitting process in the steel industry10.1007/s10732-024-09546-x ↗
5. Khan, R., Pruncu, C.I., Khan, A.S., Naeem, K., Abas, M., Khalid, Q.S., and Aziz, A. (2020). A mathematical model for reduction of trim loss in cutting reels at a make-to-order paper mill. Appl. Sci., 10.10.3390/app10155274 ↗
6. An exact approach to the strip-packing problem10.1287/ijoc.15.3.310.16082 ↗
7. Exact algorithms for the two-dimensional strip packing problem with and without rotations10.1016/j.ejor.2008.08.020 ↗
8. An exact algorithm for the two-dimensional strip-packing problem10.1287/opre.1100.0833 ↗
9. Bin packing and cutting stock problems: Mathematical models and exact algorithms10.1016/j.ejor.2016.04.030 ↗
10. The rectangular two-dimensional strip packing problem real-life practical constraints: A bibliometric overview10.1016/j.cor.2021.105521 ↗
11. An arc flow-based optimization approach for the two-stage guillotine strip cutting problem10.1057/jors.2015.8 ↗
12. Models for the two-dimensional level strip packing problem—A review and a computational evaluation10.1080/01605682.2019.1578914 ↗
13. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation10.1016/j.ejor.2007.08.007 ↗
14. A population heuristic for constrained two-dimensional non-guillotine cutting10.1016/S0377-2217(03)00139-5 ↗
15. A tabu search algorithm for a two-dimensional non-guillotine cutting problem10.1016/j.ejor.2005.11.068 ↗
16. Models and bounds for two-dimensional level packing problems10.1023/B:JOCO.0000038915.62826.79 ↗
17. A two-dimensional strip cutting problem with sequencing constraint10.1016/j.ejor.2005.12.050 ↗
18. Classification and literature review of integrated lot-sizing and cutting stock problems10.1016/j.ejor.2018.01.002 ↗
19. Mathematical model and solution approaches for integrated lot-sizing, scheduling and cutting stock problems10.1007/s10479-020-03764-9 ↗
20. The integrated uncapacitated lot sizing and bin packing problem10.1051/ro/2021049 ↗
21. Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process10.1016/j.ejor.2022.03.012 ↗
22. Robust optimization–methodology and applications10.1007/s101070100286 ↗
23. The price of robustness10.1287/opre.1030.0065 ↗
24. Theory and applications of robust optimization10.1137/080734510 ↗
25. Production planning in furniture settings via robust optimization10.1016/j.cor.2011.02.022 ↗
26. The integrated lot-sizing and cutting stock problem under demand uncertainty10.1080/00207543.2022.2136279 ↗
27. An application of deterministic and robust optimization in the wood cutting industry10.1007/s10288-014-0265-4 ↗
28. Tharmmaphornphilas, W., Puemsin, S., and Siripongwutikorn, P. (2013, January 13–15). A MILP model to select cutting machines and cutting patterns to minimize paper loss. Proceedings of the International MultiConference of Engineers and Computer Scientists, Hong Kong, China.
29. A linear programming approach to the cutting-stock problem10.1287/opre.9.6.849 ↗
30. A linear programming approach to the cutting stock problem—Part II10.1287/opre.11.6.863 ↗
31. Multistage cutting stock problems of two and more dimensions10.1287/opre.13.1.94 ↗
32. Convex programming with set-inclusive constraints and applications to inexact linear programming10.1287/opre.21.5.1154 ↗
33. A robust optimization approach to inventory theory10.1287/opre.1050.0238 ↗