遺伝アルゴリズムを用いたラインバランシングに関する研究(遺伝的アルゴリズム)

概要

論文の詳細を見る
Line balancing problems are to solve the optimal allocation of operations to multiple workstations placed in a line. The optimal solution attains the minimum cycle-time by balancing the processing times on workstations. It is a kind of NP hard problem because the number of feasible solutions increases exponentially with the problem size, and the computational time to obtain the optimal solution increases with the same order by the conventional approaches. In this paper, a method that applies the genetic algorithm to line balancing problems is proposed. It is verified by computer simulation that the proposed method can obtain quasi-optimum solutions in a few minutes by using a workstation computer for the line balancing of NP hard problems which cannot be solved using ordinary methods.
社団法人日本オペレーションズ・リサーチ学会の論文
1994-10-11