PCB assembly sequence and feeder assignment problem for the case of Tchebyshev robot arm motion. I. Basic problem

This paper considers a basic problem in printed circuit board (PCB) assembly planning for the case of Tchebyshev robot arm motion in which it will be used for the other problems. In this problem, the assembly sequence is determined when feeder rack travel with infinite speed and the board is fixed. The problem is analyzed and converted into a shortest path problem of a corresponding interval graph that is proved to be NP-complete. Therefore, a heuristic procedure is developed based on network theory and interval graph. This heuristic is tested and found to give the closed optimal solution.