Connections between cutting-pattern sequencing, VLSI Design, and flexible machines

Authors:
Alexandre Linhares;Horacio Hideki Yanasse
Affiliations:
Brazilian Space Research Institute, INPE/LAC, PO Box 515, S.J. Campos, SP 12201-970, Brazil and Brazilian School of Public Administration, EBAP/FGV, Praia Botafogo 190/426, Rio de Janeiro 22257-97 ...;Brazilian Space Research Institute, INPE/LAC, PO Box 515, S.J. Campos, SP 12201-970, Brazil
Venue:
Computers and Operations Research
Year:
2002

Citing 10
Cited 7

Searching and pebbling

Theoretical Computer Science
Nonconstructive advances in polynomial-time complexity

Information Processing Letters
Models arising from a flexible manufacturing machine, Part I: minimization of the number of tool switches

Operations Research
Narrowness, pathwidth, and their application in natural language processing

Discrete Applied Mathematics
The vertex separation number of a graph equals its path-width

Information Processing Letters
Fixed-Parameter Tractability and Completeness I: Basic Results

SIAM Journal on Computing
Helicopter search problems, bandwidth and pathwidth

Discrete Applied Mathematics
Applications of modern heuristic search methods to pattern sequencing problems

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Linear gate assignment: a fast statistical mechanics approach

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

A multiple-population evolutionary approach to gate matrix layout

International Journal of Systems Science
A method for solving the minimization of the maximum number of open stacks problem within a cutting process

Computers and Operations Research
Directed Unfolding of Petri Nets

Transactions on Petri Nets and Other Models of Concurrency I
Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners

Artificial Intelligence
Minimizing the maximum number of open stacks by customer search

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Search intensity versus search diversity: a false trade off?

Applied Intelligence
Improving combinatorial optimization: extended abstract

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

The minimization of open stacks problem (MOSP) arises on the sequencing of a set of cutting patterns in order to minimize the maximum number of open stacks around the cutting saw. A previous study formulated the problem mathematically and raised a number of theoretical conjectures. In this work we deal with those conjectures. It is shown that the MOSP is NP-hard. A connection to the field of VLSI design, joining practitioners from both computer science and operations research, is established. Additional conjectures concerning the existence of simultaneous optimal solutions to related pattern-sequencing problems are also clarified.