点击次数：
论文类型：期刊论文
发表时间：2011-10-01
发表刊物：JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
收录刊物：SCIE、EI、SSCI、Scopus
卷号：62
期号：10
页面范围：1898-1902
ISSN号：0160-5682
关键字：scheduling; parallel identical machines; maintenance activity; polynomial algorithm
摘要：In this paper, we consider parallel identical machines scheduling problems with a deteriorating maintenance activity. In this model, each machine has a deteriorating maintenance activity, that is, delaying the maintenance increases the time required to perform it. We need to make a decision on when to schedule the deteriorating maintenance activities and the sequence of jobs to minimize total completion time. We provide a polynomial time algorithm to solve the total completion time minimization problem. Journal of the Operational Research Society (2011) 62, 1898-1902. doi:10.1057/jors.2010.143 Published online 20 October 2010