プリント板組立における手挿入最小化問題

概要

論文の詳細を見る
Many factories that produce printed circuit boards are positively introducing automatic inserters capable of inserting diverse types of parts in a short time intending to raise the factory productivity. But there are only rare cases where all parts can be automatically inserted with currently available techniques, and several parts have to be manually inserted in many cases. Therefore, a problem of selecting the types of parts that minimize the hand-work time is encountered in many printed circuit board factories. Thus, this study calls the problem the hand-work time minimizatin problem and proposes the optimization algorithm for it. First, this problem is formulated as a set covering problem (P), that is, a special type of 0-1 integer programming problem. Second, the optimization algorithm based on the row generation scheme of (P) is presented, and finally, its effectiveness is proved by numerical experimentation.
東海大学の論文