Exact algorithms for single-machine scheduling with time windows and precedence constraints

We study a single‐machine scheduling problem that is a generalization of a number of problems for which computational procedures have already been published. Each job has a processing time, a release date, a due date, a deadline, and a weight representing the penalty per unit‐time delay beyond the due date. The goal is to schedule all jobs such that the total weighted tardiness penalty is minimized and both the precedence constraints as well as the time windows (implied by the release dates and the deadlines) are respected. We develop a branch‐and‐bound algorithm that solves the problem to optimality. Computational results show that our approach is effective in solving medium‐sized instances, and that it compares favorably with existing methods for special cases of the problem.