Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 227, Issue 1, Pages 76-80Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2012.12.007
Keywords
Scheduling; Learning effect; Actual time-dependent; Job-dependent; NP-hard
Ask authors/readers for more resources
In this study, we introduce an actual time-dependent and job-dependent learning effect into single-machine scheduling problems. We show that the complexity results of the makespan minimization problem and the sum of weighted completion time minimization problem are all NP-hard. The complexity result of the maximum lateness minimization problem is NP-hard in the strong sense. We also provide three special cases which can be solved by polynomial time algorithms. (C) 2012 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available