Beam search algorithms for minimizing tool switches on a flexible manufacturing system

  • Authors:

  • Edson Luiz França Senne;Horacio Hideki Yanasse

  • Affiliations:

  • Department of Mathematics, São Paulo State University, Guaratinguetá, SP, Brazil;Laboratory for Computing and Applied Mathematics, National Institute for Space Research, SP, Brazil

  • Venue:
  • MACMESE'09 Proceedings of the 11th WSEAS international conference on Mathematical and computational methods in science and engineering
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.