冯恩民
Professor
Gender:Male
Alma Mater:大连工学院
School/Department:数学科学学院
E-Mail:emfeng@dlut.edu.cn
Hits:
Indexed by:期刊论文
Date of Publication:2014-01-01
Journal:OPTIMIZATION LETTERS
Included Journals:SCIE、EI
Volume:8
Issue:1
Page Number:129-134
ISSN No.:1862-4472
Key Words:Scheduling; Maintenance activity; Unrelated parallel-machine; Total completion time
Abstract: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.
