A Type of Scheduling Problem on m General-Purpose Machinery and n Group Tasks with Uniform Processors

The Cmax problem on many-group jobs with m general-purpose machinery and n special-purpose machineries with the same speed was studied in this paper.This problem is always a NP-Hard problem,and an approximate method need to be found.An improved LPT algorithm and the upper bound performance are given.The ratio of the approximate solution and the best solution is(2m+1)/(m+1).