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

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(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.

[1] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .

[2] C.-Y. Lee,et al. Machine scheduling with a rate-modifying activity , 2001, Eur. J. Oper. Res..

[3] Abraham Kandel,et al. Discrete mathematics for computer scientists , 1983 .

[4] T. C. Edwin Cheng,et al. Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time , 2011, Inf. Sci..

[5] Peter Brucker,et al. Scheduling Algorithms , 1995 .

[6] Heng-Yong Tang,et al. Two-parallel machines scheduling with rate-modifying activities to minimize total completion time , 2009, Eur. J. Oper. Res..