Heuristic and exact methods for the cutting sequencing problem

DOI10.1016/S0377-2217(97)00268-3zbMATH Open0943.90061OpenAlexW1987445021MaRDI QIDQ1303545FDOQ1303545

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

zbMATH Keywords

heuristicgreedy algorithmtabu searchcutting stockcutting sequencinggeneralized local search

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• A user's guide to tabu search
• Title not available (Why is that?)
• Tabu Search—Part I
• An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
• Establishing the optimality of sequencing heuristics for cutting stock problems
• Improved heuristics for sequencing cutting patterns
• Heuristics for sequencing cutting patterns
• Glass cutting in a small firm
• Title not available (Why is that?)

Cited In (17)

• The two-dimensional cutting stock problem within the roller blind production process
• Optimal patchings for consecutive ones matrices
• A sequential heuristic procedure for one-dimensional cutting
• Connections between cutting-pattern sequencing, VLSI design, and flexible machines
• A heuristic and an exact method for the gate matrix connection cost minimization problem
• A biased random-key genetic algorithm for the minimization of open stacks problem
• The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
• Mathematical models for the minimization of open stacks problem
• A Heuristic Solution of a Cutting Problem Using Hypergraphs
• Strips minimization in two-dimensional cutting stock of circular items
• Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
• Title not available (Why is that?)
• Refinements on an enumeration scheme for solving a pattern sequencing problem
• Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
• An integrated cutting stock and sequencing problem
• A method for solving the minimization of the maximum number of open stacks problem within a cutting process
• A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry

Uses Software

• Tabu search

   Recommendations

• Establishing the optimality of sequencing heuristics for cutting stock problems 👍 👎
• Improved heuristics for sequencing cutting patterns 👍 👎
• Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais 👍 👎
• A sequential heuristic procedure for one-dimensional cutting 👍 👎
• Title not available (Why is that?) 👍 👎
• A Heuristic Solution of a Cutting Problem Using Hypergraphs 👍 👎
• Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns 👍 👎
• Computing minimum cuts by randomized search heuristics 👍 👎
• A Heuristic Algorithm for the Guillotine Constrained Cutting Stock Problem 👍 👎
• Randomized heuristics for the Max-Cut problem 👍 👎

This page was built for publication: Heuristic and exact methods for the cutting sequencing problem

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