This paper implements a greedy tabu search algorithm to deal with the offline palletizing problem, and proposes a two-phase greedy tabu search algorithm. In the first phase, a greedy stochastic adaptive search algorithm is utilized to obtain the local optimal solution of the palletizing problem in the construction process and the local search process, which includes the residual space strategy and the combination of the cargo block strategy, as well as the optimization of the space utilization rate by using the tiling wall strategy. In the second stage, the local optimal solution obtained in the first stage is used as the initial solution, and the tabu search algorithm is used to record the history information of the solution through the tabu table to prevent the algorithm from falling into the local optimal solution, so as to dig deeper into the global optimal solution.