Heuristics for sequencing cutting patterns
From MaRDI portal
Publication:807386
DOI10.1016/0377-2217(91)90222-HzbMath0729.90997OpenAlexW1974206331MaRDI QIDQ807386
Publication date: 1991
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(91)90222-h
Deterministic scheduling theory in operations research (90B35) Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (18)
Refinements on an enumeration scheme for solving a pattern sequencing problem ⋮ A method for solving the minimization of the maximum number of open stacks problem within a cutting process ⋮ An interactive technique for the cutting stock problem with multiple objectives ⋮ An integrated cutting stock and sequencing problem ⋮ Establishing the optimality of sequencing heuristics for cutting stock problems ⋮ Improved heuristics for sequencing cutting patterns ⋮ Mathematical models for the minimization of open stacks problem ⋮ On the one-dimensional stock cutting problem in the paper tube industry ⋮ Lock-free parallel dynamic programming ⋮ Heterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methods ⋮ A biased random-key genetic algorithm for the minimization of open stacks problem ⋮ Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais ⋮ A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders ⋮ On a pattern sequencing problem to minimize the maximum number of open stacks ⋮ The minimization of open stacks problem: a review of some properties and their use in pre-processing operations ⋮ A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry ⋮ Heuristic and exact methods for the cutting sequencing problem ⋮ Simulated annealing for order spread minimization in sequencing cutting patterns
Cites Work
- 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
- Glass cutting in a small firm
- 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
This page was built for publication: Heuristics for sequencing cutting patterns