摘要

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.

全文