To avoid pre-maturity and local constringency of traditional genetic algorithm, an improved bee algorithm-genetic algorithm(BAGA) was proposed, based on the stronger local searching capability. The proposed algorithm employed the strategy of calling artificial bees colony algorithm to avoid the local constringency when genetic algorithm’s evolution was stopped, so as to advance the searching speed and shorten the searching time. At the same time, in order to keep the biodiversity, the iteration adjustment threshold was introduced. Finally, simulation examples of typical job-shop schedule problem (JSP) show that the proposed algorithm can avoid pre-maturity and advance the constringency.
