Cutting stock problems and solution procedures

European Journal of Operational Research

Volumn 54, Issue 2, 1991, Pages 141-150

  Haessler, Robert W ^a   Sweeney, Paul E ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Cutting stock; heuristic problem solving; linear programming; pattern generation; trim loss; two dimensional knapsack

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; MATHEMATICAL PROGRAMMING, LINEAR; MATHEMATICAL TECHNIQUES - HEURISTIC; METAL CUTTING - OPTIMIZATION; OPERATIONS RESEARCH - MATHEMATICAL MODELS;

CUTTING STOCK PROBLEMS; PATTERN GENERATION; PROBLEM SOLVING; SEQUENTIONAL HEURISTIC; TWODIMENSIONAL KNAPSACK;

MACHINE SHOP PRACTICE;

EID: 0026221060     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(91)90293-5     Document Type: Article

References (22)

1. Algorithms for unconstrained two-dimensional guillotine cutting
2. An exact two-dimensional non-guillotine cutting tree search procedure
3. Some computational aspects of the M paper mills and P printers paper trim problem
4. An algoritham for two-dimensional cutting problems
5. A typology of cutting an packing problems
6. A linear programming approach to the cutting stock problem
7. A linear programming approach to the cutting stock problem Part II
8. Multistage cutting stock problems of two and more dimensions
9. The theory and computation of knapsack functions
10. An optimal algorithm for general, orthogonal, 2-D cutting problems
11. A heuristic programming solution to a nonlinear cutting stock problem
12. A note on computational modifications to the Gilmore-Gomory cutting stock algorithm
13. A new generation of paper machine trim programs
14. A 0–1 model for solving the corrugator trim problem
15. Mathematical methods of organizing and planning production
16. Nonorthogonal two-dimensional cutting patterns
17. Cutting and packing problems: An updated literature review
18. One-dimensional cutting stock decisions for rolls with multiple quality grades
19. A computational improvement to Wang's two-dimensional cutting stock algorithm
20. An exact best-first search procedure for the constrained rectangular guillotine knapsack problem
21. Two algorithms for constrained two-dimensional cutting stock problems