| 1. Identity statement | |
| Reference Type | Journal Article |
| Site | mtc-m16.sid.inpe.br |
| Holder Code | isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S |
| Identifier | 6qtX3pFwXQZsFDuKxG/CUAzN |
| Repository | sid.inpe.br/marciana/2004/07.29.08.20 (restricted access) |
| Last Update | 2004:07.29.03.00.00 (UTC) administrator |
| Metadata Repository | sid.inpe.br/marciana/2004/07.29.08.20.22 |
| Metadata Last Update | 2018:06.05.01.21.00 (UTC) administrator |
| Secondary Key | INPE-11022-PRE/6478 |
| ISSN | 0305-0548 |
| Citation Key | BecceneriYanaSoma:2004:MeSoMi |
| Title | A method for solving the minimization of the maximum number of open stacks problem within a cutting process  |
| Project | Otimização combinatória |
| Year | 2004 |
| Month | Dec. |
| Access Date | 2024, Apr. 27 |
| Secondary Type | PRE PI |
| Number of Files | 1 |
| Size | 434 KiB |
| 2. Context | |
| Author | 1 Becceneri, José Carlos 2 Yanasse, Horacio Hideki 3 Soma, Nei Yoshihiro |
| Resume Identifier | 1 8JMKD3MGP5W/3C9JHGF 2 8JMKD3MGP5W/3C9JHCP |
| Group | 1 LAC-INPE-MCT-BR 2 LAC-INPE-MCT-BR |
| Affiliation | 1 Instituto Nacional de Pesquisas Espaciais, Laboratório Associado Computação e Matemática Aplicada (INPE.LAC) 2 Instituto Nacional de Pesquisas Espaciais, Laboratório Associado Computação e Matemática Aplicada (INPE.LAC) 3 Centro Tecnológico da Aeronáutica, Instituto Técnico Aeroespacial (CTA.ITA) |
| Author e-Mail Address | 1 becce@lac.inpe.br 2 horacio@lac.inpe.br 3 nysoma@comp.ita.cta.br |
| Journal | Computers and Operations Research |
| Volume | 31 |
| Number | 14 |
| Pages | 2315-2332 |
| History (UTC) | 2005-06-14 18:41:43 :: marciana -> administrator :: 2007-04-03 01:27:50 :: administrator -> marciana :: 2008-02-19 12:07:37 :: marciana -> administrator :: 2018-06-05 01:21:00 :: administrator -> marciana :: 2004 |
| 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 Otimização Heuristic methods Minimization of Open Stack Problem COMPUTAÇÃO APLICADA Corte Sequenciamento Optimization Métodos heurísticos Problema de minimização de pilhas abertas |
| Abstract | In this paper, the problem of minimizing the maximum number of open stacks around a saw machine is addressed. A new heuristic and a branch-and-bound based exact method for the problem are presented. Computational tests comparing the new approach with other algorithms previously suggested in the literature were carried out. |
| Area | COMP |
| Arrangement | A method for... |
| 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 | horacio.pdf |
| User Group | administrator marciana |
| 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 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 | |