A heuristic approach to minimize the number of saw cycles in small-scale furniture factories

Detalhes bibliográficos
Autor(a) principal: Toscano, Alyne
Data de Publicação: 2017
Outros Autores: Rangel, Socorro, Yanasse, Horacio Hideki [UNIFESP]
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UNIFESP
Texto Completo: http://dx.doi.org/10.1007/s10479-015-1955-9
https://repositorio.unifesp.br/handle/11600/58254
Resumo: This paper addresses a two-dimensional cutting stock problem arising in furniture factories. The problem involves the simultaneous optimization of two, usually conflicting, objectives: minimizing the total number of objects and maximizing the cutting machine productivity in terms of the number of objects that are simultaneously cut. A heuristic algorithm to solve the problem is proposed based on variables and constraints generation. The main idea is to add, in a dynamic way, bounds to the frequency of some chosen cutting patterns. At each iteration a solution is generated and at the end we have a set of non-dominated solutions. A computational study was conducted using real data from a small-scale furniture factory. The results show that the proposed algorithm finds solutions that are as good as or better than the ones used in practice in the furniture factory.
id UFSP_d0c1a5999210678f430d7c30ea22dc06
oai_identifier_str oai:repositorio.unifesp.br/:11600/58254
network_acronym_str UFSP
network_name_str Repositório Institucional da UNIFESP
repository_id_str 3465
spelling A heuristic approach to minimize the number of saw cycles in small-scale furniture factoriesTwo-dimensional cutting stockSaw cyclesMachine productivityColumn generationHeuristicFurniture productionThis paper addresses a two-dimensional cutting stock problem arising in furniture factories. The problem involves the simultaneous optimization of two, usually conflicting, objectives: minimizing the total number of objects and maximizing the cutting machine productivity in terms of the number of objects that are simultaneously cut. A heuristic algorithm to solve the problem is proposed based on variables and constraints generation. The main idea is to add, in a dynamic way, bounds to the frequency of some chosen cutting patterns. At each iteration a solution is generated and at the end we have a set of non-dominated solutions. A computational study was conducted using real data from a small-scale furniture factory. The results show that the proposed algorithm finds solutions that are as good as or better than the ones used in practice in the furniture factory.Univ Fed Triangulo Mineiro, Av Dr Randolfo Borges Jr 1250, BR-38025180 Uberaba, BrazilUniv Estadual Paulista, UNESP, R Cristovao Colombo 2265, BR-15054000 Sao Jose Do Rio Preto, BrazilUniv Fed Sao Paulo, Inst Ciencia & Tecnol, Av Cesare Mansueto Giulio Latte 1201, BR-12247014 Sao Jose Dos Campos, BrazilUniv Fed Sao Paulo, Inst Ciencia & Tecnol, Av Cesare Mansueto Giulio Latte 1201, BR-12247014 Sao Jose Dos Campos, BrazilWeb of ScienceCNPqFAPESPCAPESSpringer2020-09-01T13:21:26Z2020-09-01T13:21:26Z2017info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersion719-746http://dx.doi.org/10.1007/s10479-015-1955-9Annals Of Operations Research. Dordrecht, v. 258, n. 2, p. 719-746, 2017.10.1007/s10479-015-1955-90254-5330https://repositorio.unifesp.br/handle/11600/58254WOS:000415728600023engAnnals Of Operations ResearchJoint International Meeting of 17th Conference of the Association-of-Latin-Iberoamerican-Operational-Research-Societies / 3rd Annual Conference of the Mexican-Operations-Research-Society (SMIO)Dordrechtinfo:eu-repo/semantics/openAccessToscano, AlyneRangel, SocorroYanasse, Horacio Hideki [UNIFESP]reponame:Repositório Institucional da UNIFESPinstname:Universidade Federal de São Paulo (UNIFESP)instacron:UNIFESP2021-09-29T09:32:03Zoai:repositorio.unifesp.br/:11600/58254Repositório InstitucionalPUBhttp://www.repositorio.unifesp.br/oai/requestbiblioteca.csp@unifesp.bropendoar:34652021-09-29T09:32:03Repositório Institucional da UNIFESP - Universidade Federal de São Paulo (UNIFESP)false
dc.title.none.fl_str_mv A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
title A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
spellingShingle A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
Toscano, Alyne
Two-dimensional cutting stock
Saw cycles
Machine productivity
Column generation
Heuristic
Furniture production
title_short A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
title_full A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
title_fullStr A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
title_full_unstemmed A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
title_sort A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
author Toscano, Alyne
author_facet Toscano, Alyne
Rangel, Socorro
Yanasse, Horacio Hideki [UNIFESP]
author_role author
author2 Rangel, Socorro
Yanasse, Horacio Hideki [UNIFESP]
author2_role author
author
dc.contributor.author.fl_str_mv Toscano, Alyne
Rangel, Socorro
Yanasse, Horacio Hideki [UNIFESP]
dc.subject.por.fl_str_mv Two-dimensional cutting stock
Saw cycles
Machine productivity
Column generation
Heuristic
Furniture production
topic Two-dimensional cutting stock
Saw cycles
Machine productivity
Column generation
Heuristic
Furniture production
description This paper addresses a two-dimensional cutting stock problem arising in furniture factories. The problem involves the simultaneous optimization of two, usually conflicting, objectives: minimizing the total number of objects and maximizing the cutting machine productivity in terms of the number of objects that are simultaneously cut. A heuristic algorithm to solve the problem is proposed based on variables and constraints generation. The main idea is to add, in a dynamic way, bounds to the frequency of some chosen cutting patterns. At each iteration a solution is generated and at the end we have a set of non-dominated solutions. A computational study was conducted using real data from a small-scale furniture factory. The results show that the proposed algorithm finds solutions that are as good as or better than the ones used in practice in the furniture factory.
publishDate 2017
dc.date.none.fl_str_mv 2017
2020-09-01T13:21:26Z
2020-09-01T13:21:26Z
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://dx.doi.org/10.1007/s10479-015-1955-9
Annals Of Operations Research. Dordrecht, v. 258, n. 2, p. 719-746, 2017.
10.1007/s10479-015-1955-9
0254-5330
https://repositorio.unifesp.br/handle/11600/58254
WOS:000415728600023
url http://dx.doi.org/10.1007/s10479-015-1955-9
https://repositorio.unifesp.br/handle/11600/58254
identifier_str_mv Annals Of Operations Research. Dordrecht, v. 258, n. 2, p. 719-746, 2017.
10.1007/s10479-015-1955-9
0254-5330
WOS:000415728600023
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Annals Of Operations Research
Joint International Meeting of 17th Conference of the Association-of-Latin-Iberoamerican-Operational-Research-Societies / 3rd Annual Conference of the Mexican-Operations-Research-Society (SMIO)
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 719-746
dc.coverage.none.fl_str_mv Dordrecht
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:Repositório Institucional da UNIFESP
instname:Universidade Federal de São Paulo (UNIFESP)
instacron:UNIFESP
instname_str Universidade Federal de São Paulo (UNIFESP)
instacron_str UNIFESP
institution UNIFESP
reponame_str Repositório Institucional da UNIFESP
collection Repositório Institucional da UNIFESP
repository.name.fl_str_mv Repositório Institucional da UNIFESP - Universidade Federal de São Paulo (UNIFESP)
repository.mail.fl_str_mv biblioteca.csp@unifesp.br
_version_ 1814268420393271296