Abstract: The minimum time that needs to execute a batch of tasks is called makespan.In general,when the number of tasks is less than that of parallel processors,it is profitable to partition in average each task T_i into p_i parts with some expansion factors and then execute all new parts by the devised parallel algorithm so as to obtain the execution time which is close to the makespan.The makespan of scheduling some tasks in the partitionable model is given.