%0 Journal Article
%@holdercode {isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S}
%@nexthigherunit 8JMKD3MGPCW/3ESGTTP
%3 1-s2.0-S0305054801000545-main.pdf
%X 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.
%8 Oct.
%N 12
%@secondarydate 20021009
%T Connections between cutting-pattern sequencing, VLSI desig, and flexible machines
%@electronicmailaddress
%@electronicmailaddress horacio@lac.inpe.br
%K pattern sequencing, flexible machines, VLSI layout, computational complexity.
%@secondarytype PRE PI
%@archivingpolicy denypublisher denyfinaldraft36
%@usergroup administrator
%@usergroup jefferson
%@group LAC-INPE-MCT-BR
%@group LAC-INPE-MCT-BR
%@secondarykey INPE-9831-PRE/5415
%F 10508
%@issn 0305-0548
%2 sid.inpe.br/iris@1905/2005/08.04.02.48.24
%@affiliation Instituto Nacional de Pesquisas Espaciais (INPE)
%@affiliation Instituto Nacional de Pesquisas Espaciais (INPE)
%B Computers and Operations Research
%@versiontype publisher
%P 1759-1772
%4 sid.inpe.br/iris@1905/2005/08.04.02.48
%@documentstage not transferred
%D 2002
%V 29
%A Linhares, Alexandre,
%A Yanasse, Horacio Hideki,
%@dissemination WEBSCI; PORTALCAPES.
%@area COMP