Connections between cutting-pattern sequencing, VLSI design, and flexible machines
From MaRDI portal
Publication:1941954
DOI10.1016/S0305-0548(01)00054-5zbMath1259.90166MaRDI QIDQ1941954
Horacio Hideki Yanasse, Alexandre Linhares
Publication date: 25 March 2013
Published in: Computers \& Operations Research (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Inventory, storage, reservoirs (90B05)
Related Items (17)
An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint ⋮ Refinements on an enumeration scheme for solving a pattern sequencing problem ⋮ Optimal patchings for consecutive ones matrices ⋮ Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners ⋮ A method for solving the minimization of the maximum number of open stacks problem within a cutting process ⋮ An integrated cutting stock and sequencing problem ⋮ Heuristic methods to consecutive block minimization ⋮ Iterated local search for consecutive block minimization ⋮ Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern ⋮ Exponential neighborhood search for consecutive block minimization ⋮ Mathematical models for the minimization of open stacks problem ⋮ A multiple-population evolutionary approach to gate matrix layout ⋮ Directed Unfolding of Petri Nets ⋮ A biased random-key genetic algorithm for the minimization of open stacks problem ⋮ Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais ⋮ The minimization of open stacks problem: a review of some properties and their use in pre-processing operations ⋮ A heuristic and an exact method for the gate matrix connection cost minimization problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interval graphs and searching
- Nonconstructive advances in polynomial-time complexity
- Black-white pebbles and graph separation
- Narrowness, pathwidth, and their application in natural language processing
- The vertex separation number of a graph equals its path-width
- 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
- Helicopter search problems, bandwidth and pathwidth
- Searching and pebbling
- One-dimensional logic gate assignment and interval graphs
- 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
- Fixed-Parameter Tractability and Completeness I: Basic Results
This page was built for publication: Connections between cutting-pattern sequencing, VLSI design, and flexible machines
