A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization.

•First bi-objective study of the total tardiness single machine problem with rejection.•We provide a Dynamic Program in the case with no hard deadlines.•We provide a Branch and Bound algorithm in the case with hard deadlines.•We display the efficiency of our B&B on benchmark instances.