On the equivalence of single machine earliness/tardiness problems with job rejection

•We consider the single-machine maximum earliness problem with rejection.•We present an O(nlogn) algorithm for the problem.•We consider the single-machine total earliness problem with rejection.•We present a pseudo-polynomial time algorithm for the problem. We present optimal algorithms for single-m...

Ausführliche Beschreibung