Minimizing the maximum lateness in a single-machine scheduling problem with the normal time-dependent and job-dependent learning effect

We prove that the problem of single machine lateness minimization with a normal time-dependent and job-dependent learning effect in decision version is NP-complete.