点击次数：
发布时间：2019-03-09
论文类型：期刊论文
发表时间：2014-01-01
发表刊物：OPTIMIZATION LETTERS
收录刊物：EI、SCIE
卷号：8
期号：1
页面范围：129-134
ISSN号：1862-4472
关键字：Scheduling; Maintenance activity; Unrelated parallel-machine; Total completion time
摘要：Wang et al. (J Operat Res Soc 62: 1898-1902, 2011) studied the m identical parallel-machine and unrelated parallel-machine scheduling with a deteriorating maintenance activity to minimize the total completion time. They showed that each problem can be solved in O(n (2m+3)) time, where n is the number of jobs. In this note, we discuss the unrelated parallel-machine setting and show that the problem can be optimally solved by a lower order algorithm.