Repository logo

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

Loading...
Thumbnail Image

Advisor

Coadvisor

Graduate program

Undergraduate course

Journal Title

Journal ISSN

Volume Title

Publisher

Type

Work presented at event

Access right

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.

Description

Language

English

Citation

Proceedings of the 11th WSEAS International Conference on Mathematical and Computational Methods in Science and Engineering, MACMESE '09, p. 68-72.

Related itens

Sponsors

Units

Undergraduate courses

Graduate programs

Other forms of access