A method of solving scheduling problems using an improved guided genetic algorithm
Gyouhi Ou, Hiroki Tamura, Koichi Tanno, Zheng Tang · Electronics and Communications in Japan · 2010
Abstract In this paper, an improved guided genetic algorithm is proposed for the job‐shop scheduling problem. The proposed method is improved by a genetic algorithm using multipliers which can be adjusted during the search process. Simulation results based on some benchmark problems demonstrate that the proposed method can find better solutions than the genetic algorithm and the original guided genetic algorithm. © 2010 Wiley Periodicals, Inc. Electron Comm Jpn, 93(8): 15–15, 2010; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/ecj.10263