Connections between cutting-pattern sequencing, VLSI design, and flexible machines
Linhares, Alexandre; Yanasse, Horacio Hideki
O documento é disponibilizado pela fonte de origem, que mantém a versão integral e as condições de uso.
Resumo
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 VLS1 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.
Ficha do documento
- Tipo
- Artigo científico
- Ano
- 2002
- Instituição
- Pergamon-Elsevier Science Ltd
- Fonte
- Repositório da FGV
- Idioma
- Inglês
- Acesso
- Acesso restrito
- Identificador
- oai:repositorio.fgv.br:10438/23023
- Temas
- Tecnologia
Conteúdos relacionados
- Artigo científicoSearch intensity versus search diversitySpringer · 2010
- Artigo científicoEntanglement of perception and reasoning in the combinatorial game of chessElsevier Science Bv · 2012
- Artigo científicoAn active symbols theory of chess intuitionSpringer · 2005
- Artigo científicoA multiple-population evolutionary approach to gate matrix layoutTaylor & Francis Ltd · 2004
