Abstract In this thesis we propose a match_based scheduling algorithm for heterogeneous environment. The major difference of our algorithm from other researches is that it considers the variation of computing power with time. In our algorithm the each host is regarded as a group, their computing powers are sorted in ascending way and the ratio of each computing power with the total computing power is calculated. Similarly, the workload of tasks is classified and is sorted to the relative computing power in ascending way, then is assigned to one of host groups depending on the balance of computing power. The execution cost for each node of the task group is calculated from the task load and the computing power of host been assigned. In order to determine the priority of execution, the rank of each task is calculated from the total of the execution costs, maximum execution cost of its immediate successor, and the summation of ranks of all immediate successors. Experiment results show that the proposed algorithm has better performance than DLS (Dynamic Level Scheduling)[12], HNF (Heavy Node First)[6], WLA (Weighted Length Algorithm)[6] and DPS (Dynamic Priority Scheduling)[18], especially, for heterogeneous environment.