| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To provide a method for placing conveyed objects that is efficient in repeating the process of placing, on S tables arranged at predetermined intervals, 1 to M conveyed objects at intervals of N or more tables to fill empty tables. <P>SOLUTION: The number S of tables is set at äM×(N+1)}+1 or larger. In the decision of the order of tables where conveyed objects are placed, the S tables are numbered from 1 to S in a conveyance direction, and tables are selected at intervals of N or higher minimums from a loop permutation where the first to Sth tables are counted in the order and the first table is recounted after the Sth table. Conveyed objects are transferred to the selected tables. <P>COPYRIGHT: (C)2007,JPO&INPIT</p> |
