点击次数：
论文类型：期刊论文
发表时间：2009-11-01
发表刊物：INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
收录刊物：SCIE、EI、Scopus
卷号：45
期号：3-4
页面范围：336-340
ISSN号：0268-3768
关键字：Scheduling; Single-machine; Learning effect; Deteriorating jobs; Makespan
摘要：The paper deals with the single-machine scheduling problem with a sum-of-processing-time- based learning effect and deteriorating jobs. By the effects of sum-of-processing-time-based learning and deterioration, we mean that the processing time of a job is defined by function of its starting time and total normal processing time of jobs in front of it in the sequence. It is shown that, even with the introduction of the effects of sum-of-processing-time-based learning and deterioration to job processing times, the single-machine makespan minimization problem remains polynomially solvable.