A heuristic for the one-dimensional cutting stock problem with pattern reduction

Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture

Volumn 222, Issue 6, 2008, Pages 677-685

  Cui, Y ^a   Zhao, X ^a   Yang, Y ^a   Yu, P ^a  

^a GUANGXI NORMAL UNIVERSITY   (China)

Author keywords

Cutting stock; One dimensional cutting; Pattern reduction

Indexed keywords

BOOLEAN FUNCTIONS; CUTTING; HEURISTIC METHODS; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; OPERATIONS RESEARCH; SEQUENTIAL SWITCHING; SET THEORY;

CUTTING STOCK PROBLEM (CSP); KNAPSACK PROBLEMS; ONE-DIMENSIONAL; TRIM LOSS;

HEURISTIC ALGORITHMS;

EID: 48249121919     PISSN: 09544054     EISSN: None     Source Type: Journal    
DOI: 10.1243/09544054JEM966     Document Type: Article

References (16)

1. Wascher, G., Haussner, H., and Schumann, H. An improved typology of cutting and packing problems. Eur. J. Opl. Res., 2007, 183, 1109-1130.
2. Dyckhoff, H. A typology of cutting and packing problems. Eur. J. Opl. Res., 1990, 44, 145-159.
3. Trkman, P. and Gradisar, M. One-dimensional cutting stock optimization in consecutive time periods. Eur. J. Opl Res., 2007, 179, 291-301.
4. 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. Adv. Engng Software, 2006, 37, 502-513.
5. Gilmore, P. C. and Gomory, R. E. A linear programming approach to the cutting-stock problem. Opl Res., 1961, 9, 849-859.
6. Cui, Y. Generating optimal T-shape cutting patterns for rectangular blanks. Proc. Instn Mech. Engrs, Part B: J. Engineering Manufacture, 2004, 218(B8), 857-866.
7. Yanasse, H. H. and Limeira, M. S. A hybrid heuristic to reduce the number of different patterns in cutting stock problems. Comput. Opl Res., 2006, 33, 2744-2756.
8. Vanderbeck, F. Exact algorithm for minimizing the number of setups in the one-dimensional cutting stock problem. Opl Res., 2000, 48, 915-926.
9. McDiarmid, C. Pattern minimization in cutting stock problems. Discrete Appl. Math., 1999, 98, 121-130.
10. Haessler, R. W. Controlling cutting pattern changes in one-dimensional trim problems. OpI Res., 1975, 23, 483-493.
11. Haessler, R. W. Cutting stock problems and solutions procedures. Eur. J. Opl Res., 1991, 54, 141-150.
12. Farley, A. A. and Richardson, K. V. Fixed charge problems with identical fixed charges. Eur. J. Opl Res., 1984, 18, 245-249.
13. Foerster, H. and Wäscher, G. Pattern reduction in one-dimensional cutting stock problems. Int. J. Prod. Res., 2000, 38, 1657-1676.
14. Umetani, S., Yagiura, M., and Ibaraki, T. One-dimensional cutting stock problem to minimize the number of different patterns. Eur. J. Opl Res., 2003, 146, 388-402.
15. Dikili, A. C., Sariöz, E., and Pek, N. A. A successive elimination method for one-dimensional stock cutting problems in ship production. Ocean Engng, 2007, 34, 1841-1849.
16. Kellerer, H., Pferschy, U., and Pisinger, D. Knapsack problems, 2004, (Springer, Berlin) pp. 190-191.