Optimisation of multiple head SMT placement machine, model and approaches

摘要

In order to maximize the throughput rate of single multiple head surface mounted technology placement machine, the time taken for pick-and-place of components for each printed circuit board has to be minimized. This gives rise to two related essential problems, namely feeder assignment problem and pick-and-place sequence determination problem. In this paper, we introduce a model that simplifies problems. We regard all components during a pick-and-place cycle as a unit and give it a matching weight. In this way, we change multiple head machine problems into single head machine problems. The optimisation problem becomes two sub-problems: minimum weight matching problem and travelling salesman problem of these units. We presented algorithms to obtain near optimal solution and implement them as a computer program. We performed experiment on a real four head placement machine. The experimental results are presented to analyse their performance.