A New Genetic Coding for Job Shop Scheduling Problem Considering Geno Type and Pheno Type

摘要

Job shop scheduling problem is one of the most important problems in the combinatorial optimization problems, and it is applied to various fields about engineering. Many works have been reported for this problem using Genetic Algorithm (GA). The GA is one of the most powerful optimization methods based on the mechanics of natural evolution. In this paper, we propose a new genetic coding for the job shop scheduling problem. The proposed genetic coding improves the search performance while keeping the run time in comparison with the conventional one. Simulation results using benchmark data prove the validity of the proposed genetic coding comparison with the conventional one.