Alternative algorithms for identical machines scheduling to maximize total early work with a common due date

We study a scheduling problem with a given number of identical parallel machines, a common job due date and the total early work criterion, i.e., P m | d j = d | max { X } , which is known to be NP-hard. A new dynamic programming algorithm is proposed, which is more efficient than the existing exact approach for this problem. Based on the proposed dynamic programming, we further design two new fully polynomial time approximation schemes. The effectiveness and efficiency of the new exact and approximation approaches are validated in the computational experiments. • New dynamic programming algorithm with lower complexity is proposed for Pm | dj = d | max { X } . • Two new FPTASes are designed based on this algorithm. • Practical efficiency of the methods is validated in computational experiments.