Journal
NEURAL COMPUTING & APPLICATIONS
Volume 27, Issue 4, Pages 937-943Publisher
SPRINGER LONDON LTD
DOI: 10.1007/s00521-015-1910-3
Keywords
Scheduling; Delivery times; Learning effect; Single machine
Categories
Funding
- 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]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available