期刊
DISCRETE OPTIMIZATION
卷 19, 期 -, 页码 1-11出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.disopt.2015.11.002
关键词
Job scheduling; Learning effect; Forgetting effect; Single-machine problems
资金
- [NSC 100-2221-E-035-029-MY3]
- [NSC 102-2221-E-241-018]
In this paper, a generalized model with past-sequence-dependent learning and forgetting effects is proposed. Both effects are assumed to be dependent on the sum of processing time as well as the scheduling position. Based on this model, we investigate and prove that some single-machine problems remain polynomially solvable with certain agreeable conditions. We further show that many models known in the literature are special cases of our proposed model. Several helpful lemmas are presented to analyze single-machine scheduling problems with various objective functions: makespan, total completion time, weighted completion time, and maximum lateness. (C) 2015 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据