Scheduling tasks with sequence-dependent processing times

In this article we consider the problem of minimizing the maximum completion time of a sequence of n jobs on a single machine. Nonzero ready times and sequence-dependent processing times are allowed. Upper bounds, lower bounds, and dominance criteria are proposed and exploited in a branch-and-bound algorithm. Computational results are given.