| 1. Identity statement | |
| Reference Type | Journal Article |
| Site | mtc-m16.sid.inpe.br |
| Holder Code | isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S |
| Identifier | 6qtX3pFwXQZsFDuKxG/DbG39 |
| Repository | sid.inpe.br/marciana/2004/08.17.11.27 (restricted access) |
| Last Update | 2004:08.17.03.00.00 (UTC) administrator |
| Metadata Repository | sid.inpe.br/marciana/2004/08.17.11.27.43 |
| Metadata Last Update | 2018:06.05.01.28.42 (UTC) administrator |
| Secondary Key | INPE-11219-PRE/6668 |
| ISBN/ISSN | 0377-2217 |
| ISSN | 0377-2217 |
| Citation Key | Yanasse:1997:PaSePr |
| Title | On a pattern sequencing problem to minimize the maximum number of open stacks  |
| Project | Otimização combinatória |
| Year | 1997 |
| Month | Aug. |
| Access Date | 2024, Apr. 28 |
| Secondary Type | PRE PI |
| Number of Files | 1 |
| Size | 714 KiB |
| 2. Context | |
| Author | Yanasse, Horacio Hideki |
| Resume Identifier | 8JMKD3MGP5W/3C9JHCP |
| Group | LAC-INPE-MCT-BR |
| Affiliation | Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada (INPE.LAC) |
| Journal | European Journal of Operational Research |
| Volume | 100 |
| Number | 3 |
| Pages | 454-463 |
| History (UTC) | 2005-06-28 12:43:10 :: sergio -> administrator :: 2006-09-28 22:36:23 :: administrator -> sergio :: 2008-01-07 12:49:57 :: sergio -> administrator :: 2018-06-05 01:28:42 :: administrator -> marciana :: 1997 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Content Type | External Contribution |
| Keywords | COMPUTER SCIENCE Cutting Sequencing Allocations Switches Minimization of Open Stack Problem COMPUTAÇÃO APLICADA Corte Seqüenciamento Alocações Chaves Problemas de minimização de pilhas abertas |
| Abstract | Consider a wood cutting setting where different panels have to be cut from large boards. Each cut panel size is put into a stack which remains opened until the last panel of that size is cut. The problem considered here deals with the sequencing of the patterns in order to minimize the maximum number of open stacks during the production run. A branch and bound method for solving this problem is presented which uses a greedy type scheme to select the next node to branch. |
| Area | COMP |
| Arrangement | urlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > On a pattern... |
| doc Directory Content | access |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| 4. Conditions of access and use | |
| Language | en |
| Target File | on a pattern.pdf |
| User Group | administrator sergio |
| Visibility | shown |
| Copy Holder | SID/SCD |
| Archiving Policy | denypublisher denyfinaldraft36 |
| Read Permission | deny from all and allow from 150.163 |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPCW/3ESGTTP |
| Dissemination | WEBSCI; PORTALCAPES. |
| Host Collection | sid.inpe.br/banon/2003/08.15.17.40 |
| 6. Notes | |
| Empty Fields | alternatejournal archivist callnumber copyright creatorhistory descriptionlevel documentstage doi e-mailaddress electronicmailaddress format isbn label lineage mark mirrorrepository nextedition notes orcid parameterlist parentrepositories previousedition previouslowerunit progress readergroup rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url versiontype |
| 7. Description control | |
| e-Mail (login) | marciana |
| update | |