A genetic algorithm combined with local search is proposed to solve the FJSP with MAKESPAN criterion.A small percentage of elitist individuals are introduced into the initial population to fasten GA's convergence speed,efficient crossover and mutation operators are adopted to avoid infeasible solutions and to hasten the emergency of optimum solution.During the local search process,Logistic chaotic sequence is adopted to explore better neighborhood solutions around the best individual of the curr...