Job Shop 일정계획을 위한 혼합 유전 알고리즘 = A Hybrid Genetic Algorithm for Job Shop Scheduling

다국어 초록 (Multilingual Abstract)

The job shop scheduling problem is not only NP-hard, but is one of the well known hardest combinatorial optimization problems. The goal of this research is to develop an efficient scheduling method based on hybrid genetic algorithm to address job shop scheduling problem. In this scheduling method, generating method of initial population, new genetic operator, selection method are developed. The scheduling method based on genetic algorithm are tested on standard benchmark job shop scheduling problem. The results were compared with another genetic algorithm-based scheduling method. Compared to traditional genetic algorithm, the proposed approach yields significant improvement at a solution.