Abstract: To further improve the efficiency of workflow scheduling, a workflow scheduling algorithm in heterogeneous environment was studied, and a workflow scheduling algorithm based on critical path lookahead algorithm (CPLA) was proposed. In the task priority stage, the longest path of the entry task to the current task was considered, and the longest path of the current task to exit task was also taken into consideration. In the resource selection stage, the impact of tasks of the critical path and tasks of the non critical path on the scheduling results were considered. Two different types of DAGs which were randomly generated and from real-world were used to evaluate the performance of CPLA. The experimental results show that the CPLA can effectively shorten the scheduling length. The performances of this algorithm, such as efficiency, speedup, scheduling length ratio of algorithm are improved, and the time complexity of the algorithm is lower than that of the lookahead algorithm.