A method for solving the minimization of the maximum number of open stacks problem within a cutting process
type: Item
instance of: scholarly article
title: A method for solving the minimization of the maximum number of open stacks problem within a cutting process
zbMATH Open document ID: 1067.90113
DOI: 10.1016/S0305-0548(03)00189-8
author: José Carlos Becceneri
author: Horacio Hideki Yanasse
author: Nei Yoshihiro Soma
published in: Computers \& Operations Research
publication date: 2004-11-18T00:00:00Z
Mathematics Subject Classification ID: 90B99
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 2116490
zbMATH Keywords: Cutting stock
zbMATH Keywords: Pattern sequencing
zbMATH Keywords: Graph traversing
zbMATH Keywords: Branch-and-bound
MaRDI profile type: Publication
cites work: Glass cutting in a small firm
cites work: An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
cites work: Applications of modern heuristic search methods to pattern sequencing problems
cites work: Simulated annealing for order spread minimization in sequencing cutting patterns
cites work: Heuristics for sequencing cutting patterns
cites work: Improved heuristics for sequencing cutting patterns
cites work: Heuristic and exact methods for the cutting sequencing problem
cites work: Establishing the optimality of sequencing heuristics for cutting stock problems
cites work: On a pattern sequencing problem to minimize the maximum number of open stacks
cites work: Connections between cutting-pattern sequencing, VLSI design, and flexible machines
full work available at URL: s0305-0548(03)00189-8
OpenAlex ID: W2121430424
description: scientific article; zbMATH DE number 2116490