Non-approximability results for scheduling


We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the problems under consideration can be approximated in polynomial time within arbitrarily good precision. Most of our results are derived by APX-hardness proofs. We show that, whereas… (More)


Cite this paper

@inproceedings{Hoogeveen1998NonapproximabilityRF, title={Non-approximability results for scheduling}, author={Han Hoogeveen and Petra Schuurman and Gerhard J. Woeginger}, year={1998} }