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

作者：Yang, Suh-Jenq; Hsu, Chou-Jung; Yang, Dar-Li^*

来源：Information Sciences, 2014, 260: 215-217.

DOI：10.1016/j.ins.2013.10.034

• Scheduling
• Rate-modifying activity
• Unrelated parallel-machine
• Total completion time

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.

• 出版日期2014-3-1
• 单位南开大学