Beam Search Algorithms for Minimizing Tool Switches on a Flexible Manufacturing System

dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-20T13:28:12Z
dc.date.available2014-05-20T13:28:12Z
dc.date.created2014-05-20T13:28:12Z
dc.date.issued2009-01-01
dc.identifierProceedings 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.identifierhttp://hdl.handle.net/11449/9362
dc.identifierWOS:000276629000008
dc.identifier1338008237590056
dc.identifier0000-0002-6544-2964
dc.description.abstractIn 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.languageeng
dc.publisherWorld Scientific and Engineering Acad and Soc
dc.relationProceedings of The 11th Wseas International Conference on Mathematical and Computational Methods In Science and Engineering (macmese '09)
dc.rightsAcesso restrito
dc.sourceWeb of Science
dc.subjectMinimization of tool switches
dc.subjectPartial ordering heuristics
dc.subjectBeam search
dc.subjectFlexible manufacturing systems
dc.subjectCombinatorial optimization
dc.titleBeam Search Algorithms for Minimizing Tool Switches on a Flexible Manufacturing System
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución