Pattern Generation for Two Dimensional Cutting Stock Problem

  IJMTT-book-cover
 
International Journal of Mathematical Trends and Technology (IJMTT)          
 
© 2012 by IJMTT Journal
Volume-3 Issue-2                           
Year of Publication : 2012
Authors : W. N. P Rodrigo, W. B Daundasekera , A. A. I Perera

MLA

W. N. P Rodrigo, W. B Daundasekera , A. A. I Perera "Pattern Generation for Two Dimensional Cutting Stock Problem"International Journal of Mathematical Trends and Technology (IJMTT),V3(2):54-62.June 2012. Published by Seventh Sense Research Group.

Abstract
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.

References

[1] 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.
[2] Saad M.A Suliman, “Pattern generating procedure for the cutting stock problem”, International Journal of Production Economics 74 (2001) 293-301.
[3] 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.
[4] Chen Chen, Chua Kim Huat, “ Optimum Shipyard Steel Plate Cutting Plan Based On Genetic Algorithm”, EPPM, Singapore, 20-21 September.

Keywords
Two-Dimensional cutting stock problem, Cutting patterns, Branch and Bound algorithm