An immune algorithm for scheduling problems of flow shop with finite intermediate storage

Production scheduling is an important component in enterprise's production process, and a rational and effective scheduling scheme especially is vital to improve the production efficiency and economic benefits of the batch plant. Has analyzed the particularity that it has, and put forward different restraint conditions, a new model of flow shop problems with finite intermediate storage has been set up. And a new approach is proposed, which combined with the characteristics of the immune algorithm. Simulation results show the effectiveness of the model and the feasibility of the algorithm.