期刊
NEURAL COMPUTING & APPLICATIONS
卷 27, 期 4, 页码 937-943出版社
SPRINGER LONDON LTD
DOI: 10.1007/s00521-015-1910-3
关键词
Scheduling; Delivery times; Learning effect; Single machine
资金
- Science Research Foundation of Shenyang Aerospace University [201304Y]
- National Natural Science Foundation of China [71471120, 71271039]
- New Century Excellent Talents in University [NCET-13-0082]
- Changjiang Scholars and Innovative Research Team in University [IRT1214]
The single-machine scheduling problem with truncated sum-of-processing-times-based learning effect and past-sequence-dependent job delivery times is considered. Each job's delivery time depends on its waiting time of processing. For some regular objective functions, it is proved that the problems can be solved by the smallest processing time first rule. For some special cases of the total weighted completion time and the maximum lateness objective functions, the thesis shows that the problems can be solved in polynomial time.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据