Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths

Computers and Operations Research

Volumn 36, Issue 6, 2009, Pages 2074-2081

  Poldi, Kelly Cristina ^a   Arenales, Marcos Nereu ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Column generation; Cutting stock; Heuristics

Indexed keywords

CUTTING; FUNCTIONS; INTEGER PROGRAMMING; OPERATIONS RESEARCH; PROBABILITY DENSITY FUNCTION; SOLUTIONS;

COLUMN GENERATION; CUTTING STOCK; CUTTING STOCK PROBLEMS; HEURISTICS; INTEGER SOLUTIONS; OBJECTIVE FUNCTION VALUES; OBJECTIVE FUNCTIONS; OPTIMAL SOLUTIONS;

HEURISTIC METHODS;

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

References (22)

1. Brown A.R. Optimim packing and depletion: the computer in space and resource usage problem (1971), Macdonald-London and American Elsevier Inc., New York
2. Dyckhoff H., Kruse H.J., Abel D., and Gal T. Trim loss and related problems. The International Journal of Management Science 13 (1985) 59-72
3. Dyckhoff H., and Finke U. Cutting and packing in production and distribution: typology and bibliography (1992), Springer, Heidelberg
4. Hinxman A. The trim-loss and assortment problems: a survey. European Journal of Operational Research 5 (1980) 8-18
5. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting stock problem-Part II. Operations Research 11 (1963) 863-888
6. Stadtler H. A one-dimensional cutting stock problem in the Aluminium Industry and its solution. European Journal of Operational Research 44 (1990) 209-223
7. Wäscher G., Haussner H., and Schumann H. An improved typology of cutting and packing problems. European Journal of Operational Research 183 (2007) 1109-1130
8. Wäscher G., and Gau T. Heuristics for the integer one-dimensional cutting stock problem: a computational study. OR Spektrum 18 (1996) 131-144
9. Scheithauer G., and Terno J. The modified integer round-up property of the one-dimensional cutting stock problem. European Journal of Operational Research 84 (1995) 562-571
10. Haessler R.W., and Sweeney P.E. Cutting stock problems and solution procedures. European Journal of Operational Research 54 (1991) 141-150
11. Belov G., and Scheithauer G. A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stocl lengths. European Journal of Operational Research 141 (2002) 274-294
12. Alves C., and Valerio de Carvalho J.M. Accelerating column generation for variable sized bin-packing problems. European Journal of Operational Research 183 3 (2007) 1333-1352
13. Holthaus O. Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths. European Journal of Operational Research 141 (2002) 295-312
14. Martello S., and Toth P. Knapsack problems: algorithms and computer implementations (1990), Wiley, New York
15. Valerio de Carvalho J.M. LP models for bin packing and cutting stock problems. European Journal of Operational Research 141 (2002) 253-273
16. Johnston R.E., and Sadinlija E. A new model for complete solutions to one-dimensional cutting stock problems. European Journal of Operational Research 153 (2004) 176-183
17. Foerster H., and Wäscher G. Pattern reduction in one-dimensional cutting-stock problems. International Journal of Production Research 38 (2000) 1657-1676
18. Gau T., and Wäscher G. CUTGEN1: a problem generator for the standard one-dimensional cutting stock problem. European Journal of Operational Research 84 (1995) 572-579
19. Poldi KC, Arenales MN, Vianna ACG. Two-dimensional cutting stock problem under low demand: a case study. Operations Research Proceedings 2005-Selected papers of the German Operations Research Society (GOR); 2005. p. 291-6.
20. Cordeau J.F., Gendreau M., Laporte G., Potvin J.Y., and Semet F. A guide to vehicle routing heuristics. Journal of the Operational Research Society 53 (2002) 512-522
21. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting stock problem. Operations Research 9 (1961) 848-859
22. Gilmore P.C., and Gomory R.E. Multi-stage cutting stock problems of two and more dimensions. Operations Research 13 (1965) 94-120