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.展开更多
基金This Project was 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.