点击次数：

论文类型：期刊论文

发表时间：2009-01-01

发表刊物：COMPUTERS & MATHEMATICS WITH APPLICATIONS

收录刊物：SCIE、EI、SSCI

卷号：57

期号：1

页面范围：9-16

ISSN号：0898-1221

关键字：Scheduling; Single machine; Learning effect; Setup times

摘要：In this paper we consider the single machine scheduling problem with exponential time-dependent learning effect and past-sequence-dependent (p-s-d) setup times. By the exponential time-dependent learning effect, we mean that the processing time of a job is defined by an exponent function of the total normal processing time of the already processed jobs. The setup times are proportional to the length 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. We show that the makespan minimization problem, the total completion time minimization problem and the SLIM of the quadratic job completion times minimization problem can be solved by the smallest (normal) processing time first (SPT) rule, respectively. We also show that the total weighted completion time minimization problem and the maximum lateness minimization problem can be solved in polynomial time under certain conditions. (c) 2008 Elsevier Ltd. All rights reserved.