点击次数：
论文类型：期刊论文
发表时间：2011-09-01
发表刊物：JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
收录刊物：SCIE、EI、SSCI、Scopus
卷号：62
期号：9
页面范围：1765-1770
ISSN号：0160-5682
关键字：scheduling; single machine; deteriorating jobs; weighted sum of squared completion times
摘要：In this paper we consider a single machine scheduling problem with deteriorating jobs. By deteriorating jobs, we mean that the processing time of a job is a simple linear function of its execution starting time. For the jobs with chain precedence constraints, we prove that the weighted sum of squared completion times minimization problem with strong chains and weak chains can be solved in polynomial time, respectively. Journal of the Operational Research Society (2011) 62, 1765-1770. doi:10.1057/jors.2010.120 Published online 25 August 2010