Beam search algorithms for minimizing tool switches on a flexible manufacturing system
Autor(a) principal: | |
---|---|
Data de Publicação: | 2009 |
Outros Autores: | |
Tipo de documento: | Artigo de conferência |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://hdl.handle.net/11449/226108 |
Resumo: | In the minimization of tool switches problem we seek a sequence to process a set of jobs so that the number of tool switches required is minimized. In this work different variations of a heuristic based on partial ordered job sequences are implemented and evaluated. All variations adopt a depth first strategy of the enumeration tree. The computational test results indicate that good results can be obtained by a variation which keeps the best three branches at each node of the enumeration tree, and randomly choose, among all active nodes, the next node to branch when backtracking. |
id |
UNSP_4ea2cac886a5b97b5d699371009937f2 |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/226108 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
Beam search algorithms for minimizing tool switches on a flexible manufacturing systemBeam searchCombinatorial optimizationFlexible manufacturing systemsMinimization of tool switchesPartial ordering heuristicsIn the minimization of tool switches problem we seek a sequence to process a set of jobs so that the number of tool switches required is minimized. In this work different variations of a heuristic based on partial ordered job sequences are implemented and evaluated. All variations adopt a depth first strategy of the enumeration tree. The computational test results indicate that good results can be obtained by a variation which keeps the best three branches at each node of the enumeration tree, and randomly choose, among all active nodes, the next node to branch when backtracking.Department of Mathematics São Paulo State University (UNESP), Av. Dr. Ariberto Pereira da Cunha 333, 12516-410 - Guaratinguetá, SPLaboratory for Computing and Applied Mathematics National Institute for Space Research (INPE), Av. dos Astronautas 1758, 12227-010 - São José dos Campos, SPDepartment of Mathematics São Paulo State University (UNESP), Av. Dr. Ariberto Pereira da Cunha 333, 12516-410 - Guaratinguetá, SPUniversidade Estadual Paulista (UNESP)National Institute for Space Research (INPE)Senne, Edson Luiz França [UNESP]Yanasse, Horacio Hideki2022-04-28T21:25:30Z2022-04-28T21:25:30Z2009-12-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject68-72Proceedings of the 11th WSEAS International Conference on Mathematical and Computational Methods in Science and Engineering, MACMESE '09, p. 68-72.http://hdl.handle.net/11449/2261082-s2.0-78149315370Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengProceedings of the 11th WSEAS International Conference on Mathematical and Computational Methods in Science and Engineering, MACMESE '09info:eu-repo/semantics/openAccess2024-07-02T14:29:47Zoai:repositorio.unesp.br:11449/226108Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T14:10:16.928496Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
Beam search algorithms for minimizing tool switches on a flexible manufacturing system |
title |
Beam search algorithms for minimizing tool switches on a flexible manufacturing system |
spellingShingle |
Beam search algorithms for minimizing tool switches on a flexible manufacturing system Senne, Edson Luiz França [UNESP] Beam search Combinatorial optimization Flexible manufacturing systems Minimization of tool switches Partial ordering heuristics |
title_short |
Beam search algorithms for minimizing tool switches on a flexible manufacturing system |
title_full |
Beam search algorithms for minimizing tool switches on a flexible manufacturing system |
title_fullStr |
Beam search algorithms for minimizing tool switches on a flexible manufacturing system |
title_full_unstemmed |
Beam search algorithms for minimizing tool switches on a flexible manufacturing system |
title_sort |
Beam search algorithms for minimizing tool switches on a flexible manufacturing system |
author |
Senne, Edson Luiz França [UNESP] |
author_facet |
Senne, Edson Luiz França [UNESP] Yanasse, Horacio Hideki |
author_role |
author |
author2 |
Yanasse, Horacio Hideki |
author2_role |
author |
dc.contributor.none.fl_str_mv |
Universidade Estadual Paulista (UNESP) National Institute for Space Research (INPE) |
dc.contributor.author.fl_str_mv |
Senne, Edson Luiz França [UNESP] Yanasse, Horacio Hideki |
dc.subject.por.fl_str_mv |
Beam search Combinatorial optimization Flexible manufacturing systems Minimization of tool switches Partial ordering heuristics |
topic |
Beam search Combinatorial optimization Flexible manufacturing systems Minimization of tool switches Partial ordering heuristics |
description |
In the minimization of tool switches problem we seek a sequence to process a set of jobs so that the number of tool switches required is minimized. In this work different variations of a heuristic based on partial ordered job sequences are implemented and evaluated. All variations adopt a depth first strategy of the enumeration tree. The computational test results indicate that good results can be obtained by a variation which keeps the best three branches at each node of the enumeration tree, and randomly choose, among all active nodes, the next node to branch when backtracking. |
publishDate |
2009 |
dc.date.none.fl_str_mv |
2009-12-01 2022-04-28T21:25:30Z 2022-04-28T21:25:30Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/conferenceObject |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
Proceedings of the 11th WSEAS International Conference on Mathematical and Computational Methods in Science and Engineering, MACMESE '09, p. 68-72. http://hdl.handle.net/11449/226108 2-s2.0-78149315370 |
identifier_str_mv |
Proceedings of the 11th WSEAS International Conference on Mathematical and Computational Methods in Science and Engineering, MACMESE '09, p. 68-72. 2-s2.0-78149315370 |
url |
http://hdl.handle.net/11449/226108 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Proceedings of the 11th WSEAS International Conference on Mathematical and Computational Methods in Science and Engineering, MACMESE '09 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
68-72 |
dc.source.none.fl_str_mv |
Scopus reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1808128328040710144 |