The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
type: Item
instance of: scholarly article
title: The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
zbMATH Open document ID: 1177.90354
author: Horacio Hideki Yanasse
author: E. L. F. Senne
published in: European Journal of Operational Research
publication date: 2009-12-21T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5650797
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: minimization of open stack problem
zbMATH Keywords: pre-processing
zbMATH Keywords: size reduction
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.09.017
OpenAlex ID: W2021487162
cites work: Dynamic programming to minimize the maximum number of open stacks
cites work: A method for solving the minimization of the maximum number of open stacks problem within a cutting process
cites work: The bandwidth problem for graphs and matrices—a survey
cites work: Heuristic and exact methods for the cutting sequencing problem
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: Complexity Results for Bandwidth Minimization
cites work: Heuristics for matrix bandwidth reduction
cites work: Connections between cutting-pattern sequencing, VLSI design, and flexible machines
cites work: An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
cites work: Q3477966
cites work: Q4438009
cites work: Hamiltonian circuits in random graphs
cites work: Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
cites work: On a pattern sequencing problem to minimize the maximum number of open stacks
cites work: Refinements on an enumeration scheme for solving a pattern sequencing problem
cites work: Heuristics for sequencing cutting patterns
cites work: Improved heuristics for sequencing cutting patterns
cites work: Establishing the optimality of sequencing heuristics for cutting stock problems
DOI: 10.1016/J.EJOR.2009.09.017
description: scientific article; zbMATH DE number 5650797