Refinements on an enumeration scheme for solving a pattern sequencing problem

DOI10.1111/j.1475-3995.2004.00458.xzbMath1162.90589OpenAlexW2026641910MaRDI QIDQ3158869

Marcelo Saraiva Limeira, Horacio Hideki Yanasse

Publication date: 31 January 2005

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2004.00458.x

zbMATH Keywords

branch-and-boundsequencing problemgate matrix layoutopen orders minimizationprogrammable logic array folding

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

An integrated cutting stock and sequencing problem, A two-dimensional strip cutting problem with sequencing constraint, Mathematical models for the minimization of open stacks problem, A hybrid heuristic to reduce the number of different patterns in cutting stock problems, 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

Cites Work

• Heuristics for sequencing cutting patterns
• The vertex separation number of a graph equals its path-width
• On a pattern sequencing problem to minimize the maximum number of open stacks
• Heuristic and exact methods for the cutting sequencing problem
• The vertex separation and search number of a graph
• Connections between cutting-pattern sequencing, VLSI design, and flexible machines
• One-dimensional logic gate assignment and interval graphs
• Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach