Note on "Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time"

被引:5
|
作者
Yang, Suh-Jenq [1 ]
Hsu, Chou-Jung [1 ]
Yang, Dar-Li [2 ]
机构
[1] Nan Kai Univ Technol, Dept Ind Management, Nan Tou 542, Taiwan
[2] Natl Formosa Univ, Dept Informat Management, Yunlin 632, Taiwan
关键词
Scheduling; Rate-modifying activity; Unrelated parallel-machine; Total completion time;
D O I
10.1016/j.ins.2013.10.034
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This note shows that the problem studied by Hsu et al. (2011) [2] can be solved in O(n(m+3)) time even though the rate-modifying rate is larger than 1, where m is the number of machines and n is the number of jobs. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码:215 / 217
页数:3
相关论文
共 50 条