A branch-and-bound algorithm to minimize total tardiness with different release dates

This article deals with the scheduling problem for minimizing total tardiness with unequal release dates. A set of jobs have to be scheduled on a machine able to perform only one job at a time. No preemptive job is allowed. This problem has been proven to be NP-hard. We prove some dominance properti... View More