Efficient Algorithms for High-Multiplicity Scheduling on Identical Machines

The authors present three tools to improve the running time of algorithms for solving high-multiplicity scheduling problems on identical machines, such as minimizing makespan (Cmax), minimizing minimum load (Cmin), and minimizing the difference between maximum and minimum load (Cenvy).