This paper studies the co-scheduling problem of the stackers and single rail guided vehicle system in automated storage and retrieval systems. We formulate the problem into a mixed integer linear programming model with the aim of minimizing the total retrieval time. In order to solve the problem, an improved genetic algorithm is proposed, and the properties of the optimal solution are applied to improve the offspring chromosomes. A lower bound of the total retrieval time is developed. The numerical experiment indicates that the proposed algorithm can solve the problem effectively. Compared with the solutions obtained by using first come first served, the total retrieval time obtained by the proposed algorithm is reduced by an average of 8.36%. The average deviation from the lower bound is 2.00%.