By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Nguyen Van Hop ; Fac. of Sci. & Technol., Assumption Univ., Bangkok, Thailand ; Tabucanon, M.T. ; Do Quang Minh

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

Published in:

Management of Innovation and Technology, 2000. ICMIT 2000. Proceedings of the 2000 IEEE International Conference on  (Volume:2 )

Date of Conference: