Abstract: This paper is focusd on the study of scheduling problems of flow shop in the batch plant. Compared with the randomicity and uncertainty of immune algorithm, a hybrid method is proposed based on the feature of the branch and bound algorithm. Simulation results have shown not only the effectiveness of the algorithm, but also the high searching efficiency.