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

This note shows that the problem studied by Hsu et al. (2011) [2] can be solved in O(nm+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.