A Pseudopolynomial Algorithm to Minimize Maximum Lateness on Multiple Related Machines

01/22/2020

∙

by   Elbert Du, et al.

∙

0

∙

share

In this paper, we will find a pseudopolynomial algorithm to solve Qm || L_max and then we will prove that it is impossible to get any constant-factor approximation in polynomial time, and thus also impossible to have a PTAS for this problem. We will also show that the the problem when we don't assume a fixed number of machines, P || L_max, is strongly NP-hard.