By Topic

The optimization of printed circuit board assembly scheduling for a large parallel system

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)
Zhihong Jin ; Coll. of Transp. Manage., Dalian Maritime Univ., Dalian ; Ying Liu ; Shaoying Jing

This paper discusses the optimization of printed circuit board (PCB) assembly scheduling for a large parallel system, JUKI FX-1, which is known as the most complicated PCB assembly machines. This whole problem is formulated and divided into nozzle allocation, feeder arrangement and component placement sequence three sub-problems. By analyzing the characteristics of the solutions, three heuristic algorithms, cluster analysis, sequence traversal, and assignation of built-in pick-and-place set, for solving the three sub-problems are designed, respectively. Then they are organically integrated according to their internal interrelation. The integrated algorithm was implemented on real life problems, and contrastive results showed that the proposed scheduling algorithm is more efficient than the software built-in JUKI FX-1.

Published in:

Service Operations and Logistics, and Informatics, 2008. IEEE/SOLI 2008. IEEE International Conference on  (Volume:2 )

Date of Conference:

12-15 Oct. 2008