Article ID Journal Published Year Pages File Type
4630236 Applied Mathematics and Computation 2012 4 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Applied Mathematics
Preview
Minimizing the maximum lateness in a single-machine scheduling problem with the normal time-dependent and job-dependent learning effect
Authors
, , ,