A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
In a classical scheduling problem, we are given a set of n jobs of unit length along with precedence constraints and the goal is to find a schedule of these jobs on m identical machines that minimizes the makespan. This problem is well-known to be NP-hard for an unbounded number of machines. Using standard 3-field notation, it is known as P|prec, p_j=1|C_max. We present an algorithm for this problem that runs in O(1.995^n) time. Before our work, even for m=3 machines the best known algorithmsarXiv:2208.02664v1 fatcat:eezcejx5wzhefijzppb7xr4nkq