A beam-search-based algorithm for the tool switching problem on a flexible machine

The tool switching problem is used to determine a job sequence and the tools to be loaded on a machine with the objective of minimising the total number of tool switches. In this paper, in order to develop a practical and efficient approach to solving this problem, a beam-search-based algorithm is i...

Full description

Saved in:
Bibliographic Details
Published in:International journal of advanced manufacturing technology 2005-05, Vol.25 (9-10), p.876-882
Main Authors: Zhou, Bing-Hai, Xi, Li-Feng, Cao, Yong-Shang
Format: Article
Language:English
Subjects:
Algorithms
Heuristic methods
Production scheduling
Searching
Solution space
Switches
Switching
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The tool switching problem is used to determine a job sequence and the tools to be loaded on a machine with the objective of minimising the total number of tool switches. In this paper, in order to develop a practical and efficient approach to solving this problem, a beam-search-based algorithm is introduced to formulate the solution space of the problem. The performance of the heuristic algorithm is compared with the heuristic developed by Bard. The proposed algorithm is then tested on some random test problems. The results show that the beam-search-based algorithm performs well in terms of computational efficiency and solution quality.
ISSN:0268-3768
1433-3015
DOI:10.1007/s00170-003-1925-2