点击次数：

论文类型：期刊论文

发表时间：2010-08-01

发表刊物：ICIC Express Letters

收录刊物：EI、Scopus

卷号：4

期号：4

页面范围：1345-1350

ISSN号：1881803X

摘要：In this paper we introduce a new scheduling model with an exponential sum-cf-processing-time based learning effect in which the actual processing time of a job is defined by an exponential function of the total normal processing time of the already processed jobs. We show that even with the introduction of the new learning effect to job processing times, single machine problems to minimize makespan and the sum of the 9th power of the completion times remain polynomially solvable. In addition, we show that the problems to minimize total weighted completion time and maximum lateness are polynomially solvable under certain agreeable conditions. ICIC International ? 2010 ISSN 1881-803X.