点击次数：

发布时间：2019-03-11

论文类型：会议论文

发表时间：2010-07-01

收录刊物：Scopus、EI

卷号：6

期号：7

页面范围：3265-3274

摘要：In this paper, we consider the scheduling problems with exponential learning effect. By the exponential learning effect, we mean that the processing time of a job is defined by an exponent function of the sum of the normal processing times of the already processed jobs. We consider the following objective functions: the makespan, the total completion time, the sum of the quadratic job completion times, the total weighted completion time and the maximum lateness. For some special single machine problems and flow shop problems, we show that the problems can be solved in polynomial time. ICIC International ? 2010 ISSN 1349-4198.