The minimization of open stacks problem: a review of some properties and their use in pre-processing operations

DOI10.1016/j.ejor.2009.09.017zbMath1177.90354MaRDI QIDQ1046052

Horacio Hideki Yanasse, Edson Luiz França Senne

Publication date: 21 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.09.017

zbMATH Keywords

combinatorial optimization; pre-processing; size reduction; minimization of open stack problem

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90C27: Combinatorial optimization

Related Items

Reducing the number of cuts in generating three-staged cutting patterns, An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint, A biased random-key genetic algorithm for the minimization of open stacks problem

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristics for sequencing cutting patterns
• Heuristics for matrix bandwidth reduction
• Establishing the optimality of sequencing heuristics for cutting stock problems
• Hamiltonian circuits in random graphs
• 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
• A method for solving the minimization of the maximum number of open stacks problem within a cutting process
• Connections between cutting-pattern sequencing, VLSI design, and flexible machines
• Dynamic Programming to Minimize the Maximum Number of Open Stacks
• Refinements on an enumeration scheme for solving a pattern sequencing problem
• An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• The bandwidth problem for graphs and matrices—a survey
• Complexity Results for Bandwidth Minimization