集業型生産システムにおける組立工程編成問題の近似解法

概要

論文の詳細を見る
As a method to cope with multi-item small lot size production, assembling plants of small products are going to introduce the aggregative production system in which one machine or one worker assembles various products. When a process of this system is organized, a problem of simultaneous determination of the production sequence and parts layout is encountered to minimize the total sum of moving distances of parts in the process. This problem is called the assembly process formation problem, and discussed in this study. First, the problem is formulated as the non-linear 0-l integer programming problem. Then we propose two algorithms of the problem. One is based on the max-min method which is the algorithm of the quadratic assignment problem. The other is based on the tabu search method. Finally, we verify the effectiveness of the proposed approximate algorithm through some computational experiments.
東海大学の論文