Application on job-shop scheduling with Genetic Algorithm based on the mixed strategy

Abstract

Adaptive Genetic Algorithm for solving job-shop scheduling problems has the defects of the slow convergence speed on the early stage and it is easy to trap into local optimal solutions, this paper introduces a time operator depending on the time evolution to solve this problem. Its purpose is to overcome the defect of adaptive Genetic Algorithm whose… (More)

1 Figure or Table

Cite this paper

@article{Xu2009ApplicationOJ, title={Application on job-shop scheduling with Genetic Algorithm based on the mixed strategy}, author={Liang Xu and Wang Shuang and Huang Ming}, journal={2009 Chinese Control and Decision Conference}, year={2009}, pages={2007-2009} }