We show that the problems of minimizing total completion time and of minimizing the number of late jobs on unrelated parallel machines, when preemption is allowed, are both NP-hard in the strong sense. The former result settles a long-standing open question
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
We show that the problems of minimizing total completion time and of minimizing the number of late j...
DOI
Add to ORKG