PCB assembly line assignment: a genetic algorithm approach

Abstract

Purpose

This paper sets out to study a production‐planning problem for printed circuit board (PCB) assembly. A PCB assembly company may have a number of assembly lines for production of several product types in large volume.

Design/methodology/approach

Pure integer linear programming models are formulated for assigning the product types to assembly lines, which is the line assignment problem, with the objective of minimizing the total production cost. In this approach, unrealistic assignment, which was suffered by previous researchers, is avoided by incorporating several constraints into the model. In this paper, a genetic algorithm is developed to solve the line assignment problem.

Findings

The procedure of the genetic algorithm to the problem and a numerical example for illustrating the models are provided. It is also proved that the algorithm is effective and efficient in dealing with the problem.

Originality/value

This paper studies the line assignment problem arising in a PCB manufacturing company in which the production volume is high.

Citation

Ho, W. and Ji, P. (2005), "PCB assembly line assignment: a genetic algorithm approach", Journal of Manufacturing Technology Management, Vol. 16 No. 6, pp. 682-692. https://doi.org/10.1108/17410380510609519