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.
One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage All Access membership.
Explore Editage All AccessPublished in last 50 years