Highlights
•
We study a single machine scheduling problem where the objective is minimum total early work.
•
A job is penalized according to the duration of its early part.
•
We prove that the problem is NP-hard.
•
A pseudo-polynomial dynamic programming algorithm is introduced.
•
The DP algorithm can solve problems of hundreds of jobs in very reasonable time.