Flexible Job-Shop scheduling based on immune and simulated annealing

In order to research the different methods for the flexible Job-Shop scheduling (FJSS),adopted the immune principle and the simulated annealing principle to solve FJSS.Discussed the flexibility disposal and put forward accordingly two kinds of scheduling strategies.Analyzed the idea of algorithm hybrid and accordingly immune simulated annealing algorithm.Simulated several kinds of international FJSS Benchmark instances using different scheduling algorithms according to different scheduling strategies and contrasted and analyzed their results.The simulation experiments indicate that the scheduling model,scheduling strategies and scheduling algorithms are fit for FJSS.