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

Author

Van Hop, Nguyen ; Tabucanon, M.T. ; Minh, Do Quang

Author_Institution

Fac. of Sci. & Technol., Assumption Univ., Bangkok, Thailand

Volume

2

fYear

2000

fDate

2000

Firstpage

919

Abstract

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

Keywords

assembly planning; computational complexity; industrial robots; optimisation; printed circuit manufacture; NP-complete; PCB assembly planning; PCB assembly sequence; Tchebyshev robot arm motion; closed optimal solution; dynamic pick and place; feeder assignment problem; feeder rack travel; fixed pick and place; heuristic procedure; infinite speed; interval graph; network theory; shortest path problem; Computer aided software engineering; Motion planning; Network theory (graphs); Path planning; Printed circuits; Robot kinematics; Robot motion; Robotic assembly; Shortest path problem; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Management of Innovation and Technology, 2000. ICMIT 2000. Proceedings of the 2000 IEEE International Conference on

Print_ISBN

0-7803-6652-2

Type

conf

DOI

10.1109/ICMIT.2000.916829

Filename

916829