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

This paper considers a parallel-machine scheduling problem with machine maintenance. There are unavailable periods on each of the first k machines, and the remaining m - k machines are always available, where 1 [less-than-or-equals, slant] k [less-than-or-equals, slant] m is an...