Connections between cutting-pattern sequencing, VLSI design, and flexible machines
type: Item
instance of: scholarly article
title: Connections between cutting-pattern sequencing, VLSI design, and flexible machines
zbMATH Open document ID: 1259.90166
DOI: 10.1016/S0305-0548(01)00054-5
author: Alexandre Linhares
author: Horacio Hideki Yanasse
published in: Computers \& Operations Research
publication date: 2013-03-25T00:00:00Z
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90B05
zbMATH DE Number: 6148476
zbMATH Keywords: pattern sequencing
zbMATH Keywords: flexible machines
zbMATH Keywords: VLSI layout
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
cites work: On a pattern sequencing problem to minimize the maximum number of open stacks
cites work: Q3328583
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: Applications of modern heuristic search methods to pattern sequencing problems
cites work: Q3477966
cites work: One-dimensional logic gate assignment and interval graphs
cites work: Interval graphs and searching
cites work: Searching and pebbling
cites work: Narrowness, pathwidth, and their application in natural language processing
cites work: Helicopter search problems, bandwidth and pathwidth
cites work: The vertex separation number of a graph equals its path-width
cites work: Black-white pebbles and graph separation
cites work: Nonconstructive advances in polynomial-time complexity
cites work: Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
cites work: Q4198056
cites work: An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
cites work: Heuristic and exact methods for the cutting sequencing problem
cites work: Simulated annealing for order spread minimization in sequencing cutting patterns
description: scientific article; zbMATH DE number 6148476