Cart (Loading....) | Create Account
Close category search window
 

Assembly sequence optimization of dispensers in SMT in-line 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

2 Author(s)
Ah-Reum Oh ; Dept. of Control & Instrum. Eng., Chung-Buk Nat. Univ., Cheongju, South Korea ; Tae-Hyoung Park

This paper proposes a path-planning algorithm for multi-head dispensers by heuristic algorithms to increase productivity in printed circuit board assembly lines. We analyze the assembly sequence of dispenser and formulate it as an integer-programming problem. The mathematical formulation can accommodate multiple heads and different types of heads through extended cost matrix. The TSP algorithms are then applied to the formulated problem to find the near-optimal solution. Simulation results are presented to verify the usefulness of the proposed scheme.

Published in:

SICE 2004 Annual Conference  (Volume:1 )

Date of Conference:

4-6 Aug. 2004

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.