Strips minimization in two-dimensional cutting stock of circular items

Computers and Operations Research

Volumn 37, Issue 4, 2010, Pages 621-629

  Cui, Yaodong ^a   Xu, Dao yun ^b  

^a GUANGXI UNIVERSITY   (China)

^b GUIZHOU UNIVERSITY   (China)

Author keywords

Cutting stock; Stamping strips; Strips minimization; Two dimensional cutting

Indexed keywords

COLUMN GENERATION; COMPUTATIONAL RESULTS; CUTTING PATTERNS; CUTTING STOCK; INTEGER LINEAR PROGRAMMING; STAMPING PROCESS; STRIPS MINIMIZATION; TWO STAGE; TWO-DIMENSIONAL CUTTING;

INTEGER PROGRAMMING; LINEARIZATION; OPTIMIZATION; STAMPING; TWO DIMENSIONAL;

CUTTING;

EID: 70350566563     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.06.005     Document Type: Article

References (23)

1. Wascher G., Haussner H., and Schumann H. An improved typology of cutting and packing problems. European Journal of Operational Research 183 (2007) 1109-1130
2. Alves C., and Carvalho J.M.V. A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Computers & Operations Research 34 (2008) 1315-1328
3. Hayek J.E., Moukrim A., and Negre S. New resolution algorithm and pretreatments for the two-dimensional bin-packing problem. Computers & Operations Research 35 (2008) 3184-3201
4. Cintra G.F., Miyazawa F.K., Wakabayashi Y., and Xavier E.C. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research 191 (2008) 61-85
5. Demir M.C. A pattern generation-integer programming based formulation for the carpet loading problem. Computers & Industrial Engineering 54 (2008) 110-117
6. Rinaldi F., and Franz A. A two-dimensional strip cutting problem with sequencing constraint. European Journal of Operational Research 183 (2007) 1371-1384
7. Vanderbeck F. Exact algorithm for minimizing the number of setups in the one-dimensional cutting stock problem. Operations Research 48 (2000) 915-926
8. McDiarmid C. Pattern minimization in cutting stock problems. Discrete Applied Mathematics 98 (1999) 121-130
9. Haessler R.W. Controlling cutting pattern changes in one-dimensional trim problems. Operations Research 23 (1975) 483-493
10. Haessler R.W. Cutting stock problems and solutions procedures. European Journal of Operational Research 54 (1991) 141-150
11. Foerster H., and Wäscher G. Pattern reduction in one-dimensional cutting stock problems. International Journal of Production Research 38 (2000) 1657-1676
12. Yanasse H.H., and Limeira M.S. A hybrid heuristic to reduce the number of different patterns in cutting stock problems. Computers & Operations Research 33 (2006) 2744-2756
13. Dikili A.C., Sariöz E., and Pek N.A. A successive elimination method for one-dimensional stock cutting problems in ship production. Ocean Engineering 34 (2007) 1841-1849
14. Faggioli E., and Bentivoglio C.A. Heuristic and exact methods for the cutting sequencing problem. European Journal of Operational Research 110 (1998) 564-575
15. Becceneri J.C., Yanasse H.H., and Soma N.Y. A method for solving the minimization of the maximum number of open stacks problem within a cutting process. Computers & Operations Research 31 (2004) 2315-2332
16. Yanasse H.H., and Lamosa M.J.P. An integrated cutting stock and sequencing problem. European Journal of Operational Research 183 (2007) 1353-1370
17. Belov G., and Scheithauer G. Setup and open-stacks minimization in one-dimensional stock cutting. INFORMS Journal on Computing 19 (2007) 27-35
18. Yang C.T., Sung T.C., and Weng W.C. An improved tabu search approach with mixed objective function for one-dimensional cutting stock problems. Advances in Engineering Software 37 (2006) 502-513
19. Gradisar M., Resinovic C., and Kljajic M. A hybrid approach for optimization of one-dimensional cutting. European Journal of Operational Research 119 (1999) 719-728
20. Cui Y. Generating optimal T-shape cutting patterns for circular blanks. Computers & Operations Research 32 (2005) 143-152
21. Cui Y. Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors. European Journal of Operational Research 169 (2006) 30-40
22. Cui Y. Generating optimal T-shape cutting patterns for rectangular blanks. Proceedings of the Institution of Mechanical Engineers Part B: Journal of Engineering Manufacture 218 (2004) 857-866
23. Kellerer H., Pferschy U., and Pisinger D. Knapsack Problems (2004), Springer, Berlin