Semi-on-line parallel machines scheduling under known total and largest processing times

We consider the semi-on-line parallel machines scheduling problem with the known total and the largest processing times of all jobs. We develop an approximation algorithm for the problem and prove that the competitive ratio of the algorithm is not more than root 10/3 approximate to 1.8257, regardless of the number of machines.X115sciescopu