Heuristic and exact methods for the cutting sequencing problem
From MaRDI portal
Publication:1303545
DOI10.1016/S0377-2217(97)00268-3zbMath0943.90061OpenAlexW1987445021MaRDI QIDQ1303545
Enrico Faggioli, Carlo Alberto Bentivoglio
Publication date: 16 September 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00268-3
Related Items
Refinements on an enumeration scheme for solving a pattern sequencing problem, Optimal patchings for consecutive ones matrices, A method for solving the minimization of the maximum number of open stacks problem within a cutting process, An integrated cutting stock and sequencing problem, Mathematical models for the minimization of open stacks problem, Connections between cutting-pattern sequencing, VLSI design, and flexible machines, 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, Strips minimization in two-dimensional cutting stock of circular items, The minimization of open stacks problem: a review of some properties and their use in pre-processing operations, Unnamed Item, A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry, A heuristic and an exact method for the gate matrix connection cost minimization problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Heuristics for sequencing cutting patterns
- Establishing the optimality of sequencing heuristics for cutting stock problems
- Improved heuristics for sequencing cutting patterns
- A user's guide to tabu search
- An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
- Tabu Search—Part I
- Glass cutting in a small firm
