This paper analyzes optimization algorithms of assembly time for a multi-head mounter.The algorithm in this paper is composed of four steps.First,it assigns the components to feeders based on the"one-to-many mapp...This paper analyzes optimization algorithms of assembly time for a multi-head mounter.The algorithm in this paper is composed of four steps.First,it assigns the components to feeders based on the"one-to-many mapping".Secondly,it assigns nozzles to heads by making full use of the"on-the-fly nozzle change"heads.Thirdly,it Qrganizes the feeder groups so that the heads can pick and place components group by group.Finally,it assigns feeder groups to slots.The result demonstrates that the algorithm has good performance in practice.展开更多
For a surface mounting machine (SMM) in printed circuit board (PCB) assembly line, there are four problems, e.g. CAD data conversion, nozzle selection, feeder assignment and placement sequence determination. A hierarc...For a surface mounting machine (SMM) in printed circuit board (PCB) assembly line, there are four problems, e.g. CAD data conversion, nozzle selection, feeder assignment and placement sequence determination. A hierarchical planning for them to maximize the throughput rate of an SMM is presented here. To minimize set-up time, a CAD data conversion system was first applied that could automatically generate the data for machine placement from CAD design data files. Then an effective nozzle selection approach was implemented to minimize the time of nozzle changing. And then, to minimize picking time, an algorithm for feeder assignment was used to make picking multiple components simultaneously as much as possible. Finally, in order to shorten pick-and-place time, a heuristic algorithm was used to determine optimal component placement sequence according to the decided feeder positions. Experiments were conducted on a four head SMM. The experimental results were used to analyse the assembly line performance.展开更多
基金supported by the special invite public bidding project of Key Equipment of Precision Manufacture of Guangdong Province of China(No.20041A01).
文摘This paper analyzes optimization algorithms of assembly time for a multi-head mounter.The algorithm in this paper is composed of four steps.First,it assigns the components to feeders based on the"one-to-many mapping".Secondly,it assigns nozzles to heads by making full use of the"on-the-fly nozzle change"heads.Thirdly,it Qrganizes the feeder groups so that the heads can pick and place components group by group.Finally,it assigns feeder groups to slots.The result demonstrates that the algorithm has good performance in practice.
文摘For a surface mounting machine (SMM) in printed circuit board (PCB) assembly line, there are four problems, e.g. CAD data conversion, nozzle selection, feeder assignment and placement sequence determination. A hierarchical planning for them to maximize the throughput rate of an SMM is presented here. To minimize set-up time, a CAD data conversion system was first applied that could automatically generate the data for machine placement from CAD design data files. Then an effective nozzle selection approach was implemented to minimize the time of nozzle changing. And then, to minimize picking time, an algorithm for feeder assignment was used to make picking multiple components simultaneously as much as possible. Finally, in order to shorten pick-and-place time, a heuristic algorithm was used to determine optimal component placement sequence according to the decided feeder positions. Experiments were conducted on a four head SMM. The experimental results were used to analyse the assembly line performance.
