A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
Journal of the ACM
The problem of scheduling a set of n jobs on m identical machines so as to minimize the makespan time is perhaps the most well-studied problem in the theory of approximation algorithms for NP-hard optimization problems. In this paper the strongest possible type of result for this problem, a polynomial approximation scheme, is presented. More precisely, for each e, an algorithm that runs in time O((n/#"2) and has relative error at most c is given. In addition, more practical algorithms for c =doi:10.1145/7531.7535 fatcat:2au5ytqwvngkjiex4mqpcdpolm