Improved hybrid genetic algorithm for Job Shop problem

Job shop scheduling problem, due to its discrete, dynamic, multi-machine, multi-variables, constraining and other typical NP-hard resistance natures, is bound to play an important role in NP studies. This paper proposes a new improved genetic algorithm, the isolation niche algorithm and adaptive genetic algorithm, for the sake of improving quality of solutions. Based on numerous examples and data analysis, it is rather safe to conclude that the proposed hybrid genetic algorithm has significant advantages.