Cutting stock problems and solution procedures
From MaRDI portal
Publication:1178994
DOI10.1016/0377-2217(91)90293-5zbMath0736.90062OpenAlexW2123469274MaRDI QIDQ1178994
Paul E. Sweeney, Robert W. Haessler
Publication date: 26 June 1992
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027.42/29128
pattern generationtrim losstwo-dimensional knapsackone- and two-dimensional cutting stocksequential heuristic
Linear programming (90C05) Production models (90B30) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Solving binary cutting stock problems by column generation and branch- and-bound, Solution procedures for cutting lumber into furniture parts, A population heuristic for constrained two-dimensional non-guillotine cutting, Improving blood products supply through donation tailoring, Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges, An interactive technique for the cutting stock problem with multiple objectives, A hybrid evolutionary algorithm for the two-dimensional packing problem, A simulated annealing approach to the nesting problem in the textile manufacturing industry, Bin packing and cutting stock problems: mathematical models and exact algorithms, A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, A hybrid genetic algorithm for the two-dimensional single large object placement problem, A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem, Heuristic for constrained T-shape cutting patterns of rectangular pieces, An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem, Optimization of roll cutting in clothing industry, Interactive procedures in large-scale two-dimensional cutting stock problems, A sequential heuristic procedure for one-dimensional cutting, An approximation algorithm for solving unconstrained two-dimensional knapsack problems, Packing different-sized circles into a rectangular container, Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory, An exact algorithm for general, orthogonal, two-dimensional knapsack problems, A cutting stock problem in the wood products industry: a two‐stage solution approach, An investigation into two bin packing problems with ordering and orientation implications, An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, Improving competitiveness in veneers production by a simple-to-use DSS., Solving circle packing problems by global optimization: numerical results and industrial applications, Rectangle blanket problem: binary integer linear programming formulation and solution algorithms, Optimal job splitting on a multi-slot machine with applications in the printing industry, Solving a combined cutting-stock and lot-sizing problem with a column generating procedure, A hybrid heuristic to reduce the number of different patterns in cutting stock problems, Bidirectional best-fit heuristic for orthogonal rectangular strip packing, Optimal and heuristic solutions for a scheduling problem arising in a foundry, Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths, A hybrid approach for optimization of one-dimensional cutting, A simulated annealing heuristic for the one-dimensional cutting stock problem, An effective solution for a real cutting stock problem in manufacturing plastic rolls, An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing, Random search in the one-dimensional cutting stock problem, Setup minimising conditions in the trim loss problem, A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting, Strips minimization in two-dimensional cutting stock of circular items, An effective quasi-human based heuristic for solving the rectangle packing problem, A branch-and-price algorithm for the temporal bin packing problem, An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem, A real-time one-dimensional cutting stock algorithm for balanced cutting patterns, One-dimensional cutting stock problem to minimize the number of different patterns, Enforcing minimum run length in the cutting stock problem
Cites Work
- A typology of cutting and packing problems
- One-dimensional cutting stock decisions for rolls with multiple quality grades
- Mathematical Methods of Organizing and Planning Production
- A Linear Programming Approach to the Cutting-Stock Problem
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Nonorthogonal Two-Dimensional Cutting Patterns
- Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
- An efficient implementation of an algorithm for findingK shortest simple paths
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- The Theory and Computation of Knapsack Functions
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
