Assembly sequence planning for a chip mounter using transportation algorithm

This paper proposes a sequence planning method to reduce the assembly time of gantry-type chip mounters with single head. We divide the overall path of the chip mounter into forward and backward path, and formulate the optimization problem as a transportation problem and an Euler´s tour problem. The transportation algorithm is applied to the formulated problem to find an optimal backward path, and then Euler´s tour algorithm is used to generate an assembly sequence. Simulation results are presented to verify the usefulness of the method