An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
From MaRDI portal
Publication:2433559
DOI10.1016/j.ejor.2004.10.034zbMath1136.90533OpenAlexW2122757537WikidataQ57185911 ScholiaQ57185911MaRDI QIDQ2433559
Publication date: 27 October 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.10.034
Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27)
Related Items
Optimisation of a multi-objective two-dimensional strip packing problem based on evolutionary algorithms ⋮ Heuristic for constrained T-shape cutting patterns of rectangular pieces ⋮ Two-dimensional cutting stock problem with sequence dependent setup times ⋮ Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation ⋮ A heuristic for the skiving and cutting stock problem in paper and plastic film industries ⋮ Reducing the number of cuts in generating three-staged cutting patterns ⋮ A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber ⋮ Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns ⋮ An effective solution for a real cutting stock problem in manufacturing plastic rolls
Cites Work
- Unnamed Item
- Unnamed Item
- A sequential heuristic procedure for one-dimensional cutting
- An LP-based approach to a two-stage cutting stock problem
- Cutting stock problems and solution procedures
- Packing problems
- On genetic algorithms for the packing of polygons
- Random search in the one-dimensional cutting stock problem
- Setup minimising conditions in the trim loss problem
- The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
- Some experiments with simulated annealing techniques for packing problems
- Row and column generation technique for a multistage cutting stock problem
- Approximation algorithm for the oriented two-dimensional bin packing problem
- A typology of cutting and packing problems
- One-dimensional cutting stock decisions for rolls with multiple quality grades
- An LP-based approach to cutting stock problems with multiple objectives
- Optimal solutions for the cutting stock problem
- Two-dimensional packing problems: a survey
- Pattern minimisation in cutting stock problems
- A combined cutting-stock and lot-sizing problem
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
- A Linear Programming Approach to the Cutting-Stock Problem
- Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
- A New Linear Programming Approach to the Cutting Stock Problem
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- The One Dimensional Cutting Stock Problem Using Two Objectives
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems
- A Cutting Stock and Scheduling Problem in the Copper Industry
- 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
