A method for solving the minimization of the maximum number of open stacks problem within a cutting process

DOI10.1016/S0305-0548(03)00189-8zbMath1067.90113OpenAlexW2121430424MaRDI QIDQ1886499

Horacio Hideki Yanasse, José Carlos Becceneri, Nei Yoshihiro Soma

Publication date: 18 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00189-8

zbMATH Keywords

Branch-and-boundCutting stockPattern sequencingGraph traversing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Operations research and management science (90B99)

Related Items (13)

An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint ⋮ An integrated cutting stock and sequencing problem ⋮ Optimising the cutting of wood fibre plates in the hardboard industry ⋮ Heuristic methods to consecutive block minimization ⋮ Iterated local search for consecutive block minimization ⋮ Exponential neighborhood search for consecutive block minimization ⋮ Mathematical models for the minimization of open stacks problem ⋮ On the one-dimensional stock cutting problem in the paper tube industry ⋮ 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 ⋮ A heuristic and an exact method for the gate matrix connection cost minimization problem

Cites Work

• Heuristics for sequencing cutting patterns
• Establishing the optimality of sequencing heuristics for cutting stock problems
• On a pattern sequencing problem to minimize the maximum number of open stacks
• Applications of modern heuristic search methods to pattern sequencing problems
• Heuristic and exact methods for the cutting sequencing problem
• Simulated annealing for order spread minimization in sequencing cutting patterns
• Improved heuristics for sequencing cutting patterns
• Connections between cutting-pattern sequencing, VLSI design, and flexible machines
• An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
• Glass cutting in a small firm

This page was built for publication: A method for solving the minimization of the maximum number of open stacks problem within a cutting process