We propose a multi-objective optimization algorithm for cloud task scheduling based on the Analytic network process(ANP) model to solve the problems in cloud task scheduling,such as the deficiencies of mathematical description,limited optimization abilities of the traditional multi-objective optimization algorithm and the selection of the Pareto optimal solutions.Firstly,we present the mathematical description of cloud task scheduling using matrix theory.Then,the improved Nondominated sorting genetic algorithm II(NSGA-II) multiobjective evolutionary algorithm whose optimization ability is improved by Gene expression programming(GEP)algorithm has been introduced into the cloud task scheduling field to search the Pareto set among multi-objects.Finally,ANP model has been combined with the improved NSGA-II to solve the selection problems of Pareto solutions.Comparing with the multi-objective optimization algorithm based on the weighted polynomial,the proposed algorithm can optimize multiple goals at the same time,and can avoid the additional iterations due to the change of users preferences effectively.The simulation results indicate that the proposed algorithm is effective. We propose a multi-objective optimization algorithm for cloud task scheduling based on the Analytic Network Process (ANP) model such as the deficiencies of cloud task scheduling, such as the deficiencies of mathematical description, limited optimization abilities of the traditional multi-objective optimization algorithm and the selection of the Pareto optimal solutions. Firstly, we present the mathematical description of cloud task scheduling using matrix theory. Chen, the improved Nondominated sorting genetic algorithm II (NSGA-II) multiobjective evolutionary algorithm whose optimization ability is improved by Gene expression programming (GEP) algorithm has been introduced into the cloud task scheduling field to search the Pareto set among multi-objects. Finally, ANP model has been combined with the improved NSGA-II to solve the selection problems of Pareto solutions. Comparing with the multi- objective optimization algorithm based on the weighted polynomial, the proposed algorithm can optimize multipl e goals at the same time, and can avoid the additional iterations due to the change of users preferences effectively. The simulation results indicate that the proposed algorithm is effective.