Van Den Akker, J.M.; Hoogeveen, J.A.; Van De Velde, S.L. - Center for Operations Research and Econometrics (CORE), … - 1996
Parallel machine scheduling problems concern the scheduling of "n" jobs on "m" machines to minimize some function of the job completion time. If preemption is not allowed, then most problems are not only NP-hard, but also very hard from a practical point of view. In this paper, we show that...