Hits:

Indexed by:期刊论文

Date of Publication:2016-05-01

Journal:NEURAL COMPUTING & APPLICATIONS

Included Journals:SCIE、EI、SSCI

Volume:27

Issue:4

Page Number:937-943

ISSN No.:0941-0643

Key Words:Scheduling; Delivery times; Learning effect; Single machine

Abstract: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.