点击次数：
论文类型：期刊论文
发表时间：2013-04-01
发表刊物：APPLIED MATHEMATICAL MODELLING
收录刊物：SCIE、EI
卷号：37
期号：7
页面范围：4905-4914
ISSN号：0307-904X
关键字：Scheduling; Single machine; Learning effect; Deteriorating jobs; Setup times
摘要：In this paper we consider the single-machine setup times scheduling with general effects of deterioration and learning. By the general effects of deterioration and learning, we mean that the actual job processing time is a general function of the processing times of the jobs already processed and its scheduled position. The setup times are proportional to the length of the already processed jobs, i.e., the setup times are past-sequence-dependent (p-s-d). We show that the problems to minimize the makespan, the sum of the delta th (delta > 0) power of job completion times, the total lateness are polynomially solvable. We also show that the total weighted completion time minimization problem, the discounted total weighted completion time minimization problem, the maximum lateness (tardiness) minimization problem, the total tardiness minimization problem can be solved in polynomial time under certain conditions. (C) 2012 Elsevier Inc. All rights reserved.