Cutting stock problems and solution procedures

DOI10.1016/0377-2217(91)90293-5MaRDI QIDQ1178994zbMATH OpenOpenAlexFDO

Authors Robert W. Haessler, Paul E. Sweeney

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

zbMATH Keywords

pattern generationtrim losstwo-dimensional knapsackone- and two-dimensional cutting stocksequential heuristic

Mathematics Subject Classification ID

Linear programming (90C05) 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) Production models (90B30)

Recommendations

• One-dimensional cutting stock problems and solution procedures
• Near-optimal solutions to one-dimensional cutting stock problems
• scientific article; zbMATH DE number 1050896
• Optimal solutions for the cutting stock problem
• Interactive procedures in large-scale two-dimensional cutting stock problems

Cites work

• A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A Linear Programming Approach to the Cutting-Stock Problem
• A typology of cutting and packing problems
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• An efficient implementation of an algorithm for findingK shortest simple paths
• Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
• Multistage Cutting Stock Problems of Two and More Dimensions
• Nonorthogonal Two-Dimensional Cutting Patterns
• One-dimensional cutting stock decisions for rolls with multiple quality grades
• Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
• The Theory and Computation of Knapsack Functions
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems

Cited in

(72)

• The sequential value correction method for the two-dimensional irregular cutting stock problem
• scientific article; zbMATH DE number 4055375 (Why is no real title available?)
• A matching approach for replenishing rectangular stock sizes
• Interactive procedures in large-scale two-dimensional cutting stock problems
• An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem
• Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory
• A grouping method for solving a continuous linear cutting stock problem
• A branch-and-price algorithm for the temporal bin packing problem
• Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem
• A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
• 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
• Solving circle packing problems by global optimization: numerical results and industrial applications
• scientific article; zbMATH DE number 3954634 (Why is no real title available?)
• Random search in the one-dimensional cutting stock problem
• Setup minimising conditions in the trim loss problem
• Heuristic for constrained T-shape cutting patterns of rectangular pieces
• Improving blood products supply through donation tailoring
• Solution procedures for cutting lumber into furniture parts
• Wastage reduction in wood cutting
• Bidirectional best-fit heuristic for orthogonal rectangular strip packing
• scientific article; zbMATH DE number 3891135 (Why is no real title available?)
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• scientific article; zbMATH DE number 4029242 (Why is no real title available?)
• Knowledge-based systems for cutting stock problems
• Packing different-sized circles into a rectangular container
• The cutting stock problem in the canvas industry
• A hybrid approach for optimization of one-dimensional cutting
• Development of some cutting stock algorithms
• Limiting the number of each piece in two-dimensional cutting stock patterns
• Knowledge based approach to the cutting stock problem
• An investigation into two bin packing problems with ordering and orientation implications
• An effective solution for a real cutting stock problem in manufacturing plastic rolls
• Improving competitiveness in veneers production by a simple-to-use DSS.
• A population heuristic for constrained two-dimensional non-guillotine cutting
• New cases of the cutting stock problem having MIRUP
• An approximation algorithm for solving unconstrained two-dimensional knapsack problems
• A real-time one-dimensional cutting stock algorithm for balanced cutting patterns
• One-dimensional cutting stock decisions for rolls with multiple quality grades
• A sequential heuristic procedure for one-dimensional cutting
• Optimal and heuristic solutions for a scheduling problem arising in a foundry
• An integrated cutting stock and sequencing problem
• Enforcing minimum run length in the cutting stock problem
• A simulated annealing approach to the nesting problem in the textile manufacturing industry
• A simulated annealing heuristic for the one-dimensional cutting stock problem
• A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry
• Solving binary cutting stock problems by column generation and branch- and-bound
• Optimization of roll cutting in clothing industry
• Two-dimensional cutting stock problem with sequence dependent setup times
• A hybrid evolutionary algorithm for the two-dimensional packing 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
• A cutting stock problem in the wood products industry: a two‐stage solution approach
• An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• An integer programming model for two- and three-stage two-dimensional cutting stock problems
• An effective quasi-human based heuristic for solving the rectangle packing problem
• An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
• 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
• An LP-based approach to cutting stock problems with multiple objectives
• A hybrid heuristic to reduce the number of different patterns in cutting stock problems
• Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
• An exact algorithm for general, orthogonal, two-dimensional knapsack problems
• scientific article; zbMATH DE number 444980 (Why is no real title available?)
• An interactive technique for the cutting stock problem with multiple objectives
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
• One-dimensional cutting stock problem to minimize the number of different patterns
• On the effectivity of gradient methods for cutting stock problems
• Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
• Near-optimal solutions to one-dimensional cutting stock problems

This page was built for publication: Cutting stock problems and solution procedures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1178994)