Close

1. Identity statement
Reference TypeJournal Article
Sitemtc-m16c.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier8JMKD3MGP8W/35REN65
Repositorysid.inpe.br/mtc-m18@80/2009/08.13.15.14   (restricted access)
Last Update2009:08.13.15.14.42 (UTC) administrator
Metadata Repositorysid.inpe.br/mtc-m18@80/2009/08.13.15.14.43
Metadata Last Update2020:04.28.17.48.58 (UTC) administrator
Secondary KeyINPE--PRE/
ISSN1983-8409
2177-8833
Citation KeyCerqueiraYana:2009:PaRePr
TitleA pattern reduction procedure in a one-dimensional cutting stock problem by grouping items according to their demands
Year2009
MonthJune
Access Date2024, Apr. 28
Secondary TypePRE PI
Number of Files1
Size257 KiB
2. Context
Author1 Cerqueira, Gonçalo Renildo Lima
2 Yanasse, Horacio Hideki
Resume Identifier1
2 8JMKD3MGP5W/3C9JHCP
Group1
2 LAC-CTE-INPE-MCT-BR
Affiliation1 Universidade do Estado do Sul da Bahia (UESB)
2 Instituto Nacional de Pesquisas Espaciais (INPE)
JournalJournal of Computational Interdisciplinary Sciences
Volume1
Number2
Pages159-164
History (UTC)2009-08-13 15:15:53 :: simone -> administrator ::
2010-05-11 01:10:00 :: administrator -> simone ::
2011-12-19 13:45:56 :: simone -> administrator ::
2020-04-28 17:48:58 :: administrator -> simone :: 2009
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
Version Typepublisher
Keywordscutting stock problem
computational heuristic method
pattern reduction procedure
linear programming
AbstractCutting and packing appear in many industrial settings where larger pieces are cut into smaller ones in order to produce items or products that are required by other industries or customers, e.g., paper, steel and fiber industries. A solution for the cutting problem consists in determining a group of patterns and their frequencies, that is, the number of times that a pattern is cut to supply the demand. Cost of the production may be dependent on the pattern changes, because they might require time and people to prepare the equipment. This work introduces a heuristics method/approach that produces a solution to the one-dimensional cutting shock problem with a reduced number of different patterns in the solution. The heuristic method proposed begin separating the items in two disjointed groups, according to their demands. Patterns are generated with items of these groups and those with limited waste are accepted. A residual problem is solved with items whose demands are not satisfied and, with the solution obtained, we apply a pattern reducing procedure of the literature.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > A pattern reduction...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
Languageen
Target Filea pattern reduction.pdf
User Groupadministrator
simone
Visibilityshown
Archiving Policydenypublisher denyfinaldraft
Read Permissiondeny from all and allow from 150.163
Update Permissionnot transferred
5. Allied materials
Mirror Repositorysid.inpe.br/mtc-m18@80/2008/03.17.15.17.24
Next Higher Units8JMKD3MGPCW/3ESGTTP
Host Collectionsid.inpe.br/mtc-m18@80/2008/03.17.15.17
6. Notes
Empty Fieldsalternatejournal archivist callnumber copyholder copyright creatorhistory descriptionlevel dissemination doi e-mailaddress electronicmailaddress format isbn label lineage mark nextedition notes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url
7. Description control
e-Mail (login)simone
update 


Close