dc.contributor | Universidade Estadual Paulista (Unesp) | |
dc.date.accessioned | 2014-05-20T13:28:12Z | |
dc.date.available | 2014-05-20T13:28:12Z | |
dc.date.created | 2014-05-20T13:28:12Z | |
dc.date.issued | 2009-01-01 | |
dc.identifier | Proceedings of The 11th Wseas International Conference on Mathematical and Computational Methods In Science and Engineering (macmese '09). Athens: World Scientific and Engineering Acad and Soc, p. 68-72, 2009. | |
dc.identifier | http://hdl.handle.net/11449/9362 | |
dc.identifier | WOS:000276629000008 | |
dc.identifier | 1338008237590056 | |
dc.identifier | 0000-0002-6544-2964 | |
dc.description.abstract | 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. | |
dc.language | eng | |
dc.publisher | World Scientific and Engineering Acad and Soc | |
dc.relation | Proceedings of The 11th Wseas International Conference on Mathematical and Computational Methods In Science and Engineering (macmese '09) | |
dc.rights | Acesso restrito | |
dc.source | Web of Science | |
dc.subject | Minimization of tool switches | |
dc.subject | Partial ordering heuristics | |
dc.subject | Beam search | |
dc.subject | Flexible manufacturing systems | |
dc.subject | Combinatorial optimization | |
dc.title | Beam Search Algorithms for Minimizing Tool Switches on a Flexible Manufacturing System | |
dc.type | Artículos de revistas | |