Refinements on an enumeration scheme for solving a pattern sequencing problem

DOI10.1111/J.1475-3995.2004.00458.XMaRDI QIDQ3158869zbMATH OpenOpenAlexFDO

Authors 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-boundgate matrix layoutopen orders minimizationprogrammable logic array foldingsequencing problem

Mathematics Subject Classification ID

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

Recommendations

• Connections between cutting-pattern sequencing, VLSI design, and flexible machines
• On a pattern sequencing problem to minimize the maximum number of open stacks
• Minimization of open orders using interval graphs
• The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
• A branch \(\&\) bound algorithm for the open-shop problem

Cites work

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

Cited in

(14)

• The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
• On a pattern sequencing problem to minimize the maximum number of open stacks
• Connections between cutting-pattern sequencing, VLSI design, and flexible machines
• A skeleton model to enumerate standard puzzle sequences
• A hybrid heuristic to reduce the number of different patterns in cutting stock problems
• An integrated cutting stock and sequencing problem
• A two-dimensional strip cutting problem with sequencing constraint
• Algorithms for the exact solution of the problems of enumeration, coding, and generation of serial sequences
• A biased random-key genetic algorithm for the minimization of open stacks problem
• Minimization of open orders using interval graphs
• scientific article; zbMATH DE number 3570344 (Why is no real title available?)
• Enumeration schemes for vincular patterns
• scientific article; zbMATH DE number 1286249 (Why is no real title available?)
• Mathematical models for the minimization of open stacks problem

This page was built for publication: Refinements on an enumeration scheme for solving a pattern sequencing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3158869)