We show that a number of scheduling problems with competing agents and earliness minimization objectives are equivalent to the corresponding problems with tardiness minimization objectives.