A typology of cutting and packing problems

European Journal of Operational Research

Volumn 44, Issue 2, 1990, Pages 145-159

  Dyckhoff, Harald ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Cutting; distribution; engineering; packing; production

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; MATERIALS--CUTTING; PACKAGING;

CUTTING PROBLEM; PACKING PROBLEM; TRIM LOSS;

OPERATIONS RESEARCH;

EID: 0025210672     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(90)90350-K     Document Type: Article

References (40)

1. Two-dimensional finite bin-packing algorithms
2. The dissection of rectangles into squares
3. An application of bin-packing to multiprocessor scheduling
4. Approximation algorithms for bin-packing—An updated survey
5. Discrete-variable extremum problems
6. Two and three dimensional packing problems and solution methods
7. Exact methods for the knapsack problem and its generalizations
8. Production theoretic foundation of cutting and related processes
9. Bridges between two principal model formulations for cutting stock processes
10. Trim loss and related problems
11. Standard software for cutting stock management
12. The loading problem
13. Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
14. Approximation algorithms for bin packing problems: A survey
15. Cutting stock, linear programming, knapsacking, dynamic programming and integer programming: Some interconnections
16. A linear programming approach to the cutting-stock problem
17. A heuristic programming solution to a nonlinear cutting stock problem
18. Load planning for shipments of low density products
19. Integration eines heuristisch-optimierenden Verfahrens zu Lösung eines eindimensionalen Verschnittproblems in einem EDV-gestützten Produktionsplanungs- und -steuerungssystem
20. The trim loss and assortment problems: A survey
21. Two-dimensional cutting stock problem research: A review and a new rectangular layout algorithm
22. Performance testing of rectangular parts-nesting heuristics
23. Mathematical methods of organizing and planning production
24. Three problems in capital rationing
25. Optimal and canonical solutions of the change making problem
26. Algorithms for knapsack problems
27. Bin packing
28. An analysis of heuristic trim loss algorithms
29. The knapsack problem: A survey
30. A comparison of two optimization procedures for 1- and 1.5-dimensional cutting stock problems
31. Der Bedarf an Münzen in verschiedenen Münzsystemen
32. An LP-based approach to cutting stock problems with multiple objectives
33. Entwicklung eines flexiblen Verfahrens für Zuschneideprobleme in einem Kaltwalzwerk
34. Assembly line balancing as generalized bin-packing