Abstract
This paper considers a material constrained component scheduling problem during the high speed surface mount manufacturing stage in printed circuit board (PCB) assembly, where each piece of board contains an even number of identical PCBs. To accomplish the production, material requirements must be predetermined and incorporated as restraints into the scheduling problem, which has the objective of minimizing production completion time (makespan). A solution procedure is developed based on the following strategies: 1) Each machine is responsible for the same PCBs of each piece, 2) Components of the same types may use one or more feeder locations, 3) Component types are clustered based on their suitable placement speeds, 4) A heuristic using a bottom-up approach is applied to determine the component placement sequence and the feeder location assignment for all machines. Velocity estimate functions of the turret, XY table, and feeder carriage were derived based on empirical data. An experiment using Fuji CP732E machines was conducted on two real life instances. Experimental results indicate that our method performs 32.96% and 10.60% better than the Fuji-CP software for the two instances, in terms of the makespan per piece of board.
Highlights
In printed circuit board (PCB) assembly, surface mount technology (SMT) is extensively used to populate boards with electronic components
This paper considers a material constrained component scheduling problem during the high speed surface mount manufacturing stage in printed circuit board (PCB) assembly, where each piece of board contains an even number of identical PCBs
A solution procedure is developed based on the following strategies: 1) Each machine is responsible for the same PCBs of each piece, 2) Components of the same types may use one or more feeder locations, 3) Component types are clustered based on their suitable placement speeds, 4) A heuristic using a bottom-up approach is applied to determine the component placement sequence and the feeder location assignment for all machines
Summary
In printed circuit board (PCB) assembly, surface mount technology (SMT) is extensively used to populate boards with electronic components. This paper studies the component placement problem using turret style surface mount placement machines for PCBs; the problem becomes increasingly complicated when greater operational efficiency is required. This problem usually consists of the feeder location assignment (FLA), component placement sequence (CPS), and component retrieval problem (CRP) [2]. There have been many studies on the component placement problem using turret style surface mount machines. The global problem with one or more machines can be described as follows: Firstly, decide which component types should use feeder duplications; secondly, determine the feeder location assignment (FLA) and CPS for each machine. There is little difference in processing time between a PCB with forward FLA and a PCB with a backward FLA, but the time that the machine needs to move to the start position of the PCB needs to be counted
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
