Abstract
This paper considers the problem of minimizing the assembly time of multi-head surface mounting machines. The problem is decomposed into a hierarchy of related subproblems. Since all subproblems in the hierarchy are known to be of a combinatorial nature and computationally intractable, we develop heuristics which are based on dynamic programming and the nearest neighbor traveling salesman problem technique. We implement the method as a computer program and perform computer simulations. The results are compared to a heuristic that is currently in use.
| Original language | English |
|---|---|
| Pages (from-to) | 2110-2115 |
| Number of pages | 6 |
| Journal | Proceedings - IEEE International Conference on Robotics and Automation |
| Volume | 3 |
| State | Published - 1999 |
| Event | Proceedings of the 1999 IEEE International Conference on Robotics and Automation, ICRA99 - Detroit, MI, USA Duration: 10 May 1999 → 15 May 1999 |