Abstract: A batch scheduling model of assembly job shop with minimum makespan is established. The genetic algorithm is used to construct a solution algorithm based on the overall optimization strategy, hierarchical iterative optimization strategy and bilevel evolution strategy. The difference between them is the optimization mechanisms to deal with the batch division problem and the sub-batch scheduling problem. Finally, through the simulation experiment, the solution effect and convergence speed of several kinds of algorithms are compared, and adaptability are also analyzed.