Abstract: This paper presents two scheduling principles suitable to independent job scheduling in heterogeneous computing environment. A new algorithm named Priority Min-min (PMM) is presented, which computes jobs0 priorities based on their standard deviation of execution time. PMM chooses k jobs which have smaller earliest finish times, and assigns the job with the highest priority to the corresponding processor. This paper analyses how k influences the performance of PMM by experiment. PMM is more suitable for heteroge- neous processor platforms by surmounting the limitation of Min-min. The experimental data show that PMM reduces the makespan effectively and its performance is much better than Min-min.