In the cooperative concurrent computing on a workstation cluster system, task scheduling determines the performance in large degree. This paper gives a model and an algorithm of task scheduling, in which the costs of synchronization, communication, loading data and collecting results are considered. Using this scheduling model, a group of workstations with the shortest executing time of jobs can be selected to obtain better performance of parallel computing.