A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We consider the problem of scheduling of n independent jobs on m unrelated machines to minimize the max(t 1, t2, ..., tm), ti being the completion time of machine i. In  was suggested a polynomial 2approximation algorithm for this problem. It was also proved that there can exist no polynomial 1.5-approximation algorithm unless P = NP . Here we improve this earlier performance bound 2 to 2 − 1 m . In  is also proved a general rounding theorem, which allows to construct in polynomial timedoi:10.1007/3-540-44929-9_10 fatcat:xjm2bsuybvbmzcoa5rbqhsxhgm