点击次数：
论文类型：期刊论文
发表时间：2015-02-01
发表刊物：APPLIED MATHEMATICAL MODELLING
收录刊物：SCIE、EI
卷号：39
期号：3-4
页面范围：1172-1182
ISSN号：0307-904X
关键字：Scheduling; Deteriorating jobs; Single machine; Precedence constraint
摘要：This paper deals with single machine scheduling problems with simple linear deterioration in which the processing time of a job is a simple linear function of its execution starting time. The objective is to determine the optimal schedule to minimize the weighted sum of the theta th (theta is a positive integer number) power of waiting times. It is proved that the general problem can be solved in polynomial time. In addition, for the jobs with weak (strong) parallel chains and a series-parallel digraph precedence constraints, it is also proved that these problems can be solved in polynomial time, respectively. (C) 2014 Elsevier Inc. All rights reserved.