Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4630236 | Applied Mathematics and Computation | 2012 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Zhongyi Jiang, Fangfang Chen, Chunqing Wu,