| 摘要 |
PURPOSE:To enable cassettes to be arranged efficiently by a method wherein the types of components longest in a mean mounting time (total sum of XY table moving time along shortest path/total number of components of type) are selected in the shortest path. CONSTITUTION:A computing section 11 reads out data from a component data recording section 7 where the mounting positions of components and the like are recorded and obtains the shortest path for each component, and the shortest path of each component is inputted into a shortest path record 8. Then, the type A of components maximal in a mean mounting time is selected, and when a large number of the other types B and C of components are located in this region, that these cassettes are arranged adjacent to each other is determined, which is inputted into a cassette pair record 9. Excluding the component types A, B, and C, a component D maximal in a mean mounting time is selected, and when many of types E and F of components are located in this region, the types D, E, and F of components are inputted into a cassette 10. When a cassette arrangement is determined, a component mounting sequence is determined. By this setup, a component mounting time is lessened. |
