|
系统工程理论与实践 2004
An Encoding Method Based on Active Schedule and Its Application to JSP
|
Abstract:
Based on describing the Job-shop scheduling problem concretely, various of common encoding methods are analyzed and a new encoding method is presented in this paper. This encoding method combines with the active schedule constructing steps and gene's order denotes priority dispatching sequence. Therefore, the feasible schedules are found. Because this encoding puts natural number into code, the genetic operators are similar to TSP, thus the illegal schemes are avoided. During the course of solving the Job-shop scheduling problem with Genetic Algorithm, this encoding not only can satisfy the characteristic of the Job-shop scheduling problem, but also can manifest the high ability of global optimization of Genetic Algorithm. The simulation results show that this algorithm is effective and efficient.