期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 227, 期 1, 页码 76-80出版社
ELSEVIER
DOI: 10.1016/j.ejor.2012.12.007
关键词
Scheduling; Learning effect; Actual time-dependent; Job-dependent; NP-hard
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据