유전알고리즘을 이용한 셀형 제조에서의 그룹일정계획

초록

Cellular manufacturing is one of the major applications of group technology philosophy and is an important form of modern production. This rearch address the problem of group and job sequencing with groups of part families which have already been identified by some method of classfication. The sequencing problem is an NP-hard combinatorial optimization problem. Consequently, there has been an increasing trend toward research which focuses on developing efficient and effective heuristic algorithms to provide a near-optimal solution within a reasonable or economical time. For obtaining a good suboptimal solution, the genetic algorithm(GA) is applied to this problem. GA is a new method to solve combinatorial optimization problems by simulating the process compared with the existing algorithm and results are reported.