Wan, Long; Ding, Zhihao; Li, Yunpeng; Chen, Qianqian; … - In: European Journal of Operational Research 242 (2015) 1, pp. 45-50
In this paper, we study the problem of minimizing the maximum total completion time per machine on m parallel and identical machines. We prove that the problem is strongly NP-hard if m is a part of the input. When m is a given number, a pseudo-polynomial time dynamic programming is proposed. We...
