To read this content please select one of the options below:

A tabu search heuristic for the component assignment problem in PCB assembly

Y.F. Wan (Research Student, Department of Manufacturing Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong.)
P. Ji (Associate Professor, Department of Manufacturing Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong.)

Assembly Automation

ISSN: 0144-5154

Article publication date: 1 September 2001

816

Abstract

Discusses the component assignment problem in PCB assembly, where assigning components to appropriate machines, in order to get a minimum assembly time for the assembly line, can be formulated as an integer linear programming model. In order to obtain the optimal solution to the component assignment problem, the branch‐and‐bound method can be applied. However, it is not efficient. Applies the tabu search heuristic to the component assignment problem. The procedure of the tabu search to the problem is presented, and a numerical example is provided. Finally, the performance of the tabu search is analyzed with the example.

Keywords

Citation

Wan, Y.F. and Ji, P. (2001), "A tabu search heuristic for the component assignment problem in PCB assembly", Assembly Automation, Vol. 21 No. 3, pp. 236-240. https://doi.org/10.1108/EUM0000000005619

Publisher

:

MCB UP Ltd

Copyright © 2001, MCB UP Limited

Related articles