Efficient task scheduling is critical for obtaining high performance in a heterogeneous computing environment. Although there are many scheduling algorithms already, they may not have good results, and take high cost. In this paper, a new list scheduling heuristics, named Accurate Priority Scheduling (APS), is presented. The APS selects task with random directed acyclic graph (DAG) and assigns tasks to processors with the insertion based scheduling policy to minimize the makespan. Compared with LMT, HEFT, CPOP based on, show the APS results good performances in most situations.