Assembly time minimization for an electronic component placement machine

In this study, a new algorithm component placement machine is proposed. Also, a pairwise exchange procedure is designed and applied after the proposed algorithm. In the analyzed machine, previously proposed algorithms were mounting the components from lightest to heaviest where we propose to mount the components from heaviest to lightest. This method brings new opportunities in terms of performance gain on typical Printed Circuit Boards produced in the industry. The new algorithm is compared with former approaches on synthetically generated instances. It outperforms the former approaches by 1.54 percent on printed circuit boards with 100 components to be placed. It gives better results in 90 out of 100 instances. Applying the designed pairwise exchange procedure after the proposed algorithm further improves the total assembly time. Moreover, by taking advantage of inherent design of the analyzed PCBs, other promising improvement procedures are also suggested for minimizing total asscmbly time. By applying all the suggested techniques to the problem instances, performance improvement rate reaches up to 4.5 percent when compared with previous studies. Since the architecture and working principles of widely used new technology placement machines are very similar to the one analyzed here, the improvement techniques developed here can easily be generalized to them