International Journal of Mathematics Trends and Technology
Volume 3 | Issue 2 | Year 2012 | Article Id. IJMTT-V3I2P504 | DOI : https://doi.org/10.14445/22315373/IJMTT-V3I2P504
Selection of feasible cutting patterns in order to minimize the raw material wastage which is known as cutting stock problem has become a key factor of the success in today’s competitive manufacturing industries. In this paper, solving a two-dimensional cutting stock problem is discussed. Our study is restricted to raw material (main sheet) in a rectangular shape, and cutting items are also considered as rectangular shape with known dimensions. The Branch and Bound approach in solving integer programming problems is used to solve the problem.
[1] Van-Dat Cung, Mhand Hifi, Bertrand Le Cun, “Constrained twodimensional cutting Stock problems, a best-first branch-and-bound
algorithm”, International Transactions In Operational Research, 7
(2000).
[2] Coromoto Leon, Gara Miranda, Casiano Rodriguez, & Carlos Segura, “2D Cutting Stock Problem: A New Parallel Algorithm and Bounds”, (www.springerlink.com/index/906t32v338q7u641.pdf), 25th November 2010.
[3] Saad M.A Suliman, “Pattern generating procedure for the cutting stock problem”, International Journal of Production Economics 74 (2001) 293-301.
[4] Hassan Javanshir, Shaghayegh Rezaei, Saeid Sheikhzadeh Najar and Gangi S.S, “Two Dimensional Cutting Stock Management in Fabric Industries and Optimizing the Large Object’s Length”, IJRRAS, August 2010.
[5] Chen Chen, Chua Kim Huat, “ Optimum Shipyard Steel Plate Cutting Plan Based On Genetic Algorithm”, EPPM, Singapore, 20-21 September.
W. N. P Rodrigo, W. B Daundasekera , A. A. I Perera, "Pattern Generation for Two Dimensional Cutting Stock Problem," International Journal of Mathematics Trends and Technology (IJMTT), vol. 3, no. 2, pp. 54-62, 2012. Crossref, https://doi.org/10.14445/22315373/IJMTT-V3I2P504
PDF 
Abstract 
Keywords 
References 
Citation