Abstract: This paper presents a new algorithm called both matched(BM) algorithm which is suitable to independent job scheduling on heterogeneous processor platforms.BM algorithm achieves both match between jobs and processes.Most jobs are scheduled to those processes in which the jobs have both minimum execution time(MET) and earliest finish time(EFT).If both match can not be realized,a job with earliest finish time will be scheduled first.BM algorithm succeeds in load balancing and high throughput.Min-min algorithm is usually used as the benchmark of scheduling algorithms.The experiment data of comparing BM with Min-min algorithms show that the running time of BM algorithm is much less than Min-min algorithm and the makespan of BM algorithm is less than Min-min algorithm by 9%.