点击次数：
论文类型：期刊论文
发表时间：2016-05-01
发表刊物：NEURAL COMPUTING & APPLICATIONS
收录刊物：SCIE、EI、SSCI
卷号：27
期号：4
页面范围：937-943
ISSN号：0941-0643
关键字：Scheduling; Delivery times; Learning effect; Single machine
摘要：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.