Lower and upper bounds for single machine problem with sequence dependent setup to minimize maximum tardiness

Tardiness is an important measure for customer satisfaction. This paper addresses the lower and upper bounds for the problem of scheduling N jobs on a single machine with due dates, sequence dependent setup times and no preemption where the objective is to minimize the maximum tardiness. Computational experiments demonstrate the effectiveness of the lower and upper bounds.