The table of Section 3 as a word RAM approximation scheme. Read the instance and the accuracy $e$ (in the place of the threshold), sort the jobs by start time, build the sorted arrays (as in the exact program), zero the weight of every unfit job, take $k = max 1 (w_max' / (e n))$, replace every weight $w ≥ 1$ by $(w - 1)/k + 1$, set the threshold $W = 2 e n²$, run the exact table program of Theorem 2 ($D2Core.core2$, unchanged) on the rescaled weights, scan the finished column of the first $m$ indices for the last non-zero cell $W'$ (for no job or no machine, $W' = 0$), and write $k (W' - n)$ if $k > 1$ and $W'$ otherwise ($F5Math.fptasOut$). The cost is that of the exact program with threshold $2 e n²$, that is $O((n+1)² (e+1) (n+1)^m)$, plus the sort; the guarantee is $F5Math.fptas_value$.