Abstract
In this study, the cutting problem as one of the main problems within the box-production industries is discussed. The cutting problem refers to the problem of dividing a piece of rectangular raw material, which is usually large, into smaller pieces to produce various products. Cutting problems are NP-hard problems. Numerous researches offering good solutions to these problems have been conducted over the past few years. In the present study, considering the complexity of the problem, a model reflecting the nature of the problem is proposed and a new two-phase solution approach is suggested. Utilizing the proposed method significantly reduces the size of the problem and simplifies the applicability of the solution approach in real life. Furthermore, to evaluate the efficiency and utilization of the proposed method, its application in a specific company is tested. Finally, the performance of the method is calculated and its use is compared with the company’s traditional method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Beasley JE (1985a) Algorithms for unconstrained two-dimensional guillotine cutting. J Oper Res Soc 36(4):297–306. https://doi.org/10.2307/2582416
Beasley JE (1985b) An exact two-dimensional non-guillotine cutting tree search procedure. Oper Res 33(1):49–64. https://doi.org/10.1287/opre.33.1.49
Birgin EG, Lobato RD, Morabito R (2012) Generating unconstrained two-dimensional non-guillotine cutting patterns by a recursive partitioning algorithm. J Oper Res Soc 63(2):183–200. https://doi.org/10.1057/jors.2011.6
Christofides N, Hadjiconstantinou E (1995) An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts. Eur J Oper Res 83(1):21–38. https://doi.org/10.1016/0377-2217(93)E0277-5
Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC (2008) Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. Eur J Oper Res 191(1):61–85. https://doi.org/10.1016/j.ejor.2007.08.007
Gilmore PC, Gomory RE (1965) Multistage cutting stock problems of two and more dimensions. Oper Res 13(1):94–120. https://doi.org/10.1287/opre.13.1.94
Gilmore PC, Gomory RE (1966) The theory and computation of knapsack functions. Oper Res 14(6):1045–1074. https://doi.org/10.2307/168433
Kang M, Yoon K (2011) An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems. Int J Prod Res 49(15):4437–4455. https://doi.org/10.1080/00207543.2010.493535
Lodi A, Martello S, Monaci M (2002) Two-dimensional packing problems: a survey. Eur J Oper Res 141(2):241–252. https://doi.org/10.1016/S0377-2217(02)00123-6
Russo M, Sforza A, Sterle C (2013) An improvement of the knapsack function based algorithm of Gilmore and Gomory for the unconstrained two-dimensional guillotine cutting problem. Int J Prod Econ 145(2):451–462. https://doi.org/10.1016/j.ijpe.2013.04.031
Russo M, Sforza A, Sterle C (2014) An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems. Comput Oper Res 50:97–114. https://doi.org/10.1016/j.cor.2014.04.001
Scheithauer G, Terno J (1996) The G4-heuristic for the pallet loading problem. J Oper Res Soc 47(4):511–522. Retrieved from http://dx.doi.org/10.1057/jors.1996.57
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Mosallaeipour, S., Nazerian, R., Ghadirinejad, M. (2018). A Two-Phase Optimization Approach for Reducing the Size of the Cutting Problem in the Box-Production Industry: A Case Study. In: Calisir, F., Camgoz Akdag, H. (eds) Industrial Engineering in the Industry 4.0 Era. Lecture Notes in Management and Industrial Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-71225-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-71225-3_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-71224-6
Online ISBN: 978-3-319-71225-3
eBook Packages: EngineeringEngineering (R0)