In this paper, we will find a pseudopolynomial algorithm to solve Qm∣∣Lmax 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∣∣Lmax, is strongly NP-hard.
@article{arxiv.2001.07887,
title = {A Pseudopolynomial Algorithm to Minimize Maximum Lateness on Multiple Related Machines},
author = {Elbert Du and Stan Zhang},
journal= {arXiv preprint arXiv:2001.07887},
year = {2020}
}