A kind of immune genetic algorithm is introduced to dispose flexible Job-shop scheduling problem. The simulations show that the algorithm can effectively avoid the premature convergence problem caused by the high selective pressure. Moreover, it improves the ability of searching an optimum solution and increases the convergency speed. The algorithm should have extensive application prospect in many practical optimization problems.