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


Autoria(s): Senne, Edson Luiz França; Yanasse, Horacio Hideki; Jha, M; Long, C; Mastorakis, N; Bulucea, CA
Contribuinte(s)

Universidade Estadual Paulista (UNESP)

Data(s)

20/05/2014

20/05/2014

01/01/2009

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.

Formato

68-72

Identificador

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.

http://hdl.handle.net/11449/9362

WOS:000276629000008

Idioma(s)

eng

Publicador

World Scientific and Engineering Acad and Soc

Relação

Proceedings of The 11th Wseas International Conference on Mathematical and Computational Methods In Science and Engineering (macmese '09)

Direitos

closedAccess

Palavras-Chave #Minimization of tool switches #Partial ordering heuristics #Beam search #Flexible manufacturing systems #Combinatorial optimization
Tipo

info:eu-repo/semantics/article