Because of its implicit parallelism and global searching ability,Genetic Algorithm(GA) becomes the widely used Algorithm in resolving Job Shop Scheduling Problems(JSP).However,with JSP's specialty,the satisfying resolution can hardly receive from simple GA(SGA),of which the most obvious flaw is it always converges at a local extremum instead of the global one.This paper describes the optimization of GA,by way of improving the initialized population,reduce the selecting pressure and add SA operator into GA,t...
| 
推荐 
点击下列相关研究机构和相关文献作者，可以直接查到这些机构和作者被《中国知识资源总库》收录的其它文献，使您全面了解该机构和该作者的研究动态和历史。
