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

Y. F. Wan, Ping Ji

Research output: Journal article publicationJournal articleAcademic researchpeer-review

16 Citations (Scopus)

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. Assembly, Electronics industry, Printed circuits, Computer programming
Original languageEnglish
Pages (from-to)236-240
Number of pages5
JournalAssembly Automation
Volume21
Issue number3
DOIs
Publication statusPublished - 1 Jan 2001

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Industrial and Manufacturing Engineering

Cite this