点击次数：
论文类型：期刊论文
发表时间：2011-03-01
发表刊物：JOURNAL OF SYSTEMS SCIENCE AND SYSTEMS ENGINEERING
收录刊物：Scopus、SCIE、EI、CSCD
卷号：20
期号：1
页面范围：119-125
ISSN号：1004-3756
关键字：Scheduling; single machine; learning effect; makespan; total completion time
摘要：This paper deals with single-machine scheduling problems with a more general learning effect based on sum-of-processing-time. In this study, sum-of-processing-time-based learning effect means that the processing time of a job is defined by a decreasing function of the total normal processing time of jobs that come before it in the sequence. Results show that even with the introduction of the sum-of-processing-time-based learning effect to job processing times, single-machine makespan minimization problems remain polynomially solvable. The curves of the optimal schedule of a total completion time minimization problem are V-shaped with respect to job normal processing times.