New answers tagged

0

I found an FPTAS for a very similar problem: finding a partition such that the largest sum is as small as possible. This problem is equivalent to the problem of identical-machines scheduling: there are $m$ identical machines (in our case $m=3$), and $n$ jobs with different processing times, and we need to assign jobs to machines such that the latest ...


Top 50 recent answers are included