The discrete imperialist competitive algorithm is presented to solve the optimization scheduling problem of automated warehouse, when it is in the batch processing of orders. Outbound order priority scheduling and compound orders scheduling have been built and are solved by using discrete imperialist competitive algorithm(ICA). Finally, several examples are given and the computational results show that the presented approach can obtain a better optimal solution and has advantages in dealing with large quantities of orders scheduling.