Improved heuristics for sequencing cutting patterns
From MaRDI portal
Publication:1390257
DOI10.1016/0377-2217(94)00068-NzbMath0914.90230MaRDI QIDQ1390257
Publication date: 14 July 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
On the one-dimensional stock cutting problem in the paper tube industry, Tactical level planning in float glass manufacturing with co-production, random yields and substitutable products, The minimization of open stacks problem: a review of some properties and their use in pre-processing operations, Establishing the optimality of sequencing heuristics for cutting stock problems, Heuristic and exact methods for the cutting sequencing problem, Simulated annealing for order spread minimization in sequencing cutting patterns, A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry, A method for solving the minimization of the maximum number of open stacks problem within a cutting process, An improved typology of cutting and packing problems, An integrated cutting stock and sequencing problem, Optimising the cutting of wood fibre plates in the hardboard industry, A biased random-key genetic algorithm for the minimization of open stacks problem, A heuristic and an exact method for the gate matrix connection cost minimization problem, Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
Cites Work
- Heuristics for sequencing cutting patterns
- A note on modifying a two-dimensional trim-loss algorithm to deal with cutting restrictions
- A Linear Programming Approach to the Cutting-Stock Problem
- An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass 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
